A Discrete Differential Evolution Algorithm for TSP Problem
NING Guiying
CAO Dunqian
ZHOU Yongquan
Abstract：A discrete differential evolution algorithm is proposed for solving traveling salesman problem(TSP)in this article. In the algorithm,on the one hand,the differential evolution algorithm with a new coding method is used to solve a discrete TSP, which is often used to solve problems on a continuous domain. On the other hand,the 2-OPT algorithm is also introduced;the new algorithm combined the global search with the local search effectively. The classical TSP has been tested,the simulation results show that the proposed algorithm has strong stability and it is an effective method for solving TSP.
Keywords：differential evolutionTSPheuristic algorithmfitness2-OPT
Publication Date：2017-01-01
Online Publishing Date：2025-08-15(First online date of this platform, not the publication date of the document)
Pages：7( 2136-2142 )