A variable neighbourhood search for fast train scheduling and routing during disturbed railway traffic situations

From MaRDI portal
Publication:1652116

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




Related Items (18)

Mathematical models for on-line train calendars generationEffective train routing selection for real-time traffic management: improved model and ACO parallel computingPerformance evaluation of a parallel ant colony optimization for the real-time train routing selection problem in large instancesPassenger flow control strategies for urban rail transit networksRailway disruption management: designing bus bridging services under uncertaintyScheduling local and express trains in suburban rail transit lines: mixed-integer nonlinear programming and adaptive genetic algorithmSet covering heuristics in a benders decomposition for railway timetablingOn the general problem statement of cargo carriages scheduling and ways to solve itRobust metro train scheduling integrated with skip-stop pattern and passenger flow control strategy under uncertain passenger demandsA multiobjective optimization for train routing at the high-speed railway station based on tabu search algorithmReal-time optimization strategy for single-track high-speed train rescheduling with disturbance uncertainties: a scenario-based chance-constrained model predictive control approachAir traffic flow management with layered workload constraintsA stochastic dynamic programming approach for delay management of a single train lineStrategic timetable scheduling for last trains in urban railway transit networksIntegrated rolling stock deadhead routing and timetabling in urban rail transit linesAn efficient train scheduling algorithm on a single-track railway systemA heuristic approach to solving the train traffic re-scheduling problem in real timeAccelerating logic-based benders decomposition for railway rescheduling by exploiting similarities in delays


Uses Software


Cites Work


This page was built for publication: A variable neighbourhood search for fast train scheduling and routing during disturbed railway traffic situations