Heuristic Algorithm for Searching Public Transit Paths Based on Reliability Analysis
CHEN Yan-yan1, WANG Dong-zhu2
1. Key Laboratory of Transportation Engineering, Beijing University of Technology, Beijing 100022, China; 2. National Intelligent Transport Systems Center of Engineering and Technology, Beijing 100088, China
CHEN Yan-yan, WANG Dong-zhu. Heuristic Algorithm for Searching Public Transit Paths Based on Reliability Analysis[J]. Journal of Transportation Systems Engineering and Information Technology, 2009, 9(3): 98-102 .
[1]戴帅,陈艳艳,公共交通系统的可靠度研究[J],北京工业大学学报,2006(9):21-25. [DAI Shuai, CHEN Yan-yan, Study on system reliability of public transportation[J], Journal of Beijing University of technology, 2006(9),21-25] [2] Dijkstra, E.W. A note on two problems in connexion with graphs [J], Numerische Mathematik, 1, 1959, pp. 269-271. [3] Hart E P, Nilsson N J, Raphael B. A formal basis for the heuristic determination of minimum cost paths [J], IEEE Trans. Syst. Sci. Cybern. 1968, SSC-4(2):100–107. [4]CHEN Yan-yan, BELL Michael G H, WANG Dong-zhu, Risk-averse time-dependent route guidance by constrained dynamic A* search in decentralized system architecture [J], Journal of Transport Research Record, 2006,1944(1):25–29.