Search Results

Documents authored by Nebesov, Yevgen

Document
DOI: 10.4230/OASIcs.ATMOS.2009.2147
Edges as Nodes - a New Approach to Timetable Information

Authors: Olaf Beyersdorff and Yevgen Nebesov

Published in: OASIcs, Volume 12, 9th Workshop on Algorithmic Approaches for Transportation Modeling, Optimization, and Systems (ATMOS'09) (2009)

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.
Cite as

Olaf Beyersdorff and Yevgen Nebesov. Edges as Nodes - a New Approach to Timetable Information. In 9th Workshop on Algorithmic Approaches for Transportation Modeling, Optimization, and Systems (ATMOS'09). Open Access Series in Informatics (OASIcs), Volume 12, pp. 1-12, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2009)

Copy BibTex To Clipboard

@InProceedings{beyersdorff_et_al:OASIcs.ATMOS.2009.2147,
  author =	{Beyersdorff, Olaf and Nebesov, Yevgen},
  title =	{{Edges as Nodes - a New Approach to Timetable Information}},
  booktitle =	{9th Workshop on Algorithmic Approaches for Transportation Modeling, Optimization, and Systems (ATMOS'09)},
  pages =	{1--12},
  series =	{Open Access Series in Informatics (OASIcs)},
  ISBN =	{978-3-939897-11-8},
  ISSN =	{2190-6807},
  year =	{2009},
  volume =	{12},
  editor =	{Clausen, Jens and Di Stefano, Gabriele},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/OASIcs.ATMOS.2009.2147},
  URN =		{urn:nbn:de:0030-drops-21478},
  doi =		{10.4230/OASIcs.ATMOS.2009.2147},
  annote =	{Keywords: Timetable infomation, earliest arrival problem, minimum number of transfers problem, time-expanded model Timetable infomation, earliest arrival problem, minimum number of transfers problem, time-expanded model}
}
Questions / Remarks / Feedback
X

Feedback for Dagstuhl Publishing


Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail
© 2023-2024 Schloss Dagstuhl – LZI GmbH Imprint Privacy Contact