An Improved Differential Evolution Algorithm for TSP Problem

TSP (Traveling Salesman Problem) is a kind of typical NP problems, mostly settled by genetic algorithm (GA). Differential Evolution Algorithm (DE) is a kind of new Evolution Algorithm which has many similarities with GA. We proposed to solve TSP problem by improved differential evolution algorithm. Added an auxiliary operator for regulating integer sequence to mutation process, and replaced the original crossover operator by Liuhai crossover operator. Experimental results show that this method can effectively improve the convergence speed and optimal quality, show good characteristic in the solution of TSP problem.