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
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;
Conference_Titel :
Machine Learning and Cybernetics, 2003 International Conference on
Print_ISBN :
0-7803-8131-9
DOI :
10.1109/ICMLC.2003.1259669
