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

DOI10.1016/j.cor.2011.12.004zbMath1349.90595OpenAlexW1981590790MaRDI QIDQ340232

Mohammad Hasan, M. Dambrine

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

optimizationdualitydisruption managementtrain routing

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)

Related Items (6)

A train dispatching model under a stochastic environment: stable train routing constraints and reformulation ⋮ A data-driven, variable-speed model for the train timetable rescheduling problem ⋮ An iterative approach for reducing the impact of infrastructure maintenance on the performance of railway systems ⋮ A variable neighbourhood search for fast train scheduling and routing during disturbed railway traffic situations ⋮ Dispatching and coordination in multi-area railway traffic management ⋮ Integrated rolling stock deadhead routing and timetabling in urban rail transit lines

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