Efficient algorithms for the 2-Way Multi Modal Shortest Path Problem

Marie-José Huguet (1) , Dominik Kirchler (2, 3) , Pierre Parent (3) , Roberto Wolfler Calvo (3)

1 LAAS-ROC - Équipe Recherche Opérationnelle, Optimisation Combinatoire et Contraintes
2 LIX - Laboratoire d'informatique de l'École polytechnique [Palaiseau]
3 LIPN - Laboratoire d'Informatique de Paris-Nord

We consider the 2-Way Multi Modal Shortest Path Problem (2WMMSPP). Its goal is tofi nd two multi modal paths with total minimal cost, an outgoing path and a return path. The main di fficulty lies in the fact that if a private car or bicycle is used during the outgoing path, it has to be picked up during the return path. The shortest return path is typically not equal to the shortest outgoing path as tra ffic conditions and timetables of public transportation vary throughout the day. In this paper we propose an e fficient algorithm based on bi-directional search and provide experimental results on a realistic multi modal transportation network.

Mots clés: 2-Way Shortest Path; time-dependency; multi modal transportation network; label constrained shortest path

Domaines: Recherche opérationnelle [math.OC]; Algorithme et structure de données [cs.DS]

Marie-José Huguet, Dominik Kirchler, Pierre Parent, Roberto Wolfler Calvo. Efficient algorithms for the 2-Way Multi Modal Shortest Path Problem. International Network Optimization Conference (INOC), May 2013, Tenerife, Spain. pp.431 -- 437, ⟨10.1016/j.endm.2013.05.122⟩. ⟨hal-00957644⟩