Proceedings of the 2015 International Symposium on Computers & Informatics

The application status and prospect of ant colony algorithm

Authors
Jian Guo, Beiduo Zhou
Corresponding Author
Jian Guo
Available Online January 2015.
DOI
10.2991/isci-15.2015.26How to use a DOI?
Keywords
Ant colony algorithm; application status; prospect
Abstract

Ant colony algorithm is one of the representative methods of swarm intelligence. It is a kind of simulation optimization algorithm. Because it has many good qualities, many NP - hard problems have been solved successfully by using it. This article first expounds the basic theory of ant colony algorithm and makes the traveling salesman problem (TSP) an example to illustrate the basic model of ant colony algorithm. Then it summarized its application in static and dynamic combination optimization problem. Finally, the article makes the prospect of the direction of ant colony algorithm in research and application.

Copyright
© 2015, the Authors. Published by Atlantis Press.
Open Access
This is an open access article distributed under the CC BY-NC license (http://creativecommons.org/licenses/by-nc/4.0/).

Download article (PDF)

Volume Title
Proceedings of the 2015 International Symposium on Computers & Informatics
Series
Advances in Computer Science Research
Publication Date
January 2015
ISBN
978-94-62520-56-1
ISSN
2352-538X
DOI
10.2991/isci-15.2015.26How to use a DOI?
Copyright
© 2015, the Authors. Published by Atlantis Press.
Open Access
This is an open access article distributed under the CC BY-NC license (http://creativecommons.org/licenses/by-nc/4.0/).

Cite this article

TY  - CONF
AU  - Jian Guo
AU  - Beiduo Zhou
PY  - 2015/01
DA  - 2015/01
TI  - The application status and prospect of ant colony algorithm
BT  - Proceedings of the 2015 International Symposium on Computers & Informatics
PB  - Atlantis Press
SP  - 173
EP  - 180
SN  - 2352-538X
UR  - https://doi.org/10.2991/isci-15.2015.26
DO  - 10.2991/isci-15.2015.26
ID  - Guo2015/01
ER  -