A set packing inspired method for real-time junction train routing

DOI10.1016/J.COR.2011.12.004zbMATH Open1349.90595OpenAlexW1981590790MaRDI QIDQ340232FDOQ340232

Matthias Ehrgott, Jesper Larsen, David M. Ryan, Richard M. Lusby

Publication date: 14 November 2016

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://orbit.dtu.dk/en/publications/a-set-packing-inspired-method-for-realtime-junction-train-routing(05709f34-9096-497b-94ce-fbae23bd5378).html

zbMATH Keywords

optimizationdualitytrain routingdisruption management

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Deterministic scheduling theory in operations research (90B35) Case-oriented studies in operations research (90B90)

Cited In (10)

• A MaxSAT approach for solving a new dynamic discretization discovery model for train rescheduling problems
• Dispatching and coordination in multi-area railway traffic management
• A train dispatching model under a stochastic environment: stable train routing constraints and reformulation
• Effective train routing selection for real-time traffic management: improved model and ACO parallel computing
• A variable neighbourhood search for fast train scheduling and routing during disturbed railway traffic situations
• An iterative approach for reducing the impact of infrastructure maintenance on the performance of railway systems
• A data-driven, variable-speed model for the train timetable rescheduling problem
• Integrated rolling stock deadhead routing and timetabling in urban rail transit lines
• An efficient greedy heuristic for the real-time train platforming problem
• Routing trains through a railway station based on a node packing model

This page was built for publication: A set packing inspired method for real-time junction train routing

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q340232)