| 交通选线优化算法的设计与实现 |
| |
| 引用本文： | 张强,李晓莉.交通选线优化算法的设计与实现[J].计算机工程与应用,2009,45(8):226-228. |
| |
| 作者姓名： | 张强 李晓莉 |
| |
| 作者单位： | 1. 武汉理工大学,武汉,430074;河南工业大学信息科学与工程学院,郑州,450001
2. 河南工业大学信息科学与工程学院,郑州,450001 |
| |
| 摘 要： | 将交通选线问题求解转化为最小生成树（Minimun Spanning Tree，MST）的求解，对比了经典MST求解算法，以图论为基础，采取一种求最小生成树的改进遗传算法．该算法以二进制编码表示最小树问题，用深度优先搜索算法进行图的连通性判断，并采用相应的适应度函数、单亲换位算子和单亲逆转算子及多种控制进化策略，能在一次遗传进化过程中获得一批最小生成树，可供决策部门综合评价与决策．
|
| 关 键 词： | 交通选线 最小生成树 遗传算法 优化 |
| 收稿时间： | 2008-4-8 |
| 修稿时间： | 2009-1-8
|
Design and implementation of optimization algorithm for traffic line selection based on genetic algorithm |
| |
| ZHANG Qiang,LI Xiao-li.Design and implementation of optimization algorithm for traffic line selection based on genetic algorithm[J].Computer Engineering and Applications,2009,45(8):226-228. |
| |
| Authors: | ZHANG Qiang LI Xiao-li |
| |
| Affiliation: | ZHANG Qiang,LI Xiao-li 1.Wuhan University of Technology,Wuhan 430074,China 2.College of Information Science , Engineering,Henan University of Technology,Zhengzhou 450001,China |
| |
| Abstract: | The solution to traffic line selection problem was converted to minimum spanning tree(MST)problem.Based on the graphic theory,an improved genetic algorithm is introduced to search the minimum spanning trees.This algorithm uses binary code to represent the problem of minimum spanning trees and uses the depth first searching method to determine the connectivity of the graph.The corresponding fitness function,single parent transposition operator,single parent reverse operators and controlling evolutionary stra... |
| |
| Keywords: | traffic line selection Minimum Spanning Tree（MST） genetic algorithms optimization |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
| 点击此处可从《计算机工程与应用》浏览原始摘要信息 |
|
点击此处可从《计算机工程与应用》下载全文 |
|
