Optimizing itineraries in public transportation with walks between rides

Transportation Research Part B: Methodological

Volumn 55, Issue , 2013, Pages 212-226

  De Jonge, Bram ^a   Teunter, Ruud H ^a  

^a UNIVERSITY OF GRONINGEN   (Netherlands)

Author keywords

Earliest arrival problem; Public transportation; Walks between rides

Indexed keywords

BUS TRANSPORTATION; COMPUTATION THEORY; TRAVEL TIME;

DESTINATION LOCATION; EARLIEST ARRIVAL; PUBLIC TRANSPORT; PUBLIC TRANSPORTATION; SOLUTION ALGORITHMS; TAKE-ALL; WALKS BETWEEN RIDES;

MASS TRANSPORTATION;

ALGORITHM; BUS TRANSPORT; PUBLIC TRANSPORT; TRAVEL BEHAVIOR; TRAVEL TIME; WALKING;

EID: 84880844156     PISSN: 01912615     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.trb.2013.06.014     Document Type: Article

References (24)

1. Bartholdi J., Eisenstein D. A self-coördinating bus route to resist bus bunching. Transportation Research Part B 2012, 46(4):481-491.
2. Boussedjra, M., Bloch, C., El Moudni, A., 2004. An exact method to find the intermodal shortest path (ISP). In: Proceedings of the 2004 IEEE International Conference on Networking, Sensing and Control, Taipei, Taiwan, March 21-23, pp. 1075-1080.
3. Brodal G., Jacob R. Time-dependent networks as models to achieve fast exact time-table queries. Electronic Notes in Theoretical Computer Science 2004, 92(17):3-15.
4. Chang E., Floros E., Ziliaskopoulos A. An intermodal time-dependent minimum cost path algorithm with an application to hazmat routing. Operations Research/Computer Science Interfaces Series 2007, 38:113-132.
5. Daganzo C., Pilachowski J. Reducing bunching with bus-to-bus cooperation. Transportation Research Part B 2011, 45(1):267-277.
6. De Borger B., Fosgerau M. Information provision by regulated public transport companies. Transportation Research Part B 2012, 46(4):492-510.
7. Dijkstra E. A note on two problems in connexion with graphs. Numerische Mathematik 1959, 1(1):269-271.
8. Goczyla K., Cieltkowski J. Optimal routing in a transportation network. European Journal of Operational Research 1995, 87(2):214-222.
9. Hart P., Nilsson N., Raphael B. A formal basis for the heuristic determination of minimum cost paths. IEEE Transactions on Systems Science and Cybernetics 1968, 4(2):100-107.
10. Horn M. An extended model and procedural framework for planning multi-modal passenger journeys. Transportation Research Part B 2003, 37(7):641-660.
11. Lozano A., Storchi G. Shortest viable path algorithm in multimodal networks. Transportation Research Part A 2001, 35(3):225-241.
12. Modesti P., Sciomachen A. A utility measure for finding multiobjective shortest paths in urban multimodal transportation networks. European Journal of Operational Research 1998, 111(3):495-508.
13. Müller-Hannemann M., Schulz F., Wagner D., Zaroliagis C. Timetable information: models and algorithms, algorithmic methods for railway optimization. Lecture Notes in Computer Science 2007, 4359:67-90.
14. Nait-Sidi-Moh A., Manier M.-A., El Moudni A. Spectral analysis for performance evaluation in a bus network. European Journal of Operational Research 2009, 193(1):289-302.
15. Pyrga E., Schulz F., Wagner D., Zaroliagis C. Efficient models for timetable information in public transportation systems. Journal of Experimental Algorithmics 2008, 12(June):2.4:1-2.4:3.
16. Rehrl K., Bruntsch S., Mentz H. Assisting multimodal travelers: design and prototypical implementation of a personal travel companion. IEEE Transactions on Intelligent Transportation Systems 2007, 8(1):31-42.
17. Rodrigues M., Souza C.d., Moura A. Vehicle and crew scheduling for urban bus lines. European Journal of Operational Research 2006, 170(3):844-862.
18. Sherali H., Hobeika A., Kangwalklai S. Time-dependent, label-constrained shortest path problems with applicationssss. Transportation Science 2003, 37(3):278-293.
19. Wagner D., Willhalm T. Speed-up techniques for shortest-path computation, STACS 2007. Lecture Notes in Computer Science 2007, 4393:23-36.
20. Xuan Y., Argote J., Daganzo C. Dynamic bus holding strategies for schedule reliability: optimal linear control and performance analysis. Transportation Research Part B 2011, 45(10):1831-1845.
21. Zhao F., Zeng X. Optimization of transit route network, vehicle headways and timetables for large-scale transit networks. European Journal of Operational Research 2008, 186(2):841-855.
22. Ziliaskopoulos A., Wardell W. An intermodal optimum path algorithm for multimodal networks with dynamic arc travel times and switching delays. European Journal of Operational Research 2000, 125(3):486-502.
23. Zografos K., Androutsopoulos K. Algorithms for itinerary planning in multimodal transportation networks. IEEE Transactions on Intelligent Transportation Systems 2008, 9(1):175-184.
24. Zografos K., Spitadakis V., Androutsopoulos K. Integrated passenger information system for multimodal trip planning. Transportation Research Record: Journal of the Transportation Research Board 2008, 2072:20-29.