Solving traveling salesman problem by using a local evolutionary algorithm

摘要

This paper introduces a new local evolutionary algorithm (LEA) and uses it to solve the traveling salesman problem. The algorithm incorporates speediness of local search methods in neighborhood search with robustness of evolutionary methods in global search in order to obtain global optimum. The experimental results show that the algorithm is of potential to obtain global optimum or more accurate solutions than other evolutionary methods for the TSP.