Ivan Beloševic
Faculty of Transport and Traffic Engineering, University of Belgrade, Belgrade, Serbia
Yun Jing
Faculty of Transport and Traffic Engineering, University of Belgrade, Belgrade, Serbia
Miloš Ivic
Faculty of Transport and Traffic Engineering, University of Belgrade, Belgrade, Serbia
Predrag Jovanovic
Faculty of Transport and Traffic Engineering, University of Belgrade, Belgrade, Serbia
Download article![](/images/PDF_24.png)
Published in: RailNorrköping 2019. 8th International Conference on Railway Operations Modelling and Analysis (ICROMA), Norrköping, Sweden, June 17th – 20th, 2019
Linköping Electronic Conference Proceedings 69:8, p. 116-127
Published: 2019-09-13
ISBN: 978-91-7929-992-7
ISSN: 1650-3686 (print), 1650-3740 (online)
Multi-stage train classification is a complex marshalling procedure that could be applied for simultaneous multi-group train formation. Simultaneous train formation is capacble of processing a large volume classification insensitive on the number of outbound trains. Through multi-stage classification, wagons are moved several times to achieve desired outbound train sequences. he main optimization issue refers to finding a balance between the number of sorting steps and the total number of wagon movements. The optimization of the classification schedule could be addressed at different levels of the yard planning hierarchy. In this paper we develop mathematical formulation and two different heuristic algorithms to support tactical decisions for the multi-stage train classification problem. The main optimization issue refers to the allocation of tracks for performing multi-stage train classification minimizing annual operating costs. In order to validate the mathematical formulation and evaluate the efficiency of the proposed optimization model, we conduct computational tests and case study experimentations based on infrastructural and operational conditions applied in Belgrade marshalling yard in Serbia.
Marshalling ywards, multi-stage train classification, Optimization model, Heuristic algorithms