一种求解TSP问题的新型遗传算法  

A New Genetic Algorithm for the Traveling Salesman Problem

作　　者：李艳萍[1] 张挺[1] 

机构地区：[1]太原理工大学信息工程学院,山西太原030024

出　　处：《太原理工大学学报》2008年第3期268-271,共4页Journal of Taiyuan University of Technology

基　　金：山西省自然科学基金资助项目(20041044)

摘　　要：针对以往各种遗传算法解决旅行商问题(TSP)后期收敛比较困难的问题,提出一种新的遗传变异算子。首先提出了搜索半径概念,使得搜索的空间变大,进而结合选择算子、交叉算子,提出了一种新的解决TSP问题的方法。仿真实验表明:该算法同单一的贪婪遗传算子算法想比,具有更好的性能和全局搜索能力。Introduces a new genetic mutation arithmetic operators to solve the problem of difficulty in the convergence of old genetic algorithms. The concept of searching round is firstly proposed in order to make the searching space become bigger,then combines with selecting arithmetic operators and cross-over arithmetic operators to form a new way to solve TSP problem. The simulated experiment shows that the new algorithm has a better performance and global searching ability than the algorithm which has single greed-mutation arithmetic operators.

关 键 词：遗传算法 搜索半径 旅行商问题 

分 类 号：TP18[自动化与计算机技术—控制理论与控制工程]