Abstract
We consider the problem of rescheduling trains in the case where one track of a railway section consisting of two tracks in opposing directions is closed due to construction activities. After presenting an appropriate model for this situation we derive a polynomial algorithm for the subproblem of finding an optimal schedule with minimal latenesss if the subsequences of trains for both directions outside the construction site are fixed. Based on this algorithm we propose a local search procedure for the general problem of finding good schedules and report test results for some real world instances.
Supported by the Deutsche Forschungsgemeinschaft, Project ‘Komplexe Maschinen-Schedulingprobleme’.
We would like to thank Andreas Landt for implementing the method proposed in this paper and for testing it on real world data sets (cf. Landt [16]). We would also like to thank the German Railways for providing these data sets. Finally, we would like to acknowledge the fruitful cooperation with TLC and the helpful comments of two anonymous referees.
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
Aarts E, Lenstra JK (1997) Local search in combinatorial optimization. Wiley, New York
Brünger O (1995) Konzeption einer Rechnerunterstützung für die Feinkonstruktion von Eisenbahnfahrpläanen. Veröffentlichungen desVerkehrswissenschaftlichen Institutes der RWTH Aachen, Nr. 51
Bussieck MR, Winter T, Zimmermann UT (1997) Discrete optimization in public rail transport. Mathematical Programming 79: 415–444
Cai X, Goh CJ (1994) A fast heuristic for the train scheduling problem. Computers and Operational Research 21(5): 499–510
Chiu CK, Chou CM, Lee JHM, Leung HF, Leung YW (1996) A constraint-based interactive train rescheduling tool. Proceedings 2nd International Conference Principle and Practice of Constraint Programming-CP’96, Cambridge, MA
Cordeau J, Toth P, Vigo D (1998) A survey of optimization models for train routing and scheduling. Transportation Science 32: 380–404
Glover F, Laguna M (1997) Tabu search. Kluwer, Amsterdam
Goh CJ, Mees AI (1991) Optimal control on a graph with application to train scheduling problems. Mathematica Computing Modeling 15: 49–58
Higgins A, Kozan E, Ferreira L (1994) Development of a model to optimise the position of crossing and overtaking loops on a single line railway. Physical Infrastructure Res. Rep., 16–94, Queensland University of Technology, Brisbane
Higgins A, Kozan E, Ferreira L (1995) Rescheduling of trains on a single line track: improved heuristic solution techniques. Physical Infrastructure Res. Rep., 1–95, Queensland University of Technology, Brisbane
Higgins A, Kozan E, Ferreira L (1996) Optimal scheduling of trains on a single line track. Transportation Research Part B 30(2): 147–161
Isaai MT, Singh MG (2000) An object-oriented, constraint-based heuristic for a class of passenger-train scheduling problems. IEEE Transactions on Systems, Man, and Cybernetics — Part C: Applications and Reviews 30(1): 12–21
Jovanovic D, Harker P (1991) Tactical scheduling of rail operations: the SCAN I system. Transportation Science 25: 46–64
Kraay D, Harker P, Chen B (1991) Optimal pacing of trains in freight railroads. Operations Research 39: 82–99
Kraft ER (1987) A branch and bound procedure for optimal train dispatching. Journal of Transportation Research Forum 28: 263–276
Landt A (1999) Scheduling von Zügen im Baustellenbereich. Diplomarbeit Universität Osnabrück, Fachbereich Mathematik/Informatik
Lenstra JK, Rinnooy Kan AHG, Brucker P (1977) Complexity of machine scheduling problems. Annals of Discrete Mathematics 1: 343–362
Mees AI (1991) Railway scheduling by network optimization. Mathematical Computing Modeling 15(1): 33–42
Mills RG, Perkins SE, Pudney PJ (1991) Dynamic rescheduling of long haul trains for improved timekeeping and energy. Asia-Pacific Journal of Operational Research 8: 146–165
Peterson ER, Taylor J (1982) A structured model for rail line simulation and optimization. Transportation Science 16(2): 192–206
Peterson ER, Taylor J, Martland CD (1986) An introduction to computer assisted train dispatch. Journal of Adv Transn 20: 63–72
Sahin I (1999) Railway traffic control and train scheduling based on inter-train conflict management. Transportation Research Part B 33: 511–534
Schrijver A (2000) Timetabling for the dutch railways. Proceedings of the 7th International Workshop on Project Management and Scheduling, Osnabrück, http://www.mathematik.uni-osnabrueck.de/research/OR/pms2000
Szpigel B (1973) Optimal train scheduling on a single line railway. Operations Research 72: 344–351
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Brucker, P., Heitmann, S., Knust, S. (2005). Scheduling railway traffic at a construction site. In: Günther, HO., Kim, K.H. (eds) Container Terminals and Automated Transport Systems. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-26686-0_15
Download citation
DOI: https://doi.org/10.1007/3-540-26686-0_15
Received:
Accepted:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-22328-3
Online ISBN: 978-3-540-26686-0
eBook Packages: Business and EconomicsBusiness and Management (R0)