| 一种启发式遗传算法及其在最短路径求取中的应用 |
| |
| 引用本文： | 杨云,孙向军,曹立鑫,刘凤玉.一种启发式遗传算法及其在最短路径求取中的应用[J].计算机工程与应用,2003,39(1):12-14,38. |
| |
| 作者姓名： | 杨云 孙向军 曹立鑫 刘凤玉 |
| |
| 作者单位： | 南京理工大学计算机系,南京,210094 |
| |
| 基金项目： | 国家自然科学基金(编号:69973020)，国家863高技术发展研究计划项目(编号:2001AA113161)，部委应用基础基金 |
| |
| 摘 要： | 对经典的遗传算子(选择算子、交叉算子和变异算子)进行重新设计,提出了一种启发式遗传算法。它能够根据种群的进化情况,动态地调整遗传算子,维持种群的多样性,克服过早收敛并加快了搜索速度,得到高品质解。将算法用于最短路径求取中,仿真结果证实是合理而有效的。
|
| 关 键 词： | 遗传算法 遗传算子 最短路径算法 |
| 文章编号： | 1002-8331-(2003)01-0012-03 |
An Algorithm Based on Illumination and It's Application in Shortest Path Algorithm |
| |
| Yang Yun Sun Xiangjun Cao Lixin Liu Fengyu.An Algorithm Based on Illumination and It''''s Application in Shortest Path Algorithm[J].Computer Engineering and Applications,2003,39(1):12-14,38. |
| |
| Authors: | Yang Yun Sun Xiangjun Cao Lixin Liu Fengyu |
| |
| Abstract: | Illumination-based algorithm is proposed by redesigning genetic operators(including selection operator,cross operator and variation operator)on genetic algorithm.It gets perfect quality answer by maintaining diversity of group,overcoming early constringency and fasting searching speed after dynamically regulating genetic operator according to evolve situation of groups.The algorithm which has been used in simulative traffic network,is proved to be reasonable and efficient. |
| |
| Keywords: | genetic algorithm genetic operator shortest path algorithm |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
|
