| TSP问题的顺序插入交叉算子 |
| |
| 引用本文： | 孙海雷,刘琼荪,胡上尉.TSP问题的顺序插入交叉算子[J].计算机工程与应用,2007,43(8):65-66,98. |
| |
| 作者姓名： | 孙海雷 刘琼荪 胡上尉 |
| |
| 作者单位： | 重庆大学数理学院 重庆400044 |
| |
| 摘 要： | 针对TSP问题的特点,在遗传算法的交叉运算过程中设计了三角距离差函数作为评价标准,运用贪婪策略思想,提出了一种新的交叉算子:顺序插入交叉(OrderInsertCrossover,简称OIC)算子,该算子有效地利用了局部信息,并且能很好地继承父代优秀的基因,实例仿真验证了该算子的有效性。
|
| 关 键 词： | TSP问题 遗传算法 顺序插入交叉算子 |
| 文章编号： | 1002-8331（2007）08-0065-02 |
| 修稿时间： | 2006-08 |
Order insert crossover operator for TSP |
| |
| SUN Hai-lei,LIU Qiong-sun,HU Shang-wei.Order insert crossover operator for TSP[J].Computer Engineering and Applications,2007,43(8):65-66,98. |
| |
| Authors: | SUN Hai-lei LIU Qiong-sun HU Shang-wei |
| |
| Affiliation: | College of Mathematics and Sciences,Chongqing University,Chongqing 400044,China |
| |
| Abstract: | According to the TSP character,a new crossover operator,order insert crossover operator is designed,which introduces triangle distance difference function as a criterion and uses the greedy selection strategy in the cross of the genetic algorithm.This operator is conducted using the local information effectively and inheriting excellent gene from the parents.It has been proved effective through the optimization computing of some example. |
| |
| Keywords: | Traveling Salesman Problem Genetic Algorithm(GA) order insert crossover operator |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
|
