A Polynomial Time Evolution Algorithm for the Traveling Salesman Problem
Jianwu Dang, Zhenhai Zhang · 2006
A genetic algorithm simulating evolution is proposed to yield near optional solution to the traveling salesman problem. Noting that Darwinian evolution is itself optimization process, we propose a heuristic algorithm that incorporates the tents of natural selection. The time complexity of this algorithm is equivalent to the fastest sorting scheme. The algorithm is used to solve the China - traveling salesman problem, the shortest route is obtained in this paper