Abstract
Railway rescheduling is the task of restoring feasibility in case of disturbances and limiting the propagation of delays through a railway network. This task becomes more difficult when dealing with complex interlocking areas, since operational rules constrain the passage of trains through short track sections. This paper presents a detailed microscopic representation of the railway network that is able to tackle the complexity of a station area with multiple conflicting routes and high service frequency. Two alternative graph formulations are presented to model the incompatibility between routes: one based on track sections and another based on the aggregation of track sections into station routes. An extensive computational study gives useful information on the performance of the two formulations for different disturbance scenarios.
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
Schrijver, A., Steenbeek, A.: Dienstregelingontwikkeling voor Railned: Rapport CADANS 1.0. Technical report, Centrum voor Wiskunde en Informatica, Amsterdam, the Netherlands (1994) (in Dutch)
Zwaneveld, P.J., Kroon, L.G., Van Hoesel, S.P.M.: Routing trains through a railway station based on a node packing model. European Journal of Operational Research 128(1), 14–33 (2001)
Caimi, G., Burkolter, D., Herrmann, T.: Finding delay-tolerant train routings through stations. In: Fleuren, H., Den Hertog, D., Kort, P. (eds.) Operations Research Proceedings 2004, pp. 136–143 (2005)
Fuchsberger, M.: Solving the train scheduling problem in a main station area via a resource constrained space-time integer multi-commodity flow. Master’s thesis, ETH Zurich (2007)
Caimi, G., Burkolter, D., Herrmann, T., Chudak, F., Laumanns, M.: Design of a railway scheduling model for dense services. Networks and Spatial Economics 9(1), 25–46 (2009)
Rodriguez, J.: A study of the use of state resources in a constraint-based model for routing and scheduling trains. In: Hansen, I.A., Radtke, A., Pachl, J., Wendler, E. (eds.) Proceedings of the 2nd International Seminar on Railway Operations Modelling and Analysis, Hannover, Germany (2007)
D’Ariano, A., Pacciarelli, D., Pranzo, M.: A branch and bound algorithm for scheduling trains in a railway network. European Journal of Operational Research 183(2), 643–657 (2007)
Hansen, I.A., Pachl, J. (eds.): Railway Timetable and Traffic: Analysis, Modelling and Simulation. Eurailpress, Hamburg (2008)
Pachl, J.: Railway Operation and Control. VTD Rail Publishing, Mountlake Terrace (2002)
Mascis, A., Pacciarelli, D.: Job shop scheduling with blocking and no-wait constraints. European Journal of Operational Research 143(3), 498–517 (2002)
Artigues, C., Feillet, D.: A branch and bound method for the job-shop problem with sequence-dependent setup times. Annals of Operations Research 159(1), 135–159 (2008)
Jackson, J.R.: Scheduling a production line to minimize maximum tardiness. Technical Report 43, University of California, Los Angeles, Management Science Research Project (1955)
D’Ariano, A., Pranzo, M., Hansen, I.A.: Conflict resolution and train speed co-ordination for solving real-time timetable perturbations. IEEE Transactions on Intelligent Transportation Systems 8(2), 208–222 (2007)
D’Ariano, A.: Improving Real-Time Train Dispatching: Models, Algorithms and Applications. PhD Thesis, TRAIL Thesis Series T2008/6, The Netherlands (2008)
Yuan, J.: Stochastic Modelling of Train Delays and Delay Propagation in Stations. PhD Thesis, TRAIL Thesis Series T2006/6, The Netherlands (2006)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2009 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Corman, F., Goverde, R.M.P., D’Ariano, A. (2009). Rescheduling Dense Train Traffic over Complex Station Interlocking Areas. In: Ahuja, R.K., Möhring, R.H., Zaroliagis, C.D. (eds) Robust and Online Large-Scale Optimization. Lecture Notes in Computer Science, vol 5868. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-05465-5_16
Download citation
DOI: https://doi.org/10.1007/978-3-642-05465-5_16
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-05464-8
Online ISBN: 978-3-642-05465-5
eBook Packages: Computer ScienceComputer Science (R0)