State-based accelerations and bidirectional search for bi-objective multi-modal shortest paths

Transportation Research Part C: Emerging Technologies

Volumn 27, Issue , 2013, Pages 233-259

  Artigues, Christian ^a,b   Huguet, Marie José ^a,b   Gueye, Fallou ^a,b,c   Schettini, Frédéric ^c   Dezou, Laurent ^c  

^a LAAS CNRS   (France)

^b UNIVERSITÉ DE TOULOUSE   (France)

^c MobiGIS ZAC Proxima   (France)

Author keywords

Bi objective regular language constrained shortest path problem; Bidirectional search; Finite state automaton; Label setting algorithms; Multi modal transportation; State based dominance rule; State based estimated travel times

Indexed keywords

FINITE AUTOMATA; FORMAL LANGUAGES; GRAPH ALGORITHMS; GRAPH STRUCTURES; MULTIMODAL TRANSPORTATION; PIPELINE PROCESSING SYSTEMS; ROBOTS; TRAVEL TIME; URBAN TRANSPORTATION;

BI-DIRECTIONAL SEARCH; CONSTRAINED SHORTEST PATH; DOMINANCE RULES; LABEL-SETTING ALGORITHM; MULTI-MODAL; STATE BASED;

GRAPH THEORY;

ACCELERATION; ALGORITHM; OPTIMIZATION; TOPOLOGY; TRANSPORTATION SYSTEM; TRAVEL TIME; URBAN TRANSPORT;

EID: 84873720647     PISSN: 0968090X     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.trc.2012.08.003     Document Type: Article

References (24)

1. Barett C., Jacob R., Marathe M. Formal-language-constrained path problems. SIAM Journal on Computing 2000, 30(3):809-837.
2. Barett, C., Bisset, K., Holzer, M., Konjevod, G., Marathe, M., Wagner, D., 2008. Engineering label-constrained shortest-path algorithms. In: 4th International Conference on Algorithmic Aspects in Information and Management, AAIM 2008, Shanghai, China, Lecture Notes in Computer Science, vol. 5034, pp. 27-37.
3. Bielli M., Boulmakoul A., Mouncif H. Object modeling and path computation for multi-modal travel systems. European Journal of Operational Research 2006, 175(3):1705-1730.
4. Chorus C.G., Molin E.J.E., Arentze T.A., Hoogendoorn S.P., Timmermans H.J.P., Wee B.V. Validation of a multi-modal travel simulator with travel information provision. Transportation Research Part C: Emerging Technologies 2007, 15(3):191-207.
5. Delling D., Wagner D. Time-dependent route planning. Robust and Online Large-Scale Optimization, Lecture Notes in Computer Science 2009, 5868:207-230.
6. Delling D., Sanders P., Schultes D., Wagner D. Engineering route planning algorithms. Algorithmics of Large and Complex Networks, Lecture Notes in Computer Science 2009, 5515:117-139.
7. Delling D., Pajor T., Wagner D. Accelerating multi-modal route planning by access nodes. Algorithms - ESA 2009, Lecture Notes in Computer Science 2009, 5757:587-598.
8. Ehrgott M. Multicriteria optimization 2005, Springer. second ed.
9. Gräbener T., Berro A., Duthen Y. Time dependent multi-objective best path for multi-modal urban routing. Electronic Notes in Discrete Mathematics 2010, 36:487-494.
10. Ilie, L., Navarro, G., Yu, S., 2004. On NFA reductions. In: Theory is Forever, Lecture Notes in Computer Science, vol. 3113, pp. 112-124.
11. Kirchler, D., Liberti, L., Pajor, T., Wolfler Calvo, R., 2011. UniALT for regular language constrained shortest paths on a multi-modal transportation network. 11th Workshop on Algorithmic Approaches for Transportation Modeling, Optimization, and Systems - ATMOS 2011, vol. 20, Saarbrücken, Germany, OASICS, pp. 64-75.
12. Lo H.K., Yip C.-W., Wan Q.K. Modeling competitive multi-modal transit services: a nested logit approach. Transportation Research Part C: Emerging Technologies 2004, 12(3-4):251-272.
13. Lozano A., Storchi G. Shortest viable path algorithm in multi-modal networks. Transportation Research Part A: Policy and Practice 2001, 35(3):225-241.
14. Lozano A., Storchi G. Shortest viable hyperpath in multi-modal networks. Transportation Research Part B 2002, 36:853-874.
15. Martins E.Q.V. On a multicriteria shortest path problem. European Journal of Operational Research 1984, 16:236-245.
16. Modesti P., Sciomachen A. A utility measure for finding multiobjective shortest paths in urban multi-modal transportation networks. European Journal of Operational Research 1998, 111(3):495-508.
17. Nannicini, G., Delling, D., Schultes, D., Liberti, L., 2008. Bidirectional A* search for time-dependent fast paths. In: 7th International Workshop on Experimental algorithms (WEA'08), Lecture Notes in Computer Science, vol. 5038, pp. 334-346.
18. Nguyen, S., Pallottino, S., 1989. Hyperpaths and shortest hyperpaths. In: Simeone, B. (Ed.) Combinatorial Optimization. Lecture Notes in Mathematics, vol. 1403, pp. 258-271.
19. Pajor, T., 2009. Multi-Modal Route Planning. Master Thesis, Universität Karlsruhe, Institut für Theoretische Informatik.
20. Pallottino S., Scutellà M.G. Shortest path algorithms in transportation models: Classical and innovative aspects. Equilibrium and Advanced Transportation Modelling 1998, 245-281. Kluwer Academic Publishers. P. Marcotte, S. Nguyen (Eds.).
21. Schnitger G. Regular expressions and NFAs without ε{lunate}-transitions. STACS 2006, Lecture Notes in Computer Science 2006, 2884:432-443.
22. Sherali H.D., Jeenanunta C. The approach dependent, time-dependent, label-constrained shortest path problem. Networks 2006, 48(2):57-67.
23. Sherali H.D., Hobeika A.G., Kangwalklai S. Time-dependent, label-constrained, shortest path problems with applications. Transportation Science 2003, 37(3):278-293.
24. Ziliaskopoulos A., Wardell W. An intermodal optimum path algorithm for multi-modal networks with dynamic arc travel times and switching delays. European Journal of Operational Research 2000, 125(3):486-502.