Optimizing the Route Selection of Transit Based on Genetic Algorithm
The solution to the route selection problem of transit was converted to minimum spanning tree (MST) problem. Compared with the classic MST algorithm,an improved genetic algorithm is introduced to search the minimum spanning trees based on the graphic theory. This uses binary code to represent the problem of meamum spanning trees and uses the depth first search method to determine the connectivity of the graph. The corresponding fitness function,single parent transposition operator, single parent reverse operators and controlling evolutionary strategies are designed to improve its speed and efficiency. In comparison with traditional algorithms,it can acquire a set of minimum spanning trees during one genetic evolutionary process, make decision-department consider synthetically the various factors to do comprehensive evaluation and decision-making.
CHEN Weidong LI Yanyan DING Wei
School of Computer Science,Wuhan University of Technology,Wuhan,430070,China;School of Information S Department of Computer Science,Henan Administrative Institute of Politics and Law,Zhengzhou 450002,C School of Information Science and Engineering,Henan University of Technology,Zhengzhou 450001,China
国际会议
厦门
英文
964-968
2008-12-12（万方平台首次上网日期，不代表论文的发表时间）