A MIP-based local search method for the railway rescheduling problem
DOI10.1002/NET.20384zbMATH Open1205.90072OpenAlexW2038278740MaRDI QIDQ3076018FDOQ3076018
Authors: Dominique Feillet, Serigne Gueye, Rodrigo Acuna-Agost, Philippe 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
Recommendations
- SAPI: statistical analysis of propagation of incidents. A new approach for rescheduling trains after disruptions
- Using a general-purpose mixed-integer linear programming solver for the practical solution of real-time train rescheduling
- Rescheduling Dense Train Traffic over Complex Station Interlocking Areas
- Heuristic approach to train rescheduling
- Scheduling railway traffic at a construction site
Deterministic scheduling theory in operations research (90B35) Case-oriented studies in operations research (90B90) Mixed integer programming (90C11) Traffic problems in operations research (90B20)
Cites Work
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- Rescheduling manufacturing systems: A framework of strategies, policies, and methods
- A survey of optimization models for train routing and scheduling
- Operations Research in passenger railway transportation
- Discrete optimization in public rail transport
- A constraint-based interactive train rescheduling tool
Cited In (16)
- Real-time freight locomotive rescheduling and uncovered train detection during disruption
- The dispatching problem on multitrack territories: heuristic approaches based on mixed integer linear programming
- Accelerating logic-based benders decomposition for railway rescheduling by exploiting similarities in delays
- A decision making procedure for robust train rescheduling based on mixed integer linear programming and data envelopment analysis
- A formulation of MIP train rescheduling at terminals in bidirectional double-track lines with a moving block and ATO
- MILP formulations of cumulative constraints for railway scheduling -- a comparative study
- A constraint-based interactive train rescheduling tool
- Application of an iterative framework for real-time railway rescheduling
- An iterative approach for reducing the impact of infrastructure maintenance on the performance of railway systems
- Applying local rescheduling in response to schedule disruptions
- Rescheduling rail networks with maintenance disruptions using problem space search
- SAPI: statistical analysis of propagation of incidents. A new approach for rescheduling trains after disruptions
- Using a general-purpose mixed-integer linear programming solver for the practical solution of real-time train rescheduling
- A double-track train rescheduling for incident conditions: optimisation model and decomposition method
- Review of real-time vehicle schedule recovery methods in transportation services
- Adjusting a railway timetable in case of partial or complete blockades
This page was built for publication: A MIP-based local search method for the railway rescheduling problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3076018)
