Copyright
when quoting this document, please refer to the following
URN: urn:nbn:de:0030-drops-6841
URL: http://drops.dagstuhl.de/opus/volltexte/2006/684/
Bampas, Evangelos ; Kaouri, Georgia ; Lampis, Michael ; Pagourtzis, Aris

Periodic Metro Scheduling

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

Abstract

We introduce the { extsc{Periodic Metro Sched-ul-ing}} ({ extsc{PMS}}) problem, which aims in generating a periodic timetable for a given set of routes and a given time period, in such a way that the minimum time distance between any two successive trains that pass from the same point of the network is maximized. This can be particularly useful in cases where trains use the same rail segment quite often, as happens in metropolitan rail networks. We present exact algorithms for ({ extsc{PMS}}) in chain and spider networks, and constant ratio approximation algorithms for ring networks and for a special class of tree networks. Some of our algorithms are based on a reduction to the { extsc{Path Coloring}} problem, while others rely on techniques specially designed for the new problem.

BibTeX - Entry

@InProceedings{bampas_et_al:DSP:2006:684,
  author =	{Evangelos Bampas and Georgia Kaouri and Michael Lampis and Aris Pagourtzis},
  title =	{Periodic Metro Scheduling},
  booktitle =	{ATMOS 2006 - 6th Workshop on Algorithmic Methods and Models for Optimization of Railways},
  year =	{2006},
  editor =	{Riko Jacob and Matthias M{\"u}ller-Hannemann},
  publisher =	{Internationales Begegnungs- und Forschungszentrum f{"u}r Informatik (IBFI), Schloss Dagstuhl, Germany},
  address =	{Dagstuhl, Germany},
  URL =		{http://drops.dagstuhl.de/opus/volltexte/2006/684},
  annote =	{Keywords: Train scheduling, path coloring, delay-tolerant scheduling, periodic timetabling},
  ISBN =	{978-3-939897-01-9}
}

Keywords: Train scheduling, path coloring, delay-tolerant scheduling, periodic timetabling
Seminar: ATMOS 2006 - 6th Workshop on Algorithmic Methods and Models for Optimization of Railways
Documenttype: InProceedings
Issue date: 2006
Date of publication: 29.08.2006

DROPS-Home | Fulltext Search | Imprint Published by LZI