Abstract
Considering passengers’ travel psychoanalysis, the public traffic model of optimum route is proposed, which primary goal is minimal transfer times and the second goal is shortest travel time. On the integrated analysis of the space relationship between stations, the public traffic network’s searching model is proposed. Basing on the searching model, the minimal transfer times problem is solved by translating to the problem of the shortest route between two stations. The whole shortest route algorithm of the minimal transfer times is issued, which can efficiently solve the travel project of all the least minimal times between two stations. Finally, basing on the analysis of public traffic travel time chain, the time evaluating function is provided to calculate the public traffic travel time.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Anez, J., Barrat, T., Perez, B.: Dual graph representation of transport networks. Transportation Research Part B 30(3), 209–216 (1996)
ChoiI, K, Jan, G.W.: Development of a transit network from a street map database with spatial analysis and dynamic segmentation. Transportation Research Part C (8), 129–146 (2000)
Huang, Z.: A transit trip guidance system based on detailed data representation. Engineering Journal of Wuhan University 36(3), 69–75 (2003)
Zhang, G., Qian, D.: The Arithmetic for Solving Multiple Shortest Paths in Public Transportation Newwork. Systems Engineering-Theory and Practice 12(4), 22–26 (1992)
Koncz, N., Greenfeld, J., Mouskos, K.: A Strategy for Solving Static Multiple Optimal Path Transit Network Problems. Journal of Transportation Engineering 122(3), 218–225 (1996)
Yang, X., Wang, W., Ma, W.: GIS-Based Public Transit Passenger Route Choice Model. Journal of Southeast University(Natural Science Edition) 30(6), 87–91 (2000)
Heinz, S., Michael, F.: Optimal strategies: a new assignment model for transit networks. Transportation Research 23B(2), 83–102 (1989)
Mao, Y., Wu, D.: The Transfer Issue of Public Transportation in Dalian. Public Traffic (4), 15–16 (2003)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Hou, G., Zhou, K., Tian, Y. (2007). Algorithm for Public Transit Trip with Minimal Transfer Times and Shortest Travel Time. In: Zhang, Z., Siekmann, J. (eds) Knowledge Science, Engineering and Management. KSEM 2007. Lecture Notes in Computer Science(), vol 4798. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-76719-0_59
Download citation
DOI: https://doi.org/10.1007/978-3-540-76719-0_59
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-76718-3
Online ISBN: 978-3-540-76719-0
eBook Packages: Computer ScienceComputer Science (R0)