Minimum path algorithms for a schedule-based transit network with a general fare structure

Operations Research/ Computer Science Interfaces Series

Volumn 28, Issue , 2004, Pages 241-251

  Tong, C O ^a   Wong, S C ^a  

^a UNIVERSITY OF HONG KONG   (Hong Kong)

Author keywords

Minimum path algorithm; Schedule based transit network

Indexed keywords

EID: 84888790419     PISSN: 1387666X     EISSN: None     Source Type: Book Series    
DOI: 10.1007/978-1-4757-6467-3     Document Type: Article

References (8)

1. Bellman R. E., (1958). On a routing problem. Journal of Quarterly Applied Mathematics 16,87-90.
2. Carraresi P., Malucelli F. and PaJlottino S. (1996) Regional mass transit assignment with resource constraints. Transportation Research, 30B, 81-98.
3. Dijkstra E.W. (1959). A note on two problems in connection with graphs. Numerische Mathematik 1,269-271.
4. Nguyen S., PaJlottino S. and MaluceJli F. (2001). A modeling framework for passenger assignment on a transport network with timetables. Transportation Science 35(3): 238-249.
5. Nuzzolo A., Russo F. and CrisaJli U. (2001). A doubly dynamic schedule-based assignment model for transit networks. Transportation Science 35(3): 268-285.
6. Tong C.O. (1986) A schedule-based transit network model. Ph.D. Thesis, Monash University, Australia.
7. Tong C.O. and Richardson A. I. (1984) A computer model for finding the timedependent minimum path in a transit system with fixed schedules. Journal of Advanced Transportation, 18, 145-161.
8. Tong c.o. and Wong s.c. (1999) A stochastic transit assignment model using a dynamic schedule-based network. Transportation Research, 33B, 107-121.