Improve solution of TSP based on route-intersection inspection and elimination method and neighbor nodes interchanging method
Manhao Ma · Jisuanji yingyong yanjiu · 2011
There often was route-intersection in approximate solutions obtained by current algorithms when solving TSP,this paper proposed a new route-intersection inspection and elimination method,which could eliminate route-intersection completely and improve the quality of the solution of TSP markedly.Through analyzing the structure of the approximate solution,found that interchanging some neighbor nodes could also improve the solution effectively.Therefore,proposed a neighbor nodes interchanging method.Simulation results show that the methods proposed can make the solution first resolved by simulated annealing algorithm much better.