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.

关键词： differential ecolution algorithm tsp problem genetic algorithm

作者: Mei Mi Xue Huifeng Zhong Ming Gu Yu

作者单位: College of Automation, Northwestern Polytechnical University, Xian, Shaanxi, 710021, China

会议类型: 国际会议

会议名称: 2010 International Conference on Intelligent Computation Technology and Automation(2010 智能计算技术与自动化国际会议 ICICTA 2010)

会议地点: 长沙

会议语种:英文

页码: 544-547

在线出版日期: 2010-05-11（万方平台首次上网日期，不代表论文的发表时间）