Multimodal Route Planning With Public Transport and Carpooling

Increasing mobility demands raise the pressure on existing transport networks. As the most used mode of transport, private cars have a particularly strong environmental impact and produce congestion. Ridesharing or carpooling, where a driver and several riders form a carpool, can help to address these issues by increasing the number of persons per car. Therefore, recent years have seen a strong interest in carpooling. However, there exists no effective method of integrating carpooling into transport trip planners as of now, mainly due to the fuzzy and flexible nature (e.g., no fixed stops, possibility of making detours) of carpooling. This hinders the acceptance of carpooling by the general public. This paper proposes a new method to merge public transport and carpooling networks for multimodal route planning, considering the fuzziness and flexibility brought by carpooling. It is based on the concept of drive-time areas and points of action. The evaluation with real-world data sets shows that, compared with the state-of-the-art method, the proposed method merges static (i.e., public transport) and dynamic/fuzzy (i.e., carpooling) networks better, while retaining the desired flexibility offered by the latter, and thus creates a higher interconnectivity between the networks. Meanwhile, the merged network enables multimodal route planning, which can provide users with trips from an origin to a destination using different combinations of modes.

[1]  Peter Sanders,et al.  Exact Routing in Large Road Networks Using Contraction Hierarchies , 2012, Transp. Sci..

[2]  G. Sierpiński Changes of the modal split of traffic in Europe , 2013 .

[3]  Marie-José Huguet,et al.  Meeting points in ridesharing: A privacy-preserving approach , 2016, Transportation Research Part C: Emerging Technologies.

[4]  Sabine Storandt,et al.  Flow-Based Guidebook Routing , 2014, ALENEX.

[5]  Marie-José Huguet,et al.  Carpooling: the 2 Synchronization Points Shortest Paths Problem , 2013, ATMOS.

[6]  Janusz Ciela̧tkowski,et al.  Optimal routing in a transportation network , 1995 .

[7]  D. Wagner,et al.  Timetable Information Updating in Case of Delays : Modeling Issues ⋆ , 2008 .

[8]  Christos D. Zaroliagis,et al.  Efficient models for timetable information in public transportation systems , 2008, JEAL.

[9]  Kamel Aissat,et al.  Carpooling as Complement to Multi-modal Transportation , 2015, ICEIS.

[10]  Gerth Stølting Brodal,et al.  Time-dependent Networks as Models to Achieve Fast Exact Time-table Queries , 2004, ATMOS.

[11]  Dorothea Wagner,et al.  User-Constrained Multimodal Route Planning , 2015, ACM J. Exp. Algorithmics.

[12]  Monika Sester,et al.  Location- and time-dependent meeting point recommendations for shared interurban rides , 2017, J. Locat. Based Serv..

[13]  Edsger W. Dijkstra,et al.  A note on two problems in connexion with graphs , 1959, Numerische Mathematik.

[14]  Manuel Braun Multi-Modal Route Planning with Transfer Patterns , 2012 .

[15]  Nils J. Nilsson,et al.  A Formal Basis for the Heuristic Determination of Minimum Cost Paths , 1968, IEEE Trans. Syst. Sci. Cybern..

[16]  Andrew V. Goldberg,et al.  Route Planning in Transportation Networks , 2015, Algorithm Engineering.

[17]  Nicholas Evangelopoulos,et al.  Why Do People Rideshare? An Experimental Study , 2018 .

[18]  Andrew V. Goldberg,et al.  Computing the shortest path: A search meets graph theory , 2005, SODA '05.

[19]  Giuseppe F. Italiano,et al.  Is Timetabling Routing Always Reliable for Public Transport? , 2013, ATMOS.

[20]  Christos D. Zaroliagis,et al.  Timetable Information: Models and Algorithms , 2004, ATMOS.

[21]  Martin Raubal,et al.  A Heuristic for Multi-modal Route Planning , 2016, LBS.

[22]  Fernando Ordóñez,et al.  Ridesharing: The state-of-the-art and future directions , 2013 .

[23]  Rolf H. Möhring,et al.  Fast Point-to-Point Shortest Path Computations with Arc-Flags , 2006, The Shortest Path Problem.