Routing in Multimodal Transportation Networks with Non-scheduled Lines
Article No.: 2.3, Pages 1 - 16
Abstract
Over the last decades, new mobility offers have emerged to enlarge the coverage and the accessibility of public transportation systems. In many areas, public transit now incorporates on-demand transport lines, that can be activated at user need. In this paper, we propose to integrate lines without predefined schedules but with predefined stop sequences into a state-of-the-art trip planning algorithm for public transit, the Trip-Based Public Transit Routing algorithm [33]. We extend this algorithm to non-scheduled lines and explain how to model other modes of transportation, such as bike sharing, with this approach. The resulting algorithm is exact and optimizes two criteria: the earliest arrival time and the minimal number of transfers. Experiments on two large datasets show the interest of the proposed method over a baseline modelling.
References
[1]
Transports Montalbanais. (n.d.). https://www.montm.com/transport-a-la-demande-et-pmr/Access date: 2021/03/29.
[2]
Chris Barrett, Riko Jacob, and Madhav Marathe. 2000. Formal-language-constrained path problems. SIAM J. Comput. 30, 3 (May2000), 809–837. DOI:
[3]
Hannah Bast. 2009. Car or public transport—two worlds. In Efficient Algorithms: Essays Dedicated to Kurt Mehlhorn on the Occasion of His 60th Birthday, Susanne Albers, Helmut Alt, and Stefan Näher (Eds.). Springer Berlin, Berlin, 355–367. DOI:
[4]
Hannah Bast, Erik Carlsson, Arno Eigenwillig, Robert Geisberger, Chris Harrelson, Veselin Raychev, and Fabien Viger. 2010. Fast routing in very large public transportation networks using transfer patterns. In Proceedings of the 18th Annual European Conference on Algorithms: Part I (ESA’10). Springer-Verlag, Berlin, 290–301.
[5]
Hannah Bast, Daniel Delling, Andrew Goldberg, Matthias Müller-Hannemann, Thomas Pajor, Peter Sanders, Dorothea Wagner, and Renato F. Werneck. 2016. Route planning in transportation networks. In Kliemann L., Sanders P. (eds) Algorithm Engineering - Selected Results and Surveys. Lecture Notes in Computer Science, Vol. 9220. Springer, Cham, 19–80. DOI:
[6]
Hannah Bast, Matthias Hertel, and Sabine Storandt. 2016. Scalable transfer patterns. In 2016 Proceedings of the Eighteenth Workshop on Algorithm Engineering and Experiments (ALENEX). 15–29. DOI:
[7]
Moritz Baum, Valentin Buchhold, Jonas Sauer, Dorothea Wagner, and Tobias Zündorf. 2019. UnLimited TRAnsfers for multi-modal route planning: An efficient solution. In 27th Annual European Symposium on Algorithms (ESA 2019) (Leibniz International Proceedings in Informatics (LIPIcs)), Michael A. Bender, Ola Svensson, and Grzegorz Herman (Eds.), Vol. 144. Schloss Dagstuhl–Leibniz-Zentrum fuer Informatik, Dagstuhl, Germany, 14:1–14:16. DOI:
[8]
Alessio Cionini, Gianlorenzo D’Angelo, Mattia D’Emidio, Daniele Frigioni, Kalliopi Giannakopoulou, Andreas Paraskevopoulos, and Christos Zaroliagis. 2017. Engineering graph-based models for dynamic timetable information systems. Journal of Discrete Algorithms 46-47 (2017), 40–58. DOI:
[9]
datahub. Timetables for transit in Netherlands. (n.d.). https://old.datahub.io/dataset/gtfs-nlAccess date: 2019/07/29.
[10]
Île de France Mobilités. Open Data portal. (n.d.). https://data.iledefrance-mobilites.fr/pages/home/Access date: 2020/05/04.
[11]
Daniel Delling, Julian Dibbelt, and Thomas Pajor. 2019. Fast and exact public transit routing with restricted Pareto sets. In Proceedings of the Twenty-First Workshop on Algorithm Engineering and Experiments (ALENEX). Editor(s): Stephen Kobourov and Henning Meyerhenke, San Diego, California, USA, 54–65. DOI:
[12]
Daniel Delling, Julian Dibbelt, Thomas Pajor, Dorothea Wagner, and Renato F. Werneck. 2013. Computing multimodal journeys in practice. In Experimental Algorithms - Proceedings of the 12th International Symposium, SEA 2013 (Lecture Notes in Computer Science), Vol. 7933. Springer Berlin, 260–271. DOI:
[13]
Daniel Delling, Julian Dibbelt, Thomas Pajor, and Renato F. Werneck. 2015. Public transit labeling. In Experimental Algorithms - Proceedings of the 14th International Symposium (SEA 2015) (Lecture Notes in Computer Science), Evripidis Bampis (Ed.), Vol. 9125. Springer International Publishing, 273–285. DOI:
[14]
Daniel Delling, Thomas Pajor, and Renato F. Werneck. 2012. Round-based public transit routing. In Proceedings of the 14th Meeting on Algorithm Engineering and Experiments (ALENEX’12), Society for Industrial and Applied Mathematics (Eds.). 130–140. DOI:
[15]
Syndicat Mixte des Mobilités de l’Aire Grenobloise. Horaires théoriques du réseau TAG. (n.d.). https://transport.data.gouv.fr/datasets/horaires-theoriques-du-reseau-tag/Access date: 2020/05/04.
[16]
Julian Dibbelt, Thomas Pajor, Ben Strasser, and Dorothea Wagner. 2013. Intriguingly simple and fast transit routing. In Experimental Algorithms. International Symposium on Experimental Algorithms, SEA 2013 (Lecture Notes in Computer Science), Vincenzo Bonifaci, Camil Demetrescu, and Alberto Marchetti-Spaccamela (Eds.), Vol. 7933. Springer Berlin, Berlin, 43–54. DOI:
[17]
Julian Dibbelt, Thomas Pajor, and Dorothea Wagner. 2012. User-constrained multi-modal route planning. In Proceedings of the 14th Workshop on Algorithm Engineering and Experiments (ALENEX’12). SIAM, 118–129. DOI:Editors David A. Bader and Petra Mutzel.
[18]
Agglo du Pays de Dreux. Linéad. (n.d.). https://www.linead.fr/8-Transport-a-la-demande.htmlAccess date: 2021/03/29.
[19]
Robert Geisberger, Peter Sanders, Dominik Schultes, and Daniel Delling. 2008. Contraction hierarchies: Faster and simpler hierarchical routing in road networks. In Experimental Algorithms. 7th Workshop on Experimental Algorithms (WEA 2008) (Lecture Notes in Computer Science), C.C. McGeoch (Ed.), Vol. 5038. Springer, Berlin, 319–333. DOI:
[20]
Kalliopi Giannakopoulou, Andreas Paraskevopoulos, and Christos Zaroliagis. 2019. Multimodal dynamic journey-planning. Algorithms 12, 10 (2019). DOI:
[21]
Andrew Goldberg and Chris Harrelson. 2005. Computing the shortest path: A* search meets graph theory. In Proceedings of the 16th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA’05). SIAM, 156–165.
[22]
GTFS. General Transit Feed Specification. (n.d.). https://gtfs.org/Access date: 2021/03/29.
[23]
Pierre Hansen. 1980. Bicriterion path problems. In Multiple Criteria Decision Making Theory and Application (Lecture Notes in Economics and Mathematical Systems), Günter Fandel and Tomas Gal (Eds.), Vol. 177. Springer Berlin, 109–127. DOI:
[24]
Dominik Kirchler, Leo Liberti, and Roberto Wolfler Calvo. 2015. Efficient computation of shortest paths in time-dependent multi-modal networks. ACM Journal of Experimental Algorithmics (JEA) 19 (Jan.2015). DOI:
[25]
Vassilissa Lehoux and Darko Drakulic. 2019. Mode personalization in trip-based transit routing. In 19th Symposium on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (ATMOS 2019) (OpenAccess Series in Informatics (OASIcs)), Valentina Cacchiani and Alberto Marchetti-Spaccamela (Eds.), Vol. 75. Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik, Dagstuhl, Germany, 13:1–13:15. DOI:
[26]
Ross MacDonald. 2020. Mobility on Demand (MOD) Sandbox: Vermont Agency of Transportation (VTrans) Flexible Trip Planner. Technical Report 0150. Federal Transit Administration (FTA) Research.
[27]
Transports publics de Flers Agglo. Némus. (n.d.). https://nemus.flers-agglo.fr/se-deplacer/transport-a-la-demandeAccess date: 2021/03/29.
[28]
Evangelia Pyrga, Frank Schulz, Dorothea Wagner, and Christos Zaroliagis. 2008. Efficient models for timetable information in public transportation systems. ACM Journal of Experimental Algorithmics (JEA) 12, 2.4 (2008), 1–39. DOI:
[29]
Andrea Raith, Marie Schmidt, Anita Schöbel, and Lisa Thom. 2018. Extensions of labeling algorithms for multi-objective uncertain shortest path problems. Networks 72, 1 (2018), 84–127. DOI:_eprint:
[30]
Jonas Sauer, Dorothea Wagner, and Tobias Zündorf. 2020. Faster multi-modal route planning with bike sharing using ULTRA. In 18th International Symposium on Experimental Algorithms (SEA 2020) (Leibniz International Proceedings in Informatics (LIPIcs)), Simone Faro and Domenico Cantone (Eds.), Vol. 160. Schloss Dagstuhl–Leibniz-Zentrum für Informatik, Dagstuhl, Germany, 16:1–16:14. DOI:
[31]
Luis Ulloa, Vassilissa Lehoux, and Frédéric Roulland. 2018. Trip planning within a multimodal urban mobility. IET Intelligent Transport Systems 12, 2 (2018), 87–92. DOI:
[32]
GTFS-Flex v2. Flexible public transit services in GTFS. (n.d.). https://github.com/MobilityData/gtfs-flex/blob/master/spec/reference.md
[33]
Sascha Witt. 2015. Trip-based public transit routing. In Algorithms - Proceedings of the 23rd Annual European Symposium on Algorithms (ESA’15) (Lecture Notes in Computer Science), Nikhil Bansal and Irene Finocchi (Eds.), Vol. 9294. Springer Berlin, Berlin, 1025–1036. DOI:Editors: Nikhil Bansal and Irene Finocchi.
[34]
Sascha Witt. 2016. Trip-based public transit routing using condensed search trees. In Proceedings of the 16th Workshop on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (ATMOS 2016) (OpenAccess Series in Informatics (OASIcs)), Marc Goerigk and Renato Werneck (Eds.), Vol. 54. Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik, Dagstuhl, Germany, 10:1–12. DOI:Editors: Marc Goerigk and Renato Werneck.
Index Terms
- Routing in Multimodal Transportation Networks with Non-scheduled Lines
Recommendations
On a Rail Transportation Model with Scheduled Services
<P>A safety precaution used in rail transportation is to ensure that only one train occupies the track connecting two stations at any time. We consider a train station where passengers arrive according to a prescheduled timetable, and the transportation ...
Demand responsive public transportation using wireless technologies
ACWR '11: Proceedings of the 1st International Conference on Wireless Technologies for Humanitarian ReliefAir pollution has been the bane of society for which we still have not got a satisfying solution. The air pollution due to automobiles constitutes around 60--90% of the total air pollution in the urban area. To curtail this, the mass transportation, bus ...
Best routes selection in multimodal networks using multi-objective genetic algorithm
In this study, we propose a bi-level multi-objective Taguchi genetic algorithm for a multimodal routing problem with time windows. The mathematic model is constructed, which is featured by two optimal objectives, multiple available transportation ...
Comments
Information & Contributors
Information
Published In
Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than the author(s) must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected].
Publisher
Association for Computing Machinery
New York, NY, United States
Publication History
Published: 21 December 2023
Online AM: 24 November 2023
Accepted: 06 November 2023
Revised: 06 November 2023
Received: 30 November 2022
Published in JEA Volume 28
Author Tags
Qualifiers
- Research-article
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 130Total Downloads
- Downloads (Last 12 months)102
- Downloads (Last 6 weeks)6
Reflects downloads up to 28 Jan 2025
Other Metrics
Citations
View Options
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign inFull Access
View options
View or Download as a PDF file.
PDFeReader
View online with eReader.
eReaderFull Text
View this article in Full Text.
Full TextHTML Format
View this article in HTML Format.
HTML Format