White Rose University Consortium logo
University of Leeds logo University of Sheffield logo York University logo

Edges as Nodes - a New Approach to Timetable Information

Beyersdorff, O and Nebesov, Y (2009) Edges as Nodes - a New Approach to Timetable Information. In: ATMOS 2009. Workshop on Algorithmic Approaches for Transportation Modeling, Optimization, and Systems (ATMOS), 10 September 2009, University of Cophenhagen, Denmark. Dagstuhl Research Online Publication Server (DROPS) . ISBN 978-3-939897-11-8

Available under licence : See the attached licence file.

Download (348Kb)


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.

Item Type: Proceedings Paper
Copyright, Publisher and Additional Information: © 2009 Beyersdorff et al. This is an open-access article distributed under the terms of the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original author and source are credited.
Institution: The University of Leeds
Academic Units: The University of Leeds > Faculty of Engineering (Leeds) > School of Computing (Leeds) > Institute for Computational and Systems Science (Leeds)
Depositing User: Symplectic Publications
Date Deposited: 10 Dec 2012 16:20
Last Modified: 07 Jun 2014 06:35
Published Version: http://dx.doi.org/10.4230/OASIcs.ATMOS.2009.2147
Status: Published
Publisher: Dagstuhl Research Online Publication Server (DROPS)
Identification Number: 10.4230/OASIcs.ATMOS.2009.2147
URI: http://eprints.whiterose.ac.uk/id/eprint/74806

Actions (repository staff only: login required)