License: Creative Commons Attribution 3.0 Unported license (CC BY 3.0)
When quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.SEA.2020.16
URN: urn:nbn:de:0030-drops-120905
Go to the corresponding LIPIcs Volume Portal

Sauer, Jonas ; Wagner, Dorothea ; Z├╝ndorf, Tobias

Faster Multi-Modal Route Planning With Bike Sharing Using ULTRA

LIPIcs-SEA-2020-16.pdf (0.4 MB)


We study multi-modal route planning in a network comprised of schedule-based public transportation, unrestricted walking, and cycling with bikes available from bike sharing stations. So far this problem has only been considered for scenarios with at most one bike sharing operator, for which MCR is the best known algorithm [Delling et al., 2013]. However, for practical applications, algorithms should be able to distinguish between bike sharing stations of multiple competing bike sharing operators. Furthermore, MCR has recently been outperformed by ULTRA for multi-modal route planning scenarios without bike sharing [Baum et al., 2019]. In this paper, we present two approaches for modeling multi-modal transportation networks with multiple bike sharing operators: The operator-dependent model requires explicit handling of bike sharing stations within the algorithm, which we demonstrate with an adapted version of MCR. In the operator-expanded model, all relevant information is encoded within an expanded network. This allows for applying any multi-modal public transit algorithm without modification, which we show for ULTRA. We proceed by describing an additional preprocessing step called operator pruning, which can be used to accelerate both approaches. We conclude our work with an extensive experimental evaluation on the networks of London, Switzerland, and Germany. Our experiments show that the new preprocessing technique accelerates both approaches significantly, with the fastest algorithm (ULTRA-RAPTOR with operator pruning) being more than an order of magnitude faster than the basic MCR approach. Moreover, the ULTRA preprocessing step also benefits from operator pruning, as its running time is reduced by a factor of 14 to 20.

BibTeX - Entry

  author =	{Jonas Sauer and Dorothea Wagner and Tobias Z{\"u}ndorf},
  title =	{{Faster Multi-Modal Route Planning With Bike Sharing Using ULTRA}},
  booktitle =	{18th International Symposium on Experimental Algorithms (SEA 2020)},
  pages =	{16:1--16:14},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-148-1},
  ISSN =	{1868-8969},
  year =	{2020},
  volume =	{160},
  editor =	{Simone Faro and Domenico Cantone},
  publisher =	{Schloss Dagstuhl--Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{},
  URN =		{urn:nbn:de:0030-drops-120905},
  doi =		{10.4230/LIPIcs.SEA.2020.16},
  annote =	{Keywords: Algorithms, Route Planning, Bike Sharing, Public Transportation}

Keywords: Algorithms, Route Planning, Bike Sharing, Public Transportation
Collection: 18th International Symposium on Experimental Algorithms (SEA 2020)
Issue Date: 2020
Date of publication: 12.06.2020
Supplementary Material: Source code is available at

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