| 求解TSP的混合遗传算法 |
| |
| 引用本文： | 莫海芳,康立山.求解TSP的混合遗传算法[J].计算机工程与应用,2007,43(18):40-41. |
| |
| 作者姓名： | 莫海芳 康立山 |
| |
| 作者单位： | [1]武汉大学计算机学院,武汉430072 [2]中南民族大学计算与实验中心,武汉430074 |
| |
| 摘 要： | 介绍一种求解TSP的混合遗传算法,该算法结合了基于邻域的LK算法和采用Inver-Over算子的遗传算法,并在算法中增加一些控制策略,加快算法的收敛速度,又保证群体的多样性。实验表明该算法是有效的。
|
| 关 键 词： | TSP 遗传算法 Inver-Over算子 LK算法 最近邻域 |
| 文章编号： | 1002-8331（2007）18-0040-02 |
| 修稿时间： | 2007-03 |
Hybrid genetic algorithm for travelling salesman problem |
| |
| MO Hai-fang,KANG Li-shan.Hybrid genetic algorithm for travelling salesman problem[J].Computer Engineering and Applications,2007,43(18):40-41. |
| |
| Authors: | MO Hai-fang KANG Li-shan |
| |
| Affiliation: | 1.Department of Computer,Wuhan University,Wuhan 430072,China; 2.Computer and Experiment Center,South-Center University for Nationality,Wuhan 430074,China |
| |
| Abstract: | A hybrid genetic algorithm to solve TSP is presented. This algorithm combines GA with Inver-Over operator and LK algorithm based on nearest neighbor. Tow strategies are used to improve the efficiency of the algorithm and keep the diversity of the population. Numerical experiments show that the new algorithm is effective. |
| |
| Keywords: | TSP genetic algorithm Inver-Over operator LK algorithm nearest neighbor |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
| 点击此处可从《计算机工程与应用》浏览原始摘要信息 |
|
点击此处可从《计算机工程与应用》下载全文 |
