License: Creative Commons Attribution 3.0 Unported license (CC BY 3.0)
When quoting this document, please refer to the following
DOI: 10.4230/OASIcs.ATMOS.2020.4
URN: urn:nbn:de:0030-drops-131408
URL: http://dagstuhl.sunsite.rwth-aachen.de/volltexte/2020/13140/
Go to the corresponding OASIcs Volume Portal

Sauer, Jonas ; Wagner, Dorothea ; Zündorf, Tobias

Integrating ULTRA and Trip-Based Routing

pdf-format:
OASIcs-ATMOS-2020-4.pdf (0.5 MB)

Abstract

We study a bi-modal journey planning scenario consisting of a public transit network and a transfer graph representing a secondary transportation mode (e.g., walking or cycling). Given a pair of source and target locations, the objective is to find a Pareto set of journeys optimizing arrival time and the number of required transfers. For public transit networks with a restricted, transitively closed transfer graph, one of the fastest known algorithms solving this bi-criteria problem is Trip-Based Routing [Witt, 2015]. However, this algorithm cannot be trivially extended to unrestricted transfer graphs. In this work, we combine Trip-Based Routing with ULTRA [Baum et al., 2019], a preprocessing technique that allows any public transit algorithm that requires transitive transfers to handle an unrestricted transfer graph. Since both ULTRA and Trip-Based Routing precompute transfer shortcuts in a preprocessing phase, a naive combination of the two leads to a three-phase algorithm that performs redundant work and produces superfluous shortcuts. We therefore propose a new, integrated preprocessing phase that combines the advantages of both and reduces the number of computed shortcuts by up to a factor of 9 compared to a naive combination. The resulting query algorithm, ULTRA-Trip-Based is the fastest known algorithm for the considered problem setting, achieving a speedup of up to 4 compared to the fastest previously known approach, ULTRA-RAPTOR.

BibTeX - Entry

@InProceedings{sauer_et_al:OASIcs:2020:13140,
  author =	{Jonas Sauer and Dorothea Wagner and Tobias Z{\"u}ndorf},
  title =	{{Integrating ULTRA and Trip-Based Routing}},
  booktitle =	{20th Symposium on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (ATMOS 2020)},
  pages =	{4:1--4:15},
  series =	{OpenAccess Series in Informatics (OASIcs)},
  ISBN =	{978-3-95977-170-2},
  ISSN =	{2190-6807},
  year =	{2020},
  volume =	{85},
  editor =	{Dennis Huisman and Christos D. Zaroliagis},
  publisher =	{Schloss Dagstuhl--Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/opus/volltexte/2020/13140},
  URN =		{urn:nbn:de:0030-drops-131408},
  doi =		{10.4230/OASIcs.ATMOS.2020.4},
  annote =	{Keywords: Algorithms, Journey Planning, Multi-Modal, Public Transportation}
}

Keywords: Algorithms, Journey Planning, Multi-Modal, Public Transportation
Collection: 20th Symposium on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (ATMOS 2020)
Issue Date: 2020
Date of publication: 10.11.2020
Supplementary Material: Code is available at https://github.com/kit-algo/ULTRA-Trip-Based.

DROPS-Home | Fulltext Search | Imprint | Privacy Published by LZI