摘要
为了解决无向网络的最短路径优化问题,采用遗传算法并使用可变长编码,在遗传算子操作中进行有效性判断,避免了传统交叉变异算子中无效路径的产生;网络数据存储采用链式存储结构,仅需存储各个节点信息,摒弃了传统的邻接矩阵方法.仿真试验表明,该算法可行性强,且可以找到最优路径.
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 mute, and is highly feasible.
出处
《天津师范大学学报（自然科学版）》
CAS
2007年第3期72-75,共4页
Journal of Tianjin Normal University：Natural Science Edition
基金
天津市教委自然科学基金资助项目(20030618)
天津市自然科学基金资助项目(043600511)
关键词
无向网络
遗传算法
路径优化
undirected network
genetic algorithm
path optimization
