DocumentCode :
3344312
Title :
Chaos Particle Swarm Optimization Applications in the TSP problem
Author :
Chen Legeng ; Wang Zhida ; He Chuangyi
Author_Institution :
Sch. of Comput. & Control, Guilin Univ. of Electron. Technol., Guilin, China
fYear :
2009
fDate :
14-17 Oct. 2009
Firstpage :
682
Lastpage :
685
Abstract :
Search strategies are embadded into the chaotic particle swarm algorithm, the inertia factor and the acceleration factor use chaotic sequence in real time with every change. In order to enhance the diversity of particles, adjust the global particle swarm optimization and local search capabilities, avoiding the algorithm into a local minimum excellent, it is combined with random exchange of order to deal with TSP. Experimental results show that the method can significantly enhance the global optimality algorithm.
Keywords :
chaos; particle swarm optimisation; travelling salesman problems; TSP problem; acceleration factor; chaos particle swarm optimization applications; chaotic sequence; inertia factor; Application software; Chaos; Cities and towns; Costs; Genetics; Helium; Optimization methods; Parameter estimation; Particle swarm optimization; Traveling salesman problems; CPSO; Logistic Function; PSO; TSP; component; exchange sequence;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Genetic and Evolutionary Computing, 2009. WGEC '09. 3rd International Conference on
Conference_Location :
Guilin
Print_ISBN :
978-0-7695-3899-0
Type :
conf
DOI :
10.1109/WGEC.2009.194
Filename :
5402745
Link To Document :
بازگشت