A new approach to the traveling salesman problem
P.P.C. Yip, Yoh‐Han Pao · 2005
A new technique for combinatorial optimization is proposed. It is a combination of several variations on existing themes. Specifically it makes combined use of evolutionary programming and simulated annealing in novel ways. Simulation results are reported for 10 city and 50 city tours for the traveling salesman problem. The results show that the authors' proposed (GESA) approach can discover a very good near-optimum solution after examining an extremely small fraction of possible solutions.