| 旅行商问题的遗传算法 |
| |
| 引用本文： | 孟繁桢,胡云昌,徐慧,张新军,方小安.旅行商问题的遗传算法[J].系统工程理论与实践,1997,17(9):16-22. |
| |
| 作者姓名： | 孟繁桢 胡云昌 徐慧 张新军 方小安 |
| |
| 作者单位： | 天津大学 |
| |
| 摘 要： | 旅行商问题属于ＮＰ问题，现在还没有找到有效的解法。本文应用遗传算法对解决此类问题的有效性作了探讨。文中对遗传算子的应用，编码，参数选择及其对收敛的影响等问题作了分析与探讨。
|
| 关 键 词： | 遗传算法 遗传算子 旅行商问题 |
| 收稿时间： | 1996-04-11 |
Genetic Algorithm of Traveling Salesman Problem |
| |
| Meng Fanzhen,Hu Yunchang,Xu Hui,Zhang Xinjun,Fang Xiaoan.Genetic Algorithm of Traveling Salesman Problem[J].Systems Engineering —Theory & Practice,1997,17(9):16-22. |
| |
| Authors: | Meng Fanzhen Hu Yunchang Xu Hui Zhang Xinjun Fang Xiaoan |
| |
| Affiliation: | Tianjin University, 300072 |
| |
| Abstract: | Traveling salesman problem belongs to NP complete. Now it has not found the effective solution yet. In this paper, using genetic algorithm has been studied to solving the effectiveness of this kind of question,at same time, we analyzed and had a discussion on the application of the genetic algorithm, the coding,the choice of the parameter, the influence of the convergence,and so on. |
| |
| Keywords: | genetic algorithm genetic operator traveling salesman problem |
| 本文献已被 CNKI 等数据库收录！ |
| 点击此处可从《系统工程理论与实践》浏览原始摘要信息 |
|
点击此处可从《系统工程理论与实践》下载全文 |
|
