Platform assignment

Authors:
Sabine Cornelsen;Gabriele Di Stefano
Affiliations:
Universität Konstanz, Fachbereich Informatik & Informationswissenschaft;Università dell'Aquila, Dipartimento di Ingegneria Elettrica
Venue:
ATMOS'04 Proceedings of the 4th international Dagstuhl, ATMOS conference on Algorithmic approaches for transportation modeling, optimization, and systems
Year:
2004

Citing 6
Cited 0

Circular permutation graph family with applications

Discrete Applied Mathematics - Special issue: graphs in electrical engineering, discrete algorithms and complexity
The train marshalling problem

Discrete Applied Mathematics
On the performance of the First-Fit coloring algorithm on permutation graphs

Information Processing Letters
Dispatching Buses in Parking Depots

Transportation Science
Algorithmic Graph Theory and Perfect Graphs (Annals of Discrete Mathematics, Vol 57)

Algorithmic Graph Theory and Perfect Graphs (Annals of Discrete Mathematics, Vol 57)
Shunting of Passenger Train Units in a Railway Station

Transportation Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

We consider a station in which several trains might stop at the same platform at the same time. The trains might enter and leave the station to both sides, but the arrival and departure times and directions are fixed according to a given time table. The problem is to assign platforms to the trains such that they can enter and leave the station in time without being blocked by any other train. We consider some variation of the problem on linear time tables as well as on cyclic time tables and show how to solve them as a graph coloring problem on special graph classes. One of these classes are the so called circular arc containment graphs for which we give an O(n log n) coloring algorithm.