DocumentCode
3318238
Title
ACO with multiple nests’ cooperation and its application on narrow TSP
Author
Wang, Jin Biao ; Wang, Wei
Author_Institution
Comput. Sci. & Technol. Coll., Civil Aviation Univ. of China, Tianjin
fYear
2008
fDate
21-23 Sept. 2008
Firstpage
1
Lastpage
7
Abstract
On the base of researches on max-min ant system, a new algorithm named ant colony optimization with multiple nestspsila cooperation (MNC-ACO) is proposed to resolve the narrow traveling salesman problem. In MNC-ACO, we find out the edges contained in the shortest Hamiltonian circuit by the cooperation of elitist ants. Our experimental results clearly show that MNC-ACO has a faster convergence than max-min ant system and its solution quality is better.
Keywords
minimax techniques; travelling salesman problems; ACO; Hamiltonian circuit; ant colony optimization; elitist ants; max-min ant system; multiple nests cooperation; narrow TSP; narrow traveling salesman problem; Ant colony optimization; Circuits; Cities and towns; Euclidean distance; History; Iterative algorithms; Particle swarm optimization; System testing; Traveling salesman problems; USA Councils;
fLanguage
English
Publisher
ieee
Conference_Titel
Swarm Intelligence Symposium, 2008. SIS 2008. IEEE
Conference_Location
St. Louis, MO
Print_ISBN
978-1-4244-2704-8
Electronic_ISBN
978-1-4244-2705-5
Type
conf
DOI
10.1109/SIS.2008.4668305
Filename
4668305
Link To Document