Ant colony optimization:
An overview of the rapidly growing field of ant colony optimization that describes theoretical findings, the major algorithms, and current applications.The complex social behaviors of ants have been much studied by science, and computer scientists are now finding that these behavior patterns can pro...
Gespeichert in:
| Beteilige Person: | |
|---|---|
| Weitere beteiligte Personen: | |
| Format: | E-Book |
| Sprache: | Englisch |
| Veröffentlicht: |
Cambridge, Mass.
MIT Press
©2004
|
| Links: | https://doi.org/10.7551/mitpress/1290.001.0001?locatt=mode:legacy |
| Zusammenfassung: | An overview of the rapidly growing field of ant colony optimization that describes theoretical findings, the major algorithms, and current applications.The complex social behaviors of ants have been much studied by science, and computer scientists are now finding that these behavior patterns can provide models for solving difficult combinatorial optimization problems. The attempt to develop algorithms inspired by one aspect of ant behavior, the ability to find what computer scientists would call shortest paths, has become the field of ant colony optimization (ACO), the most successful and widely recognized algorithmic technique based on ant behavior. This book presents an overview of this rapidly growing field, from its theoretical inception to practical applications, including descriptions of many available ACO algorithms and their uses.The book first describes the translation of observed ant behavior into working optimization algorithms. The ant colony metaheuristic is then introduced and viewed in the general context of combinatorial optimization. This is followed by a detailed description and guide to all major ACO algorithms and a report on current theoretical findings. The book surveys ACO applications now in use, including routing, assignment, scheduling, subset, machine learning, and bioinformatics problems. AntNet, an ACO algorithm designed for the network routing problem, is described in detail. The authors conclude by summarizing the progress in the field and outlining future research directions. Each chapter ends with bibliographic material, bullet points setting out important ideas covered in the chapter, and exercises. Ant Colony Optimization will be of interest to academic and industry researchers, graduate students, and practitioners who wish to learn how to implement ACO algorithms. |
| Beschreibung: | "A Bradford book." |
| Umfang: | 1 Online-Ressource (xi, 305 Seiten) Illustrationen |
| ISBN: | 0262256037 141756041X 9780262256032 9781417560417 |
Internformat
MARC
| LEADER | 00000cam a22000004a 4500 | ||
|---|---|---|---|
| 001 | ZDB-260-MPOB-1290 | ||
| 003 | MaCbMITP | ||
| 005 | 20190503073326.0 | ||
| 006 | m o d | ||
| 007 | cr cnu|||unuuu | ||
| 008 | 041207s2004 maua ob 001 0 eng d | ||
| 020 | |a 0262256037 | ||
| 020 | |a 141756041X | ||
| 020 | |a 9780262256032 | ||
| 020 | |a 9781417560417 | ||
| 100 | 1 | |a Dorigo, Marco | |
| 245 | 1 | 0 | |a Ant colony optimization |c Marco Dorigo, Thomas Stützle |
| 264 | 1 | |a Cambridge, Mass. |b MIT Press |c ©2004 | |
| 300 | |a 1 Online-Ressource (xi, 305 Seiten) |b Illustrationen | ||
| 336 | |b txt | ||
| 337 | |b c | ||
| 338 | |b cr | ||
| 500 | |a "A Bradford book." | ||
| 520 | |a An overview of the rapidly growing field of ant colony optimization that describes theoretical findings, the major algorithms, and current applications.The complex social behaviors of ants have been much studied by science, and computer scientists are now finding that these behavior patterns can provide models for solving difficult combinatorial optimization problems. The attempt to develop algorithms inspired by one aspect of ant behavior, the ability to find what computer scientists would call shortest paths, has become the field of ant colony optimization (ACO), the most successful and widely recognized algorithmic technique based on ant behavior. This book presents an overview of this rapidly growing field, from its theoretical inception to practical applications, including descriptions of many available ACO algorithms and their uses.The book first describes the translation of observed ant behavior into working optimization algorithms. The ant colony metaheuristic is then introduced and viewed in the general context of combinatorial optimization. This is followed by a detailed description and guide to all major ACO algorithms and a report on current theoretical findings. The book surveys ACO applications now in use, including routing, assignment, scheduling, subset, machine learning, and bioinformatics problems. AntNet, an ACO algorithm designed for the network routing problem, is described in detail. The authors conclude by summarizing the progress in the field and outlining future research directions. Each chapter ends with bibliographic material, bullet points setting out important ideas covered in the chapter, and exercises. Ant Colony Optimization will be of interest to academic and industry researchers, graduate students, and practitioners who wish to learn how to implement ACO algorithms. | ||
| 700 | 1 | |a Stützle, Thomas | |
| 776 | 0 | 8 | |i Erscheint auch als |n Druck-Ausgabe |z 0262042193 |
| 776 | 0 | 8 | |i Erscheint auch als |n Druck-Ausgabe |z 9780262042192 |
| 966 | 4 | 0 | |l DE-91 |p ZDB-260-MPOB |q TUM_PDA_MPOB |3 MIT Press |u https://doi.org/10.7551/mitpress/1290.001.0001?locatt=mode:legacy |3 Volltext |
| 912 | |a ZDB-260-MPOB | ||
| 912 | |a ZDB-260-MPOB | ||
| 049 | |a DE-91 | ||
Datensatz im Suchindex
| DE-BY-TUM_katkey | ZDB-260-MPOB-1290 |
|---|---|
| _version_ | 1821493840267182080 |
| adam_text | |
| any_adam_object | |
| author | Dorigo, Marco |
| author2 | Stützle, Thomas |
| author2_role | |
| author2_variant | t s ts |
| author_facet | Dorigo, Marco Stützle, Thomas |
| author_role | |
| author_sort | Dorigo, Marco |
| author_variant | m d md |
| building | Verbundindex |
| bvnumber | localTUM |
| collection | ZDB-260-MPOB |
| format | eBook |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>02762cam a22003134a 4500</leader><controlfield tag="001">ZDB-260-MPOB-1290</controlfield><controlfield tag="003">MaCbMITP</controlfield><controlfield tag="005">20190503073326.0</controlfield><controlfield tag="006">m o d </controlfield><controlfield tag="007">cr cnu|||unuuu</controlfield><controlfield tag="008">041207s2004 maua ob 001 0 eng d</controlfield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">0262256037</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">141756041X</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9780262256032</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9781417560417</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Dorigo, Marco</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Ant colony optimization</subfield><subfield code="c">Marco Dorigo, Thomas Stützle</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Cambridge, Mass.</subfield><subfield code="b">MIT Press</subfield><subfield code="c">©2004</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">1 Online-Ressource (xi, 305 Seiten)</subfield><subfield code="b">Illustrationen</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="b">txt</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="b">c</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="b">cr</subfield></datafield><datafield tag="500" ind1=" " ind2=" "><subfield code="a">"A Bradford book."</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">An overview of the rapidly growing field of ant colony optimization that describes theoretical findings, the major algorithms, and current applications.The complex social behaviors of ants have been much studied by science, and computer scientists are now finding that these behavior patterns can provide models for solving difficult combinatorial optimization problems. The attempt to develop algorithms inspired by one aspect of ant behavior, the ability to find what computer scientists would call shortest paths, has become the field of ant colony optimization (ACO), the most successful and widely recognized algorithmic technique based on ant behavior. This book presents an overview of this rapidly growing field, from its theoretical inception to practical applications, including descriptions of many available ACO algorithms and their uses.The book first describes the translation of observed ant behavior into working optimization algorithms. The ant colony metaheuristic is then introduced and viewed in the general context of combinatorial optimization. This is followed by a detailed description and guide to all major ACO algorithms and a report on current theoretical findings. The book surveys ACO applications now in use, including routing, assignment, scheduling, subset, machine learning, and bioinformatics problems. AntNet, an ACO algorithm designed for the network routing problem, is described in detail. The authors conclude by summarizing the progress in the field and outlining future research directions. Each chapter ends with bibliographic material, bullet points setting out important ideas covered in the chapter, and exercises. Ant Colony Optimization will be of interest to academic and industry researchers, graduate students, and practitioners who wish to learn how to implement ACO algorithms.</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Stützle, Thomas</subfield></datafield><datafield tag="776" ind1="0" ind2="8"><subfield code="i">Erscheint auch als</subfield><subfield code="n">Druck-Ausgabe</subfield><subfield code="z">0262042193</subfield></datafield><datafield tag="776" ind1="0" ind2="8"><subfield code="i">Erscheint auch als</subfield><subfield code="n">Druck-Ausgabe</subfield><subfield code="z">9780262042192</subfield></datafield><datafield tag="966" ind1="4" ind2="0"><subfield code="l">DE-91</subfield><subfield code="p">ZDB-260-MPOB</subfield><subfield code="q">TUM_PDA_MPOB</subfield><subfield code="3">MIT Press</subfield><subfield code="u">https://doi.org/10.7551/mitpress/1290.001.0001?locatt=mode:legacy</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">ZDB-260-MPOB</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">ZDB-260-MPOB</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-91</subfield></datafield></record></collection> |
| id | ZDB-260-MPOB-1290 |
| illustrated | Illustrated |
| indexdate | 2025-01-17T11:04:52Z |
| institution | BVB |
| isbn | 0262256037 141756041X 9780262256032 9781417560417 |
| language | English |
| open_access_boolean | |
| owner | DE-91 DE-BY-TUM |
| owner_facet | DE-91 DE-BY-TUM |
| physical | 1 Online-Ressource (xi, 305 Seiten) Illustrationen |
| psigel | ZDB-260-MPOB TUM_PDA_MPOB ZDB-260-MPOB |
| publishDate | 2004 |
| publishDateSearch | 2004 |
| publishDateSort | 2004 |
| publisher | MIT Press |
| record_format | marc |
| spelling | Dorigo, Marco Ant colony optimization Marco Dorigo, Thomas Stützle Cambridge, Mass. MIT Press ©2004 1 Online-Ressource (xi, 305 Seiten) Illustrationen txt c cr "A Bradford book." An overview of the rapidly growing field of ant colony optimization that describes theoretical findings, the major algorithms, and current applications.The complex social behaviors of ants have been much studied by science, and computer scientists are now finding that these behavior patterns can provide models for solving difficult combinatorial optimization problems. The attempt to develop algorithms inspired by one aspect of ant behavior, the ability to find what computer scientists would call shortest paths, has become the field of ant colony optimization (ACO), the most successful and widely recognized algorithmic technique based on ant behavior. This book presents an overview of this rapidly growing field, from its theoretical inception to practical applications, including descriptions of many available ACO algorithms and their uses.The book first describes the translation of observed ant behavior into working optimization algorithms. The ant colony metaheuristic is then introduced and viewed in the general context of combinatorial optimization. This is followed by a detailed description and guide to all major ACO algorithms and a report on current theoretical findings. The book surveys ACO applications now in use, including routing, assignment, scheduling, subset, machine learning, and bioinformatics problems. AntNet, an ACO algorithm designed for the network routing problem, is described in detail. The authors conclude by summarizing the progress in the field and outlining future research directions. Each chapter ends with bibliographic material, bullet points setting out important ideas covered in the chapter, and exercises. Ant Colony Optimization will be of interest to academic and industry researchers, graduate students, and practitioners who wish to learn how to implement ACO algorithms. Stützle, Thomas Erscheint auch als Druck-Ausgabe 0262042193 Erscheint auch als Druck-Ausgabe 9780262042192 |
| spellingShingle | Dorigo, Marco Ant colony optimization |
| title | Ant colony optimization |
| title_auth | Ant colony optimization |
| title_exact_search | Ant colony optimization |
| title_full | Ant colony optimization Marco Dorigo, Thomas Stützle |
| title_fullStr | Ant colony optimization Marco Dorigo, Thomas Stützle |
| title_full_unstemmed | Ant colony optimization Marco Dorigo, Thomas Stützle |
| title_short | Ant colony optimization |
| title_sort | ant colony optimization |
| work_keys_str_mv | AT dorigomarco antcolonyoptimization AT stutzlethomas antcolonyoptimization |