License
When quoting this document, please refer to the following
DOI: 10.4230/OASIcs.ATMOS.2014.15
URN: urn:nbn:de:0030-drops-47494
URL: http://drops.dagstuhl.de/opus/volltexte/2014/4749/
Go to the corresponding OASIcs Volume Portal


Nonner, Tim ; Laumanns, Marco

Shortest Path with Alternatives for Uniform Arrival Times: Algorithms and Experiments

pdf-format:
p015-02-nonner.pdf (0.5 MB)


Abstract

The Shortest Path with Alternatives (SPA) policy differs from classical shortest path routing in the following way: instead of providing an exact list of means of transportation to follow, this policy gives such a list for each stop, and the traveler is supposed to pick the first option from this list when waiting at some stop. First, we show that an optimal policy of this type can be computed in polynomial time for uniform arrival times under reasonable assumptions. A similar result was so far only known for Poisson arrival times, which are less realistic for frequency-based public transportation systems. Second, we experimentally evaluate such policies. In this context, our main finding is that SPA policies are surprisingly competitive compared to traditional shortest paths, and moreover yield a significant reduction of waiting times, and therefore improvement of user experience, compared to similar greedy approaches. Specifically, for roughly 25% of considered cases, we could decrease the expected waiting time by at least 20%. To run our experiments, we also describe a tool-chain to derive the necessary information from the popular GTFS-format, therefore allowing the application of SPA policies to a wide range of public transportation systems.

BibTeX - Entry

@InProceedings{nonner_et_al:OASIcs:2014:4749,
  author =	{Tim Nonner and Marco Laumanns},
  title =	{{Shortest Path with Alternatives for Uniform Arrival Times: Algorithms and Experiments}},
  booktitle =	{14th Workshop on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems},
  pages =	{15--24},
  series =	{OpenAccess Series in Informatics (OASIcs)},
  ISBN =	{978-3-939897-75-0},
  ISSN =	{2190-6807},
  year =	{2014},
  volume =	{42},
  editor =	{Stefan Funke and Mat{\'u}{\v{s}} Mihal{\'a}k},
  publisher =	{Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{http://drops.dagstuhl.de/opus/volltexte/2014/4749},
  URN =		{urn:nbn:de:0030-drops-47494},
  doi =		{10.4230/OASIcs.ATMOS.2014.15},
  annote =	{Keywords: Shortest Path, Stochastic Optimization, Public Transportation}
}

Keywords: Shortest Path, Stochastic Optimization, Public Transportation
Seminar: 14th Workshop on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems
Issue Date: 2014
Date of publication: 09.09.2014


DROPS-Home | Fulltext Search | Imprint Published by LZI