Press and jump algorithm for traveling salesman problem
Mei-Jie Zhu, Xu-hong Tian, Shangwei Yan, Ai-Dong Sun · 2004
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.