| 改进遗传算法求解TSP问题 |
| |
| 引用本文： | 朱亨荣,刘伟铭,宋丹.改进遗传算法求解TSP问题[J].湖南工业大学学报,2004,18(2). |
| |
| 作者姓名： | 朱亨荣 刘伟铭 宋丹 |
| |
| 作者单位： | 1. 长沙理工大学,湖南,长沙,410076;株洲工学院,湖南,株洲,412008
2. 长沙理工大学,湖南,长沙,410076 |
| |
| 摘 要： | 改进遗传算法采用了顶端增强算子进行选择运算以强化其收敛性,并利用动态进化因子来进行交叉算子和变异算子的选择以防止早熟.用不同的TsP问题测试时,在分析了种群规模、最大遗传代数与最优解之间的关系之后,得出该算法有较强的鲁棒性和有效性.
|
| 关 键 词： | 遗传算法 顶端增强算子 动态进化因子 |
An Improved Genetic Algorithm for Solving Traveling Salesman Problem |
| |
| ZHU Heng-rong.An Improved Genetic Algorithm for Solving Traveling Salesman Problem[J].Journal of Hnnnan University of Technology,2004,18(2). |
| |
| Authors: | ZHU Heng-rong |
| |
| Affiliation: | ZHU Heng-rong~ |
| |
| Abstract: | The improved genetic algorithm is aimed at traveling salesman problem, which adopts top proliferation operator to realize select operator for enhancing convergence and dynamic evolution gene to select crossing operator or mutation operators for avoiding its premature. It is shown that the algorithm is effective and robust in solving various traveling salesman problems. |
| |
| Keywords: | TSP |
| 本文献已被 CNKI 万方数据 等数据库收录！ |
|
