Abstract
A model for scheduling freight-trains, considering one section in the railway network, has been developed. The model is a network flow model with ensuring efficient algorithms. The model has been tested on data from the Danish State Railways.
The model may as well be used for longterm planning e.g. finding the optimal capacity of the section considered as for short term control e.g. the bi-annual changes of the schedule.
The model is set up with reference to real life applications and has appeared to be able to include the major part of the technical and operational constraints.
In real life the scheduling of trains is a very complicated and troublesome task to do manually. A mathematical model can not entirely make up for the experience and the ability of an experienced scheduler. What the model can do is to help him get a survey of the problem and to do some of the boring computional work. Therefore, in this paper it has been the general aim to set up rather simple models which partly optimize, partly ensure most constraints from the application in question to be fulfilled. Thus, the model is an addendum to the scheduler who has to verify the solution given by the model, who can preditermine parts of the solution, or in other ways combine his general knowledge of the railway system with the flexibility and the rapidity of the model. This might in general be the road ahead for using optimization models in real life applications.
Preview
Unable to display preview. Download preview PDF.
References
Colding-Jørgensen, C. (1977): Omløbsplanlægning for lokomotiver (in Danish). Master thesis. The Institute of Mathematical Statistics and Operations Research (IMSOR), The Technical University of Denmark, DK 2800 Lyngby, Denmark.
Garfinkel, R.S. and Nemhauser, G.L. (1972): Integer Programming. John Wiley & Sons.
Glover, F., Karney, D. & Klingman, D. (1973): Implementation and computational comparisons of primal, dual and and primal-dual computer codes for minimum cost network flow problems, Research Report CS 136, Center for Cybernetic Studies, University of Texas, Austin, TEX.
Glover, F., Klingman, D. & Stutz, J. (1974): Augmented treaded index method for network optimization, INFOR, vol. 12, no. 3, pp. 293–298.
Jensen, O.H. (1977): Scheduling of trains, a network approach. Working paper. The Institute of Mathematical Statistics and Operations Research (IMSOR). The Technical University of Denmark, DK-2800 Lyngby, Denmark.
Karney, D. & Klingman, D. (1973): Implementation and computational study on an in-core out-of-core primal network code, Research Report CS 158, Center for Cybernetic Studies, University of Texas, Austin, TEX.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1978 Springer-Verlag
About this paper
Cite this paper
Colding-Jørgensen, C., Holst Jensen, O., Stig-Nielsen, P. (1978). Scheduling of trains — An optimization approach. In: Stoer, J. (eds) Optimization Techniques. Lecture Notes in Control and Information Sciences, vol 7. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0006548
Download citation
DOI: https://doi.org/10.1007/BFb0006548
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-08708-3
Online ISBN: 978-3-540-35890-9
eBook Packages: Springer Book Archive