| 求解货郎担问题(TSP)的佳点集遗传算法 |
| |
| 引用本文： | 赵春英,张铃.求解货郎担问题(TSP)的佳点集遗传算法[J].计算机工程与应用,2001,37(3):83-84,117. |
| |
| 作者姓名： | 赵春英 张铃 |
| |
| 作者单位： | 安徽大学人工智能所 |
| |
| 摘 要： | 文章针对求解货郎担问题（ＴＳＰ），给出了一种佳点集遗传算法。通过对ＣＨＮ１４４实例的仿真求解，取得了令人满意的结果，可以看出该算法不仅提高了求解的效率和精度，还有效地避免了“早熟”现象。
|
| 关 键 词： | TSP问题 传统遗传算法 佳点集遗传算法 组合优化 |
A Good-point Set Genetic Algorithm for TSP |
| |
| Zhao Chunring,Zhang Ling.A Good-point Set Genetic Algorithm for TSP[J].Computer Engineering and Applications,2001,37(3):83-84,117. |
| |
| Authors: | Zhao Chunring Zhang Ling |
| |
| Abstract: | In this paper,a good-point set genetic algorithm is applied to the TSP problem. The satisfied emulation results of TSP problem instance which consists of 144 cities of China,are presented to show that the good-point set GA not only improves efficiency and accuracy,but also effectively avoids the prematurity. |
| |
| Keywords: | TSP problem traditional GA Good-point set GA combinatorial optimization |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
