Title :
A new approach to the traveling salesman problem
Author :
Yip, Percy P C ; Pao, Yoh-Han
Author_Institution :
Dept. of Electr. Eng. & Appl. Phys., Case Western Reserve Univ., Cleveland, OH, USA
Abstract :
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.
Keywords :
mathematical programming; mathematics computing; search problems; simulated annealing; travelling salesman problems; 10 city tour; 50 city tour; combinatorial optimization; evolutionary programming; near-optimum solution; simulated annealing; traveling salesman problem; Cities and towns; Computational modeling; Genetic programming; NP-complete problem; Physics; Simulated annealing; Space exploration; Temperature; Traveling salesman problems; Yttrium;
Conference_Titel :
Neural Networks, 1993. IJCNN '93-Nagoya. Proceedings of 1993 International Joint Conference on
Print_ISBN :
0-7803-1421-2
DOI :
10.1109/IJCNN.1993.716890
