| 求解k条最优路径问题的遗传算法 |
| |
| 引用本文： | 马炫.求解k条最优路径问题的遗传算法[J].计算机工程与应用,2006,42(12):100-101,113. |
| |
| 作者姓名： | 马炫 |
| |
| 作者单位： | 西安理工大学自动化与信息工程学院,西安,710048 |
| |
| 摘 要： | 文章提出的任意两点间k条最优路径问题的遗传算法,采用节点的自然路径作为染色体编码,根据路径节点的连接实施染色体的交叉操作,将节点路径块作为染色体的变异基因块实施变异操作。算法结构简明,收敛速度快,可应用于求解大规模网络中的多条最优路径问题。
|
| 关 键 词： | 遗传算法 最短路径 k条最优路径 基因块变异 |
| 文章编号： | 1002-8331-（2006）12-0100-02 |
| 收稿时间： | 2005-07 |
| 修稿时间： | 2005-07 |
A Genetic Algorithm for k Optimal Paths Problem |
| |
| Ma Xuan.A Genetic Algorithm for k Optimal Paths Problem[J].Computer Engineering and Applications,2006,42(12):100-101,113. |
| |
| Authors: | Ma Xuan |
| |
| Abstract: | A genetic algorithm to search k optimal paths between arbitrary two modes in a graph is presented.The chromosome coding employs natural path representation by connecting nodes.Corresponding crossover method of exchanging part genes of two chromosomes by connectible node,and mutation method of generating a path block between two genes in a chromosome as mutation block gene are designed.Simulation results show the validity of the algorithm.The proposed algorithm can be applied to large-scale network to solve multiple optimal paths. |
| |
| Keywords: | genetic algorithm shortest path multiple optimal paths block mutation |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
