Title :
Simple approach to TSP by permutation of six cities and deletion of crossover
Author :
Matsumoto, Naoki ; Yashiki, Satoshi
Author_Institution :
Dept. of Electron. & Commun., Meiji Univ., Kawasaki, Japan
Abstract :
We examine an intuitive and very simple approach to find a suboptimal solution to TSP. The algorithm consists of the determination of the initial tour, permutation of the consecutive six cities and the deletion of the crossover. We have tested two kinds of algorithm to the examples on the Web site of TSPLIB95. The average ratio of the length of the obtained tour to the optimal length was 1.0464 and 1.0662
Keywords :
travelling salesman problems; city permutation; crossover deletion; initial tour; suboptimal solution; travelling salesman problem; Automatic testing; Chaotic communication; Cities and towns; Genetic algorithms; History; Hopfield neural networks; Joining processes; Linear programming; Neural networks; Traveling salesman problems;
Conference_Titel :
Communications, Computers and Signal Processing, 1999 IEEE Pacific Rim Conference on
Conference_Location :
Victoria, BC
Print_ISBN :
0-7803-5582-2
DOI :
10.1109/PACRIM.1999.799555
