A variable neighbourhood search for fast train scheduling and routing during disturbed railway traffic situations
DOI10.1016/j.cor.2016.02.008zbMath1391.90311OpenAlexW2287700099MaRDI QIDQ1652116
Francesco Corman, Marcella Samà, Andrea D'Ariano, Dario Pacciarelli
Publication date: 11 July 2018
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2016.02.008
tabu searchbranch-and-bounddisjunctive programmingvariable neighbourhood searchalternative graphreal-time railway traffic managementtrain scheduling and routing
Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Abstract computational complexity for mathematical programming problems (90C60) Transportation, logistics and supply chain management (90B06) Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59) Dynamic programming (90C39)
Related Items (18)
Uses Software
Cites Work
- Improving robustness of rolling stock circulations in rapid transit networks
- A set packing inspired method for real-time junction train routing
- On-line reschedule optimization for passenger railways in case of emergencies
- A constraint-based interactive train rescheduling tool
- Scheduling trains as a blocking parallel-machine job shop scheduling problem
- Variable neighbourhood search: Methods and applications
- A fast heuristic for the train scheduling problem
- Variable neighborhood tabu search and its application to the median cycle problem.
- A model predictive control approach for discrete-time rescheduling in complex central railway station areas
- Job-shop scheduling with blocking and no-wait constraints
- Dispatching and coordination in multi-area railway traffic management
- A branch and bound algorithm for scheduling trains in a railway network
- A Survey of Optimization Models for Train Routing and Scheduling
- Optimal Real-Time Traffic Control in Metro Stations
- Rescheduling Dense Train Traffic over Complex Station Interlocking Areas
- Unnamed Item
This page was built for publication: A variable neighbourhood search for fast train scheduling and routing during disturbed railway traffic situations