| 基于基因片段插入的旅行商问题的演化算法研究 |
| |
| 引用本文： | 刘欣欣,陈宝兴.基于基因片段插入的旅行商问题的演化算法研究[J].漳州师院学报,2014(3):34-36. |
| |
| 作者姓名： | 刘欣欣 陈宝兴 |
| |
| 作者单位： | f闽南师范大学计算机学院,福建漳州363000 |
| |
| 基金项目： | 福建省自然科学基金项目资助（2013J01028,2010J01354） |
| |
| 摘 要： | 旅行商问题是组合优化中一个广泛研究的NP-hard问题.本文引入了一种新的运算方式：基因片段插入,并利用此运算给出了一种求解旅行商问题的演化算法.实验结果表明,此算法能以较高的概率找到旅行商问题的近似最优解.
|
| 关 键 词： | 旅行商问题 基因片段 近似最优解 |
An Evolution Algorithm of Using Gene Fragment Inserting for Travel Salesman Problem |
| |
| LIU Xin-xin,CHEN Bao-xing.An Evolution Algorithm of Using Gene Fragment Inserting for Travel Salesman Problem[J].Journal of ZhangZhou Teachers College(Philosophy & Social Sciences),2014(3):34-36. |
| |
| Authors: | LIU Xin-xin CHEN Bao-xing |
| |
| Institution: | (School of Computer Science, Minnan Normal University, Zhangzhou, Fujian 363000, China) |
| |
| Abstract: | The traveling salesman problem （TSP） is a NP-hard problem which widely studied in combinatorial optimization domain. A new operator, named gene fragment inserting, is proposed in this paper. By using this operator, an evolution algorithm for solving travel salesman problem is presented. Experiment results show that the proposed algorithm can find an approximate optimal solution for TSP with a high probability. |
| |
| Keywords: | travel salesman problem gene fragment approximate optimal solution |
| 本文献已被 维普 等数据库收录！ |
