|
|||||
|
|
| 一种最短路由问题的遗传算法研究 | |
| 引用本文： | 张永军,高兰芳,顾畹仪. 一种最短路由问题的遗传算法研究[J]. 北京理工大学学报, 2007, 27(11): 1005-1008 |
| 作者姓名： | 张永军 高兰芳 顾畹仪 |
| 作者单位： | 北京邮电大学,光通信与光波技术教育部重点实验室,北京,100876;北京邮电大学,光通信与光波技术教育部重点实验室,北京,100876;北京邮电大学,光通信与光波技术教育部重点实验室,北京,100876 |
| 基金项目： | 国家高技术研究发展计划(863计划) , 教育部留学回国人员科研启动基金 |
| 摘 要： | 研究最短路由问题的遗传算法.采用可变长度染色体的编码方法,在固定网络和随机网络环境下,用C语言得出的仿真结果及与Dijkstra算法相比表明:大多解与Dijkstra算法的解相同,存在少数的不同解偏离不大;种群越大,路由的失败比率越小,收敛的速率越慢;当种群一定,增大网络规模时,解的质量下降,网络收敛速率急剧提高. |
| 关 键 词： | 最短路由 遗传算法 可变步长编码方法 种群 |
| 文章编号： | 1001-0645（2007）11-1005-04 |
| 修稿时间： | 2007-06-21 |
A Research of a Genetic Algorithm for Shortest Path Routing Problem |
|
| ZHANG Yong-jun,GAO Lan-fang and GU Wan-yi. A Research of a Genetic Algorithm for Shortest Path Routing Problem[J]. Journal of Beijing Institute of Technology(Natural Science Edition), 2007, 27(11): 1005-1008 | |
| Authors: | ZHANG Yong-jun GAO Lan-fang GU Wan-yi |
| Affiliation: | Key Laboratory of Optical Communication and Lightwave Technologies , Ministry of Education, Beijing University of Posts and Telecommunications, Beijing 100876, China |
| Abstract: | Variable-length chromosomes and their genes have been used for solving the shortest path routing problem of a genetic algorithm.Under random and fixed network,computer simulations with C and comparing with Dijkstra algorithm showed that most of the results are equal to the results of Dijkstra.Meanwhile,the results showed that the larger the population-sizing,the smaller the failure of ratio and the slower the rate of convergence.With population-sizing being fixed,the larger the population-sizing,the poorer the quality of results,and the higher rate of convergence. |
| Keywords: | shortest path routing genetic algorithm variable-length chromosonies populotion-sizing |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ | |
| 点击此处可从《北京理工大学学报》浏览原始摘要信息 | |
| 点击此处可从《北京理工大学学报》下载全文 | |