Hybrid Genetic Algorithm for Travel Time Connectivity Reliability of Optimal Path
This paper researches on the problem of searching for the reliable path for transportation networks. The reliable path finding problem is concerned with searching for the path with the maximum value of connectivity reliability. In view of the literature on travel time variations, the relationship between the mean travel time and its connectivity reliability is adopted in the proposed model. In order to simplify the difficulties of the solution, this paper takes the travel time and its connectivity reliability equal to a 0-1 knapsack problem, then defines a new conception of greedy transform which is given an efficient algorithm, after combining the new greedy transform method with Genetic Algorithm, obtains Hybrid Genetic Algorithm (HGA). This algorithm (HGA) can be considered as an efficient algorithm to solve the reliable path finding problem and some other knapsack problems. Numerical results are presented to demonstrate the applications of the proposed algorithm.
Dan MA
School of Science, China University of Mining and Technology, Xuzhou 221008, China
国际会议
2009 IEEE International Conference on Grey System and Intelligent Services(2009 IEEE灰色系统与服务科学国际会议)
南京
英文
1460-1464
2009-10-20（万方平台首次上网日期，不代表论文的发表时间）