Change search
ReferencesLink to record
Permanent link

Direct link
Periodic Metro Scheduling
National Technical University of Athens.
2006 (English)Conference paper (Refereed)
Abstract [en]

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.

Place, publisher, year, edition, pages
Keyword [en]
Train scheduling, path coloring, delay-tolerant scheduling, periodic timetabling
National Category
Computer and Information Science
URN: urn:nbn:se:kth:diva-58594DOI: 10.4230/OASIcs.ATMOS.2006.684OAI: diva2:473396
6th Workshop on Algorithmic Methods and Models for Optimization of Railways, (ATMOS'06)

QC 20120117

Available from: 2012-01-05 Created: 2012-01-05 Last updated: 2016-05-23Bibliographically approved

Open Access in DiVA

No full text

Other links

Publisher's full text

Search in DiVA

By author/editor
Lampis, Michael
Computer and Information Science

Search outside of DiVA

GoogleGoogle Scholar
The number of downloads is the sum of all downloads of full texts. It may include eg previous versions that are now no longer available

Altmetric score

Total: 24 hits
ReferencesLink to record
Permanent link

Direct link