Evolution and Evaluation of the Penalty Method for Alternative Graphs

Authors Moritz Kobitzsch, Marcel Radermacher, Dennis Schieferdecker



PDF
Thumbnail PDF

File

OASIcs.ATMOS.2013.94.pdf
  • Filesize: 0.81 MB
  • 14 pages

Document Identifiers

Author Details

Moritz Kobitzsch
Marcel Radermacher
Dennis Schieferdecker

Cite AsGet BibTex

Moritz Kobitzsch, Marcel Radermacher, and Dennis Schieferdecker. Evolution and Evaluation of the Penalty Method for Alternative Graphs. In 13th Workshop on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems. Open Access Series in Informatics (OASIcs), Volume 33, pp. 94-107, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2013)
https://doi.org/10.4230/OASIcs.ATMOS.2013.94

Abstract

Computing meaningful alternative routes in a road network is a complex problem -- already giving a clear definition of a best alternative seems to be impossible. Still, multiple methods describe how to compute reasonable alternative routes, each according to their own quality criteria. Among these methods, the penalty method has received much less attention than the via-node or plateaux based approaches. A mayor cause for the lack of interest might be the unavailability of an efficient implementation. In this paper, we take a closer look at the penalty method and extend upon its ideas. We provide the first viable implementation --suitable for interactive use-- using dynamic runtime adjustments to perform up to multiple orders of magnitude faster queries than previous implementations. Using our new implementation, we thoroughly evaluate the penalty method for its flaws and benefits.
Keywords
  • Alternatives
  • Routing
  • Shortest Paths
  • Penalties
  • Parallelization

Metrics

  • Access Statistics
  • Total Accesses (updated on a weekly basis)
    0
    PDF Downloads