Ant colony optimization : : methods and applications / / edited by Avi Ostfeld.

Ants communicate information by leaving pheromone tracks. A moving ant leaves, in varying quantities, some pheromone on the ground to mark its way. While an isolated ant moves essentially at random, an ant encountering a previously laid trail is able to detect it and decide with high probability to...

Full description

Saved in:
Bibliographic Details
TeilnehmendeR:
Place / Publishing House:Rijeka, Croatia : : InTech,, [2011]
©2011
Year of Publication:2011
Language:English
Physical Description:1 online resource (354 pages)
Tags: Add Tag
No Tags, Be the first to tag this record!
id 993547433804498
ctrlnum (CKB)3230000000075545
(NjHacI)993230000000075545
(oapen)https://directory.doabooks.org/handle/20.500.12854/64924
(EXLCZ)993230000000075545
collection bib_alma
record_format marc
spelling Ostfeld, Avi edt
Ant colony optimization : methods and applications / edited by Avi Ostfeld.
Ant Colony Optimization
IntechOpen 2011
Rijeka, Croatia : InTech, [2011]
©2011
1 online resource (354 pages)
text txt rdacontent
computer c rdamedia
online resource cr rdacarrier
Open access Unrestricted online access star
Description based on: online resource; title from PDF information screen (InTech, viewed October 10, 2022).
Ants communicate information by leaving pheromone tracks. A moving ant leaves, in varying quantities, some pheromone on the ground to mark its way. While an isolated ant moves essentially at random, an ant encountering a previously laid trail is able to detect it and decide with high probability to follow it, thus reinforcing the track with its own pheromone. The collective behavior that emerges is thus a positive feedback: where the more the ants following a track, the more attractive that track becomes for being followed; thus the probability with which an ant chooses a path increases with the number of ants that previously chose the same path. This elementary ant's behavior inspired the development of ant colony optimization by Marco Dorigo in 1992, constructing a meta-heuristic stochastic combinatorial computational methodology belonging to a family of related meta-heuristic methods such as simulated annealing, Tabu search and genetic algorithms. This book covers in twenty chapters state of the art methods and applications of utilizing ant colony optimization algorithms. New methods and theory such as multi colony ant algorithm based upon a new pheromone arithmetic crossover and a repulsive operator, new findings on ant colony convergence, and a diversity of engineering and science applications from transportation, water resources, electrical and computer science disciplines are presented.
English
Mathematical optimization.
Neural networks & fuzzy systems
953-307-157-5
Ostfeld, Avi, editor.
language English
format eBook
author2 Ostfeld, Avi,
author_facet Ostfeld, Avi,
author2_variant a o ao
a o ao
author2_role TeilnehmendeR
title Ant colony optimization : methods and applications /
spellingShingle Ant colony optimization : methods and applications /
title_sub methods and applications /
title_full Ant colony optimization : methods and applications / edited by Avi Ostfeld.
title_fullStr Ant colony optimization : methods and applications / edited by Avi Ostfeld.
title_full_unstemmed Ant colony optimization : methods and applications / edited by Avi Ostfeld.
title_auth Ant colony optimization : methods and applications /
title_alt Ant Colony Optimization
title_new Ant colony optimization :
title_sort ant colony optimization : methods and applications /
publisher IntechOpen
InTech,
publishDate 2011
physical 1 online resource (354 pages)
isbn 953-51-5980-1
953-307-157-5
callnumber-first Q - Science
callnumber-subject QA - Mathematics
callnumber-label QA402
callnumber-sort QA 3402.5 A58 42011
illustrated Not Illustrated
dewey-hundreds 500 - Science
dewey-tens 510 - Mathematics
dewey-ones 519 - Probabilities & applied mathematics
dewey-full 519.3
dewey-sort 3519.3
dewey-raw 519.3
dewey-search 519.3
work_keys_str_mv AT ostfeldavi antcolonyoptimizationmethodsandapplications
AT ostfeldavi antcolonyoptimization
status_str n
ids_txt_mv (CKB)3230000000075545
(NjHacI)993230000000075545
(oapen)https://directory.doabooks.org/handle/20.500.12854/64924
(EXLCZ)993230000000075545
carrierType_str_mv cr
is_hierarchy_title Ant colony optimization : methods and applications /
author2_original_writing_str_mv noLinkedField
_version_ 1787977704128118784
fullrecord <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>02780nam a2200409 i 4500</leader><controlfield tag="001">993547433804498</controlfield><controlfield tag="005">20240112203917.0</controlfield><controlfield tag="006">m o d </controlfield><controlfield tag="007">cr#|||||||||||</controlfield><controlfield tag="008">221010s2011 ci o 000 0 eng d</controlfield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">953-51-5980-1</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(CKB)3230000000075545</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(NjHacI)993230000000075545</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(oapen)https://directory.doabooks.org/handle/20.500.12854/64924</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(EXLCZ)993230000000075545</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">NjHacI</subfield><subfield code="b">eng</subfield><subfield code="e">rda</subfield><subfield code="c">NjHacl</subfield></datafield><datafield tag="041" ind1="0" ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="050" ind1=" " ind2="4"><subfield code="a">QA402.5</subfield><subfield code="b">.A58 2011</subfield></datafield><datafield tag="082" ind1="0" ind2="4"><subfield code="a">519.3</subfield><subfield code="2">23</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Ostfeld, Avi</subfield><subfield code="4">edt</subfield></datafield><datafield tag="245" ind1="0" ind2="0"><subfield code="a">Ant colony optimization :</subfield><subfield code="b">methods and applications /</subfield><subfield code="c">edited by Avi Ostfeld.</subfield></datafield><datafield tag="246" ind1=" " ind2=" "><subfield code="a">Ant Colony Optimization</subfield></datafield><datafield tag="260" ind1=" " ind2=" "><subfield code="b">IntechOpen</subfield><subfield code="c">2011</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Rijeka, Croatia :</subfield><subfield code="b">InTech,</subfield><subfield code="c">[2011]</subfield></datafield><datafield tag="264" ind1=" " ind2="4"><subfield code="c">©2011</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">1 online resource (354 pages)</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="a">text</subfield><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="a">computer</subfield><subfield code="b">c</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="a">online resource</subfield><subfield code="b">cr</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="506" ind1=" " ind2=" "><subfield code="a">Open access</subfield><subfield code="f">Unrestricted online access</subfield><subfield code="2">star</subfield></datafield><datafield tag="588" ind1=" " ind2=" "><subfield code="a">Description based on: online resource; title from PDF information screen (InTech, viewed October 10, 2022).</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">Ants communicate information by leaving pheromone tracks. A moving ant leaves, in varying quantities, some pheromone on the ground to mark its way. While an isolated ant moves essentially at random, an ant encountering a previously laid trail is able to detect it and decide with high probability to follow it, thus reinforcing the track with its own pheromone. The collective behavior that emerges is thus a positive feedback: where the more the ants following a track, the more attractive that track becomes for being followed; thus the probability with which an ant chooses a path increases with the number of ants that previously chose the same path. This elementary ant's behavior inspired the development of ant colony optimization by Marco Dorigo in 1992, constructing a meta-heuristic stochastic combinatorial computational methodology belonging to a family of related meta-heuristic methods such as simulated annealing, Tabu search and genetic algorithms. This book covers in twenty chapters state of the art methods and applications of utilizing ant colony optimization algorithms. New methods and theory such as multi colony ant algorithm based upon a new pheromone arithmetic crossover and a repulsive operator, new findings on ant colony convergence, and a diversity of engineering and science applications from transportation, water resources, electrical and computer science disciplines are presented.</subfield></datafield><datafield tag="546" ind1=" " ind2=" "><subfield code="a">English</subfield></datafield><datafield tag="650" ind1=" " ind2="0"><subfield code="a">Mathematical optimization.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Neural networks &amp; fuzzy systems</subfield></datafield><datafield tag="776" ind1=" " ind2=" "><subfield code="z">953-307-157-5</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Ostfeld, Avi,</subfield><subfield code="e">editor.</subfield></datafield><datafield tag="906" ind1=" " ind2=" "><subfield code="a">BOOK</subfield></datafield><datafield tag="ADM" ind1=" " ind2=" "><subfield code="b">2024-01-13 08:09:26 Europe/Vienna</subfield><subfield code="f">system</subfield><subfield code="c">marc21</subfield><subfield code="a">2012-12-09 08:17:33 Europe/Vienna</subfield><subfield code="g">false</subfield></datafield><datafield tag="AVE" ind1=" " ind2=" "><subfield code="i">DOAB Directory of Open Access Books</subfield><subfield code="P">DOAB Directory of Open Access Books</subfield><subfield code="x">https://eu02.alma.exlibrisgroup.com/view/uresolver/43ACC_OEAW/openurl?u.ignore_date_coverage=true&amp;portfolio_pid=5338572690004498&amp;Force_direct=true</subfield><subfield code="Z">5338572690004498</subfield><subfield code="b">Available</subfield><subfield code="8">5338572690004498</subfield></datafield></record></collection>