License
when quoting this document, please refer to the following
DOI: 10.4230/OASIcs.ATMOS.2009.2147
URN: urn:nbn:de:0030-drops-21478
URL: http://drops.dagstuhl.de/opus/volltexte/2009/2147/
Beyersdorff, Olaf ; Nebesov, Yevgen

Edges as Nodes - a New Approach to Timetable Information

pdf-format:
Dokument 1.pdf (375 KB)

Abstract

In this paper we suggest a new approach to timetable information by introducing the ``edge-converted graph'' of a timetable. Using this model we present simple algorithms that solve the earliest arrival problem (EAP) and the minimum number of transfers problem (MNTP). For constant-degree graphs this yields linear-time algorithms for EAP and MNTP which improves upon the known \emph{Dijkstra}-based approaches. We also test the performance of our algorithms against the classical algorithms for EAP and MNTP in the time-expanded model.

BibTeX - Entry

@InProceedings{beyersdorff_et_al:DSP:2009:2147,
  author =	{Olaf Beyersdorff and Yevgen Nebesov},
  title =	{Edges as Nodes - a New Approach to Timetable Information },
  booktitle =	{ATMOS 2009 - 9th Workshop on Algorithmic Approaches for Transportation Modeling, Optimization, and Systems},
  year =	{2009},
  editor =	{Jens Clausen and Gabriele Di Stefano},
  publisher =	{Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik, Germany},
  address =	{Dagstuhl, Germany},
  URL =		{http://drops.dagstuhl.de/opus/volltexte/2009/2147},
  annote =	{Keywords: Timetable infomation, earliest arrival problem, minimum number of transfers problem, time-expanded model},
  ISBN =	{978-3-939897-11-8}
}

Keywords: Timetable infomation, earliest arrival problem, minimum number of transfers problem, time-expanded model
Freie Schlagwörter (englisch): Timetable infomation, earliest arrival problem, minimum number of transfers problem, time-expanded model
Seminar: 9th Workshop on Algorithmic Approaches for Transportation Modeling, Optimization, and Systems (ATMOS'09)
Issue date: 2009
Date of publication: 25.11.2009

DROPS-Home | Fulltext Search | Imprint Published by LZI