Solving travelling salesman problem based on nearest neighbor strategy
Yunqiang Li · Computer Engineering and Applications Journal · 2009
According to the specific properties of TSP and the spirit of neighborhood search,the paper presents a new genetic algorithm based on the nearest neighbor strategy to solve TSP.First,calculate the nearest neighbor schemas according to the TSP and use the schemas to generate the initial population.Then introduce one of the schemas randomly into every generation. Simulation tests show that the new algorithm increases the convergence speed heavily and has better effect on the process of GAs.As the city number increases,its superiority appears more obviously.