一种解TSP问题的混合算法  

A HYBRID APPROACH TO TRAVELING SALESMAN PROBLEM

作　　者：朱学锋[1] 刘书家[1] 

机构地区：[1]北京工商大学计算机学院,北京100037

出　　处：《北京工商大学学报（自然科学版）》2008年第4期71-73,共3页Journal of Beijing Technology and Business University:Natural Science Edition

摘　　要：把经典启发式算法与遗传算法相结合,构造了一种混合式算法.这种算法通过加入2-opt算法改进了边重组算法,兼有2-opt算法和边重组遗传算法的优点.对于小于80个城市的旅行商问题,能收敛到全局最优解.It describes a hybrid approach to the Traveling Salesman Problem using heuristics and genetic algorithm. This hybrid algorithm improves the edge recombination algorithm when combined with 2-opt algorithm. Thus it embraces the advantages of both the 2-opt algorithm and the edge recombination algorithm. It has found optimal solutions for the problem instances which have no more than 80 cities.

关 键 词：旅行商问题 边重组 遗传算法 

分 类 号：TP301.6[自动化与计算机技术—计算机系统结构]