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 \(\mathcal O(n \log n)\) coloring algorithm.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Blasum, U., Bussieck, M.R., Hochstättler, W., Moll, C., Scheel, H.-H., Winter, T.: Scheduling trams in the morning. Mathematical Methods of Operations Research 49(1), 137–148 (1999)
Chvátal, V.: Perfectly ordered graphs. In: Topics on Perfect Graphs. Annals of Discrete Mathematics, vol. 21, pp. 63–65. North-Holland, Amsterdam (1984)
Dahlhaus, E., Horak, P., Miller, M., Ryan, J.F.: The train marshalling problem. Discrete Applied Mathematics 103(1–3), 41–54 (2000)
Di Stefano, G., Koci, M.L.: A graph theoretical approach to the shunting problem. In: Gerards, B. (ed.) Proceedings of the Workshop on Algorithmic Methods and Models for Optimization of Railways (ATMOS 2003), Electronic Notes in Theoretical Computer Science, vol. 92 (2004)
Freling, R., Lentink, R.M., Kroon, L.G., Huisman, D.: Shunting of passenger train units in a railway station. Technical Report EI2002-26, Econometric Institute, Erasmus University Rotterdam. To appear in Transportation Science (2002), http://www.eur.nl/WebDOC/doc/econometrie/feweco20020917130601.pdf
Gallo, G., Di Miele, F.: Dispatching buses in parking depots. Transportation Science 35(3), 322–330 (2001)
Golumbic, M.C. (ed.): Algorithmic Graph Theory and Perfect Graphs. Computer Science and Applied Mathematics. Academic Press, San Diego (1980)
He, S., Song, R., Chaudhry, S.S.: Fuzzy dispatching model and genetic algorithms for railyards operations. European Journal of Operational Research 124(2), 307–331 (2000)
Lou, R.D., Sarrafzadeh, M.: Circular permutation graph family with applications. Discrete Applied Mathematics 40, 433–457 (1992)
Nikolopoulos, S.D., Papadopoulos, C.: On the performance of the first-fit coloring algorithm on permutation graphs. Information Processing Letters 75, 265–273 (2000)
Nirkhe, M.V.: Efficient algorithms for circular-arc containment graphs. Master’s thesis, University of Maryland (1987), http://techreports.isr.umd.edu/report/1987/MS_87-11.pdf
Rossi, A.: Il problema dell’ordinamento dei treni in un deposito: modellazione e soluzione algoritmica. Master’s thesis, Università dell’Aquila (2003)
Winter, T., Zimmermann, U.T.: Real-time dispatch of trams in storage yards. Annals of Operations Research 96, 287–315 (2000)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Cornelsen, S., Di Stefano, G. (2007). Platform Assignment. In: Geraets, F., Kroon, L., Schoebel, A., Wagner, D., Zaroliagis, C.D. (eds) Algorithmic Methods for Railway Optimization. Lecture Notes in Computer Science, vol 4359. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-74247-0_12
Download citation
DOI: https://doi.org/10.1007/978-3-540-74247-0_12
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-74245-6
Online ISBN: 978-3-540-74247-0
eBook Packages: Computer ScienceComputer Science (R0)