Abstract
The public transit route choosing problem is the key technology of public transit passenger information system. Considering travel time variety caused by uncertainty traffic congestion condition, firstly this paper designs the least transfer times algorithm and the K shortest transit paths algorithm in the stochastic transit network. On the basis of travel psychology analysis, transfer times, travel time and cost of each transit path plan are taken into account. By changing link travel time reliability, the algorithms generate different K shortest transit path plans under different traffic conditions. Computational experiments demonstrate the efficiency of the model and algorithm in stochastic transit network.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Weiner, E.: Urban Transportation Planning in The United States. Praeger Publishers (1987)
Ma, L., Liu, X.B.: The Shortest Path of Public Transport Net and Related Optimal Taking Bus Problem. Mathematics in Practice and Theory 34, 38–43 (2004)
Li, Y.Z., Fang, Y.M.: Design and Realization of Urban Public Traffic Inquiry System. Surveying and Mapping of Geology and Mineral Resources 22, 3–5 (2006)
Fu, D.: Algorithm of least transfer in traffic system and its implementation. Journal of Huaqiao University 22, 346–350 (2001)
Bell, M.G.H., Iida, Y.: Transportation Network Analysis. John Willey & Sons, Chichester (1997)
Yang, X.M., Wang, W.: Gis-Based public transit passenger route choice model. Journal of Southeast University 6, 59–62 (2000)
Fox, B.L.: Calculating Kth shortest paths. Canadian Journal of Operational Research 11, 66–70 (1973)
Eppstein, D.: Finding the K Shortest Paths. SIAM Journal on Computing 28, 652–673 (1999)
He, S.X., Fan, B.Q.: Improved optimal path searching algorithm in transit network. Journal of Shanghai for Science and Technology 28, 63–66 (2006)
Zhao, L.Y., Du, W.: The Fuzzy Lattice Order Decision-making Method for Travel Mode Choice Based on the Travel Time Reliability. In: Proceedings of the Second International Conference on Intelligent Systems and Knowledge Engineering, Chengdu, pp. 695–700 (2007)
Abkowitzm, J., Tozzi, J., Driscoll, M.K.: Operational Feasibility of Timed Transfer in Transit Systems. Journal of Transportation Engineering 113, 168–177 (1987)
Peter, K., Theo, M.: Optimized Transfer Opportunities in Public Transport. Transportation Science 29, 101–105 (1995)
Lo, H.K., Yip, C.W., Wan, K.H.: Modeling Transfer and Non-linear Fare Structure in Multi-modal Network. Transportation Research Part B 37, 149–170 (2003)
Su, A.H., Shi, F.Z.: Optimal Route Choice of Public Traffic Network Based on Shortest Path Searching. Journal of Engineering Graphics 4, 54–58 (2005)
Lozano, A., Storchi, G.: Shortest Viable Path Algorithm in Multimodal Network. Transportation Reasearch Part A 35, 225–241 (2001)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Zhao, L., Xiong, Y., Sun, H. (2008). The K Shortest Transit Paths Choosing Algorithm in Stochastic Transit Network. In: Wang, G., Li, T., Grzymala-Busse, J.W., Miao, D., Skowron, A., Yao, Y. (eds) Rough Sets and Knowledge Technology. RSKT 2008. Lecture Notes in Computer Science(), vol 5009. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-79721-0_99
Download citation
DOI: https://doi.org/10.1007/978-3-540-79721-0_99
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-79720-3
Online ISBN: 978-3-540-79721-0
eBook Packages: Computer ScienceComputer Science (R0)