计算机工程与应用 ›› 2007, Vol. 43 ›› Issue (18): 40-41.
• 学术探讨 • 上一篇 下一篇
莫海芳1,2,康立山1
收稿日期:
修回日期:
出版日期:
发布日期:
通讯作者:
MO Hai-fang1,2,KANG Li-shan1
Received:
Revised:
Online:
Published:
Contact:
摘要： 介绍一种求解TSP的混合遗传算法,该算法结合了基于邻域的LK算法和采用Inver-Over算子的遗传算法,并在算法中增加一些控制策略,加快算法的收敛速度,又保证群体的多样性。实验表明该算法是有效的。
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.
莫海芳1,2,康立山1 . 求解TSP的混合遗传算法[J]. 计算机工程与应用, 2007, 43(18): 40-41.
MO Hai-fang1,2,KANG Li-shan1. Hybrid genetic algorithm for travelling salesman problem[J]. Computer Engineering and Applications, 2007, 43(18): 40-41.
0 / 推荐
导出引用管理器 EndNote|Ris|BibTeX
链接本文: http://cea.ceaj.org/CN/
http://cea.ceaj.org/CN/Y2007/V43/I18/40
