Abstract
The basic building block of a schedule-based transit assignment problem is to find an optimal path for a passenger, given an origin node, a destination node and departure or arrival preferences. The schedule-based shortest time-dependent transit shortest path does not minimize always the total time of a trip; rather, it uses weight factors and preferences regarding departure and arrivals to determine the best path which satisfies the trip specifications. The algorithm, which is based on a label-setting scheme (Dijkstra, 1959) tracks both times (to determine the feasibility of a path) and cost (to determine the attractiveness of a path). This paper describes the model and the algorithm for this schedule-based deterministic temporal shortest path model.
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
Cascetta, E., L. Biggiero, A. Nuzzolo and F. Russo (1996). A system of within-day dynamic demand and assignment models for scheduled intercity services. Proceedings of 24th European Transportation Forum Seminar D-E part 2, London.
INRO, Emme2 User’s Manual, Release 9. 4 (2003), 767 pp.
Nguyen, S., S. Pallottino and F. Malucelli (2001). A modeling framework for the passenger assignment on a transport network with time-tables. Transportation Science, 35, 238–249.
Nielsen, O.A. and G. Jovicic (1999). A large scale stochastic timetable-based transit assignment model for route and sub-mode choices. Proceedings of 27th European Transportation Forum, Seminar F, 169–184, Cambridge, England.
Nielsen, O.A., C.O. Hansen and A. Daly (2000). A large-scale model system for the Copenhagen-Ringsted railway project. Proceedings of 9th IATBR Conference Gold Coast, Australia.
Nuzzolo, A. and F. Russo (1994). An equilibrium assignment model for intercity transit networks, Proceedings of TRISTAN II Conference, Capri, Italy, 1994.
Nuzzolo, A. and F. Russo (1998b). Departure time and path choice models for intercity transit assignment. In: Travel Behaviour Research: updating the state of play ( J. Ortuzar, D. Hensher and S. Jara-Diaz, eds), pp. 385–399. Pergamon Elsevier Science Ltd, Amsterdam, The Netherlands.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer Science+Business Media New York
About this chapter
Cite this chapter
Florian, M. (2004). Finding Shortest Time-Dependent Paths in Schedule-Based Transit Networks: A Label Setting Algorithm. In: Wilson, N.H.M., Nuzzolo, A. (eds) Schedule-Based Dynamic Transit Modeling: theory and applications. Operations Research/Computer Science Interfaces Series, vol 28. Springer, Boston, MA. https://doi.org/10.1007/978-1-4757-6467-3_3
Download citation
DOI: https://doi.org/10.1007/978-1-4757-6467-3_3
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4419-5412-1
Online ISBN: 978-1-4757-6467-3
eBook Packages: Springer Book Archive