DocumentCode
401634
Title
Press and jump algorithm for traveling salesman problem
Author
Zhu, Meijie ; Tian, Xu-hong ; Yan, Shangwei ; Sun, Ai-dong
Author_Institution
Dept. of Comput., South China Agric. Univ., Guangzhou, China
Volume
2
fYear
2003
fDate
2-5 Nov. 2003
Firstpage
1204
Abstract
A press and jump algorithm (PJA) is proposed to solve the prominent problem of TSP in this paper, and it is shown that the proposed algorithm can give the optimal solution of the TSP in finite steps. The validity of the PJA has been confirmed by the experimental results.
Keywords
genetic algorithms; travelling salesman problems; TSP; optimal solution; press and jump algorithm; traveling salesman problem; Cities and towns; Computer science; Costs; Genetic algorithms; Heuristic algorithms; Lagrangian functions; Nearest neighbor searches; Sun; Traveling salesman problems; Tree graphs;
fLanguage
English
Publisher
ieee
Conference_Titel
Machine Learning and Cybernetics, 2003 International Conference on
Print_ISBN
0-7803-8131-9
Type
conf
DOI
10.1109/ICMLC.2003.1259669
Filename
1259669
Link To Document