Using a general-purpose mixed-integer linear programming solver for the practical solution of real-time train rescheduling

DOI10.1016/j.ejor.2017.04.057zbMath1380.90115OpenAlexW2610956397MaRDI QIDQ1695036

Matteo Fischetti, Michele Monaci

Publication date: 6 February 2018

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: http://hdl.handle.net/11585/603035

zbMATH Keywords

combinatorial optimizationmixed-integer linear programmingreal-time optimizationtrain reschedulingrailways optimization

Mathematics Subject Classification ID

Mixed integer programming (90C11) Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27) Software, source code, etc. for problems pertaining to operations research and mathematical programming (90-04)

Related Items (7)

Effective train routing selection for real-time traffic management: improved model and ACO parallel computing ⋮ Performance evaluation of a parallel ant colony optimization for the real-time train routing selection problem in large instances ⋮ Set covering heuristics in a benders decomposition for railway timetabling ⋮ Capturing complexity over space and time via deep learning: an application to real-time delay prediction in railways ⋮ A Noncompact Formulation for Job-Shop Scheduling Problems in Traffic Management ⋮ Timetable coordination in a rail transit network with time-dependent passenger demand ⋮ A novel mixed integer programming model for freight train travel time estimation

Cites Work

• Job-shop scheduling with blocking and no-wait constraints
• A branch and bound algorithm for scheduling trains in a railway network
• On handling indicator constraints in mixed integer programming
• Optimal Real-Time Traffic Control in Metro Stations
• An Exact Decomposition Approach for the Real-Time Train Dispatching Problem
• Modeling and Solving the Train Timetabling Problem
• Exploiting Erraticism in Search
• Machine Sequencing Via Disjunctive Graphs: An Implicit Enumeration Algorithm

This page was built for publication: Using a general-purpose mixed-integer linear programming solver for the practical solution of real-time train rescheduling