A Novel Evolutionary Algorithm for Travelling Salesman Problem
Yuping Wang · Modern Electronics Technique · 2007
Travelling Salesman Problem is a famous problem in combinatorial optimization.A novel evolutionary algorithm is proposed to solve TSP in this paper.First,nature coding is used to express an individual;then,a new crossover strategy is designed to generate off spring based on using the edge information in the current population;furthermore,the random doublebridge move mutation is used as the mutation strategy;finally,an effective local search method incorporating 2-exchange and a special 3-exchange operator is designed to improve the quality of the solution.The simulation experiment shows that the proposed algorithm is effective.