DocumentCode :
3471709
Title :
Chaotic Particle Swarm Optimization Algorithm for Traveling Salesman Problem
Author :
Yuan, Zhenglei ; Yang, Liliang ; Wu, Yaohua ; Liao, Li ; Li, Guoqiang
Author_Institution :
Shandong Univ. Jinan, Jinan
fYear :
2007
fDate :
18-21 Aug. 2007
Firstpage :
1121
Lastpage :
1124
Abstract :
In this paper, a novel algorithm based on particle optimization algorithm (PSO) and chaos optimization algorithm (COA) is presented to solve traveling salesman problem. Some new operators are proposed to overcome the difficulties of implementing PSO into solving the discreet problems. Meanwhile embedded with chaos optimization algorithm (COA) it can enhance particle´s global searching ability so as not to converge to the local optimal solutions too quickly. The experiment results of several benchmark test problems show its validity and satisfactory effect.
Keywords :
particle swarm optimisation; travelling salesman problems; chaotic particle swarm optimization algorithm; particle global searching ability; traveling salesman problem; Automation; Chaos; Cities and towns; Equations; Iterative algorithms; Logistics; Neural networks; Optimization methods; Particle swarm optimization; Traveling salesman problems; Chaos optimization algorithm (COA); Particle swarm optimization (PSO); Position swap; Traveling Salesman Problem (TSP);
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Automation and Logistics, 2007 IEEE International Conference on
Conference_Location :
Jinan
Print_ISBN :
978-1-4244-1531-1
Type :
conf
DOI :
10.1109/ICAL.2007.4338736
Filename :
4338736
Link To Document :
بازگشت