Title :
A discrete PSO method for generalized TSP problem
Author :
Zhi, X.H. ; Xing, X.L. ; Wang, Q.X. ; Zhang, L.H. ; Yang, X.W. ; Zhou, C.G. ; Liang, Y.C.
Author_Institution :
Coll. of Comput. Sci. & Technol., Jilin Univ., Changchun, China
Abstract :
A novel discrete particle swarm optimization (PSO) method is presented to solve the generalized traveling salesman problem (GTSP). The "generalized vertex" is employed to represent the problem, by which the GTSP and TSP can be handled in a 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 :
query formulation; travelling salesman problems; discrete PSO method; generalized TSP problem; local searching technique; particle swarm optimization; traveling salesman problem; uncertain searching strategy; Acceleration; Application software; Biological cells; Computer science; Dynamic programming; Educational institutions; Information technology; Mathematics; Particle swarm optimization; Traveling salesman problems;
Conference_Titel :
Machine Learning and Cybernetics, 2004. Proceedings of 2004 International Conference on
Print_ISBN :
0-7803-8403-2
DOI :
10.1109/ICMLC.2004.1382200
