Improved genetic algorithm based on clustering to solve TSP
Chengjuan Zhu · Journal of Yanshan University · 2007
Aiming at the problem of time-cost and path-search when solving the large scale TSP (Traveling Salesman Problem), an improved genetic algorithm based on clustering technique is proposed to solve the PR144 cites for TSE As indicated by experi- mental results,the final path distance of the PRI44 cites for TSP is shorter than the TSPLIB known.Furthermore,the final path distance and the time cost is shorter