| 基于遗传算法的无向网络路径优化 |
| |
| 引用本文： | 吴静,王鹏涛. 基于遗传算法的无向网络路径优化[J]. 天津师范大学学报(自然科学版), 2007, 27(3): 72-75 |
| |
| 作者姓名： | 吴静 王鹏涛 |
| |
| 作者单位： | 天津理工大学,计算机科学与技术学院,天津,300191 |
| |
| 基金项目： | 天津市教委资助项目;天津市自然科学基金 |
| |
| 摘 要： | 为了解决无向网络的最短路径优化问题,采用遗传算法并使用可变长编码,在遗传算子操作中进行有效性判断,避免了传统交叉变异算子中无效路径的产生;网络数据存储采用链式存储结构,仅需存储各个节点信息,摒弃了传统的邻接矩阵方法.仿真试验表明,该算法可行性强,且可以找到最优路径.
|
| 关 键 词： | 无向网络 遗传算法 路径优化 |
| 文章编号： | 1671-1114（2007）03-0072-04 |
| 收稿时间： | 2006-12-28 |
| 修稿时间： | 2006-12-28 |
Path Optimization in Undirected Network Based on Genetic Algorithm |
| |
| WU Jing,WANG Peng-tao. Path Optimization in Undirected Network Based on Genetic Algorithm[J]. Journal of Tianjin Normal University(Natural Science Edition), 2007, 27(3): 72-75 |
| |
| Authors: | WU Jing WANG Peng-tao |
| |
| Affiliation: | School of Computer Science and Technology, Tianjin University of Technology, Tianjin 300191, China |
| |
| Abstract: | To solve the path optimization problem in undirected network,genetic algorithm is presented and variable-length chromosomes(routing strings)and their genes(nodes) are used for encoding the problem.The traditional adjacency matrix structure is abandoned,and the linked storage structure in which information of every node is only need to store is adopted.The simulation result indicates that the method can find the best route,and is highly feasible. |
| |
| Keywords: | undirected network genetic algorithm path optimization |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
|
