Efficient algorithms for the 2-Way Multi Modal Shortest Path Problem - Archive ouverte HAL Access content directly
Conference Papers Electronic Notes in Discrete Mathematics Year : 2013

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

Abstract

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.
Fichier principal
Vignette du fichier
Huguet-Kirchler-Parent-WolflerCalvo-INOC2013.pdf (141.46 Ko) Télécharger le fichier
Origin Files produced by the author(s)
Loading...

Dates and versions

hal-00957644 , version 1 (10-03-2014)

Identifiers

Cite

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⟩
392 View
591 Download

Altmetric

Share

Gmail Mastodon Facebook X LinkedIn More