Accelerating logic-based benders decomposition for railway rescheduling by exploiting similarities in delays
From MaRDI portal
Publication:2108176
DOI10.1016/j.cor.2022.106075OpenAlexW4308559055MaRDI QIDQ2108176
Francesco Corman, Florin Leutwiler, Guillem Bonet Filella
Publication date: 19 December 2022
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2022.106075
Uses Software
Cites Work
- A column generation approach to train timetabling on a corridor
- Disjunctive programming: Properties of the convex hull of feasible points
- Application of an iterative framework for real-time railway rescheduling
- A variable neighbourhood search for fast train scheduling and routing during disturbed railway traffic situations
- A model predictive control approach for discrete-time rescheduling in complex central railway station areas
- Job-shop scheduling with blocking and no-wait constraints
- A logic-based Benders decomposition for microscopic railway timetable planning
- Dispatching and coordination in multi-area railway traffic management
- A branch and bound algorithm for scheduling trains in a railway network
- An Exact Decomposition Approach for the Real-Time Train Dispatching Problem
- GRASP: a search algorithm for propositional satisfiability
- A Tutorial on Satisfiability Modulo Theories
- Efficient Generation of Unsatisfiability Proofs and Cores in SAT
- A machine program for theorem-proving
