Accelerating logic-based benders decomposition for railway rescheduling by exploiting similarities in delays

DOI10.1016/J.COR.2022.106075MaRDI QIDQ2108176zbMATH OpenOpenAlexFDO

Authors Florin Leutwiler, Guillem Bonet Filella, Francesco Corman

Publication date 19 December 2022

Published in Computers \& Operations Research (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1016/j.cor.2022.106075

zbMATH Keywords

similarityreschedulingbenders decompositionprecomputation

Mathematics Subject Classification ID

Operations research and management science (90Bxx)

Recommendations

• A MIP-based local search method for the railway rescheduling problem
• An exact decomposition approach for the real-time train dispatching problem
• A double-track train rescheduling for incident conditions: optimisation model and decomposition method
• Using a general-purpose mixed-integer linear programming solver for the practical solution of real-time train rescheduling
• SAPI: statistical analysis of propagation of incidents. A new approach for rescheduling trains after disruptions

Cites work

• A Tutorial on Satisfiability Modulo Theories
• A branch and bound algorithm for scheduling trains in a railway network
• A column generation approach to train timetabling on a corridor
• A logic-based Benders decomposition for microscopic railway timetable planning
• A machine program for theorem-proving
• A model predictive control approach for discrete-time rescheduling in complex central railway station areas
• A variable neighbourhood search for fast train scheduling and routing during disturbed railway traffic situations
• An exact decomposition approach for the real-time train dispatching problem
• Application of an iterative framework for real-time railway rescheduling
• Disjunctive programming: Properties of the convex hull of feasible points
• Dispatching and coordination in multi-area railway traffic management
• Efficient Generation of Unsatisfiability Proofs and Cores in SAT
• GRASP: a search algorithm for propositional satisfiability
• Job-shop scheduling with blocking and no-wait constraints

Cited in

(2)

• Set covering heuristics in a benders decomposition for railway timetabling
• Efficient iterative optimization to real-time train regulation in urban rail transit networks combined with benders decomposition method

Describes a project that uses

Uses Software

• Gurobi

This page was built for publication: Accelerating logic-based benders decomposition for railway rescheduling by exploiting similarities in delays

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2108176)