| 一种启发式SP路由遗传算法的研究 |
| |
| 引用本文： | 姜蓉蓉.一种启发式SP路由遗传算法的研究[J].重庆工商大学学报(自然科学版),2009,26(3):263-268. |
| |
| 作者姓名： | 姜蓉蓉 |
| |
| 作者单位： | 重庆工商大学,实验与实验设备管理处,重庆,400067 |
| |
| 摘 要： | 在QoS网络结构下,提出一种启发式SP路由遗传算法;采用可变长度的染色体编码机制,并进行优化选择、交叉、变异等操作;用C语言得出的仿真结果表明该算法比Munemoto算法和Inagaki算法收敛速率快,可靠性高,而且可以搜索到全局最优解.
|
| 关 键 词： | 启发式 sp路由 遗传算法 收敛 可变长度染色体编码 |
Research on a genetic algorithm for heuristic shortest path routing |
| |
| JIANG Rongrong.Research on a genetic algorithm for heuristic shortest path routing[J].Journal of Chongqing Technology and Business University:Natural Science Edition,2009,26(3):263-268. |
| |
| Authors: | JIANG Rongrong |
| |
| Abstract: | Abstract:W ith regard to QoS (Quality of Service) networks, we p ropose a genetic algorithm for heuristic SP
( shortest path) routing. We use modified variable string length , and op timize GA selection, GA crossover and GA
mutation. The results using C language emluator demonstrate that this algorithm can obtain a better convergence
rates and reliability thanMunemoto algorithm and Inagaki algorithm, also we can find Global op timal. |
| |
| Keywords: | Key words: heuristic method shortest path routing genetic algorithm convergence variable length Chrom2
some code |
| 本文献已被 维普 万方数据 等数据库收录！ |
| 点击此处可从《重庆工商大学学报(自然科学版)》浏览原始摘要信息 |
| 点击此处可从《重庆工商大学学报(自然科学版)》下载免费的PDF全文 |
