Solution algorithms for the generalized train unit shunting problem
| Autor: | Joaquin Rodriguez, Paola Pellegrini, Boubekeur Merabet, Franck Kamenga |
|---|---|
| Přispěvatelé: | SNCF Réseau, DGEX Solutions, Laboratoire Électronique Ondes et Signaux pour les Transports (COSYS-LEOST ), Université de Lille-Université Gustave Eiffel, Évaluation des Systèmes de Transports Automatisés et de leur Sécurité (COSYS-ESTAS ), Université Gustave Eiffel |
| Jazyk: | angličtina |
| Rok vydání: | 2021 |
| Předmět: |
Matching (statistics)
Computer science SHUNTING PROBLEM RECHERCHE OPERATIONNELLE 0211 other engineering and technologies ROUTING CONTROLE OPTIMAL Transportation 02 engineering and technology Management Science and Operations Research Track (rail transport) Unit (housing) Maintenance Problem RAILWAY TRAFFIC MATCHING METZ ALGORITHME 0502 economics and business 11. Sustainability PLANIFICATION 050210 logistics & transportation 021103 operations research OPTIMISATION GARE 05 social sciences ROLLING STOCK MANAGEMENT GESTION DU TRAFIC Shunting TRANSPORT FERROVIAIRE AFFECTATION DU TRAFIC Modeling and Simulation VOIE FERREE MAINTENANCE SCHEDULING [MATH.MATH-OC]Mathematics [math]/Optimization and Control [math.OC] Routing (electronic design automation) Assignment problem Algorithm MATERIEL ROULANT |
| Zdroj: | EURO Journal on Transportation and Logistics EURO Journal on Transportation and Logistics, 2021, 10, pp1-16. ⟨10.1016/j.ejtl.2021.100042⟩ |
| DOI: | 10.1016/j.ejtl.2021.100042⟩ |
| Popis: | 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. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|