Proceedings of the 2nd International Conference On Systems Engineering and Modeling (ICSEM 2013)

<Previous Article In Volume
Next Article In Volume>

Improved Ant Colony Algorithm for Optimal Solution TSP

Authors
Tianyuan Zhou
Corresponding Author
Tianyuan Zhou
Available Online April 2013.
DOI
10.2991/icsem.2013.91How to use a DOI?
Keywords
Ant Colony Algorithm, Distance, Pheromone, Iteration
Abstract

Based on the ant colony algorithm analysis and research, this paper proposed an improved ant colony algorithm. Through updating pheromone and optimal search strategy, then applied to the Traveling Salesman Problem (TSP), effectively improved the searching capability of the algorithm. Finally through the simulation testing and analysis, verified that the improved ant colony algorithm is effective, and has good performance.

Copyright
© 2013, 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)

<Previous Article In Volume
Next Article In Volume>
Volume Title
Proceedings of the 2nd International Conference On Systems Engineering and Modeling (ICSEM 2013)
Series
Advances in Intelligent Systems Research
Publication Date
April 2013
ISBN
978-94-91216-42-8
ISSN
1951-6851
DOI
10.2991/icsem.2013.91How to use a DOI?
Copyright
© 2013, 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

risenwbib
TY  - CONF
AU  - Tianyuan Zhou
PY  - 2013/04
DA  - 2013/04
TI  - Improved Ant Colony Algorithm for Optimal Solution TSP
BT  - Proceedings of the 2nd International Conference On Systems Engineering and Modeling (ICSEM 2013)
PB  - Atlantis Press
SP  - 469
EP  - 472
SN  - 1951-6851
UR  - https://doi.org/10.2991/icsem.2013.91
DO  - 10.2991/icsem.2013.91
ID  - Zhou2013/04
ER  -