| 摘要: |
| 摘 要:在QoS网络结构下,提出一种启发式SP路由遗传算法;采用可变长度的染色体编码机制,并进
行优化选择、交叉、变异等操作;用C语言得出的仿真结果表明该算法比Munemoto算法和Inagaki算法收敛
速率快,可靠性高,而且可以搜索到全局最优解。 |
| 关键词: 关键词:启发式 sp路由 遗传算法 收敛 可变长度染色体编码 |
| DOI： |
| 分类号: |
| 基金项目: |
|
| Research on a genetic algorithm for heuristic shortest path routing |
|
JIANG Rong2rong
|
| 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. |
| Key words: Key words: heuristic method shortest path routing genetic algorithm convergence variable length Chrom2
some code |
