Title :
An adaptive discrete particle swarm optimization for TSP problem
Author :
He, Ling ; Shi, Dejia ; Wang, Li
Author_Institution :
Sch. of Comput. & Electron. Eng., Hunan Univ. of Commerce, Changsha, China
Abstract :
An adaptive discrete particle swarm optimization (PSO) method is presented to solve the generalized traveling salesman problem (GTSP). The generalized vertex employed to represent the problem, by which the GTSP and TSP can be handled in uniform style. An uncertain searching strategy and local searching techniques are also employed to accelerate the convergent speed. Numerical results show the effectiveness of the proposed method.
Keywords :
numerical analysis; particle swarm optimisation; travelling salesman problems; TSP problem; adaptive discrete particle swarm optimization; local searching techniques; uncertain searching strategy; Algorithm design and analysis; Application software; Benchmark testing; Biological cells; Birds; Dynamic programming; Genetic algorithms; Particle swarm optimization; Space technology; Traveling salesman problems; Generalized Traveling Salesman Problem; Particle Swarm Optimization;
Conference_Titel :
Computational Intelligence and Industrial Applications, 2009. PACIIA 2009. Asia-Pacific Conference on
Conference_Location :
Wuhan
Print_ISBN :
978-1-4244-4606-3
DOI :
10.1109/PACIIA.2009.5406574
