计算机工程与应用 ›› 2008, Vol. 44 ›› Issue (23): 22-23.DOI: 10.3778/j.issn.1002-8331.2008.23.007
• 博士论坛 • 上一篇 下一篇
康晓军,王茂才
收稿日期:
修回日期:
出版日期:
发布日期:
通讯作者:
KANG Xiao-jun,WANG Mao-cai
Received:
Revised:
Online:
Published:
Contact:
摘要： 详细分析了求解最短路径的遗传算法的构成要素，提出一种新的交叉变异算法，通过仿真实验论证了求解过程是合理而有效的，同时给出了算法的主要性能参数，并对其进行了分析。
关键词: 遗传算法, 最短路径算法, 参数选择
Abstract: This paper analyzes the factor of solve shortest path problem based on genetic algorithm，gives a new kind of crossing and mutation algorithm.The algorithm which has been used in simulative network，is proved to be reasonable and efficient.Furthermore the authors analyze the mainly performance parameter of genetic algorithm.
Key words: genetic algorithm, shortest path algorithm, parameter selection
康晓军,王茂才. 基于遗传算法的最短路径问题求解[J]. 计算机工程与应用, 2008, 44(23): 22-23.
KANG Xiao-jun,WANG Mao-cai. Shortest path algorithm implements based on genetic algorithm[J]. Computer Engineering and Applications, 2008, 44(23): 22-23.
0 / 推荐
导出引用管理器 EndNote|Ris|BibTeX
链接本文: http://cea.ceaj.org/CN/10.3778/j.issn.1002-8331.2008.23.007
http://cea.ceaj.org/CN/Y2008/V44/I23/22
