A Solution to Traveling Salesman Problem by Using Local Evolutionary Algorithm
Yuanxiang Li · Jisuanji gongcheng · 2006
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 algorithm in neighborhood search with robust quality of evolutionary algorithm in global search in order to obtain global optimum.The experimental results show that the algorithm is of potential to obtain global optimum and it is more accurate than other evolutionary methods for the TSP.