A MIP-based local search method for the railway rescheduling problem

DOI10.1002/net.20384zbMath1205.90072OpenAlexW2038278740MaRDI QIDQ3076018

Serigne Gueye, Dominique Feillet, Rodrigo Acuna-Agost, Philippe Yves Paul Michelon

Publication date: 17 February 2011

Published in: Networks (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/net.20384

zbMATH Keywords

disruption managementtrain timetablinglocal branchingrescheduling

Mathematics Subject Classification ID

Mixed integer programming (90C11) Deterministic scheduling theory in operations research (90B35) Case-oriented studies in operations research (90B90) Traffic problems in operations research (90B20)

Related Items

An iterative approach for reducing the impact of infrastructure maintenance on the performance of railway systems ⋮ SAPI: statistical analysis of propagation of incidents. A new approach for rescheduling trains after disruptions ⋮ Review of real-time vehicle schedule recovery methods in transportation services ⋮ The dispatching problem on multitrack territories: Heuristic approaches based on mixed integer linear programming

Cites Work

• A constraint-based interactive train rescheduling tool
• Discrete optimization in public rail transport
• Rescheduling manufacturing systems: A framework of strategies, policies, and methods
• A Survey of Optimization Models for Train Routing and Scheduling
• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
• Operations Research in passenger railway transportation