ECTI TRANSACTIONS ON COMPUTER INFORMATION TECHNOLOGYVolume 12, No. 02, Month NOVEMBER, Year 2018, Pages 98 - 105
The cluster crossover operation for the symmetric travelling salesman problem
Ajchara Phu-ang, Duangjai Jitkongchuen
Abstract Download PDFThis paper proposed the new algorithm intended to solve a specific real-world problem, the symmetric travelling salesman problem. The proposed algorithm
is based on the concept of the galaxy based search algorithm (GbSA) and embedded the new ideas called the clockwise search process and the cluster crossover operation. In the first step, the nearest neighbor algorithm
introduces to generate the initial population.Then, the tabu list local search is employed to search for the new solution in surrounding areas of the initial
population in the second step. The clockwise search process and the cluster crossover operation are employed to create more diversity of the new solution.
Then, the final step, the hill climbing local search is utilized to increase the local search capabilities.Etc...
Travelling Salesman, Cluster Crossover, Clockwise Search, Galaxy Based Search