Solution algorithms for the generalized train unit shunting problem - Archive ouverte HAL Accéder directement au contenu
Article Dans Une Revue EURO Journal on Transportation and Logistics Année : 2021

Solution algorithms for the generalized train unit shunting problem

Résumé

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. We assess the performance of the algorithms proposed in real-life and fictive instances representing traffic in Metz-Ville station, which includes four shunting yards. It is a main junction between two dense traffic lines in the east of France. In a thorough experimental analysis, we study the contribution of each sub-problem to the difficulty of the G-TUSP, and we identify the best algorithms. The outcomes of our algorithms are superior to solutions manually designed by experienced railway practitioners.
Fichier principal
Vignette du fichier
doc00033311.pdf (1.61 Mo) Télécharger le fichier
Origine : Publication financée par une institution

Dates et versions

hal-03287396 , version 1 (15-07-2021)

Licence

Paternité - Pas d'utilisation commerciale

Identifiants

Citer

Franck Kamenga, Paola Pellegrini, Joaquin Rodriguez, Boubekeur Merabet. Solution algorithms for the generalized train unit shunting problem. EURO Journal on Transportation and Logistics, 2021, 10, pp1-16. ⟨10.1016/j.ejtl.2021.100042⟩. ⟨hal-03287396⟩
44 Consultations
70 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More