Solution algorithms for the generalized train unit shunting problem - ScienceDirect

Solution algorithms for the generalized train unit shunting problem - ScienceDirect

This paper proposes different algorithms to tackle the Generalized Train Unit Shunting Problem (G-TUSP). This is the pre-operational problem of managing rolling stock in a station, between arrivals and departures. It includes four sub-problems: the Train Matching Problem, the Track Assignment Problem, the Shunting Routing Problem, and the Shunting Maintenance Problem. In our algorithms, we consider different combinations for the integrated or sequential solutions of these sub-problems, typically considered independently in the literature. ......

Franck Kamenga, Paola Pellegrini, Joaquin Rodriguez, Boubekeur Merabet.Solution algorithms for the generalized train unit shunting problem, EURO Journal on Transportation and Logistics,

Volume 10, 2021, 100042, ISSN 2192-4376, https://doi.org/10.1016/j.ejtl.2021.100042.