A Benders decomposition algorithm for demand-driven metro scheduling

DOI10.1016/j.cor.2021.105598OpenAlexW3212053983MaRDI QIDQ2669703

Ola Jabali, Tommaso Schettini, Federico Malucelli

Publication date: 9 March 2022

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

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

zbMATH Keywords

Benders decompositionshort-turningdemand-drivenmetro scheduling

Mathematics Subject Classification ID

Operations research and management science (90Bxx)

Related Items

Collaborative optimization of last-train timetables for metro network to increase service time for passengers

Uses Software

• JuMP
• GitHub

Cites Work

• A short-turning policy for the management of demand disruptions in rapid transit systems
• A column generation approach to train timetabling on a corridor
• Computing delay resistant railway timetables
• The Benders decomposition algorithm: a literature review
• A genetic algorithm approach to periodic railway synchronization
• Exact formulations and algorithm for the train timetabling problem with dynamic demand
• A review of urban transportation network design problems
• An interior-point Benders based branch-and-cut algorithm for mixed integer programs
• Modeling and Solving the Train Timetabling Problem
• Accelerating Benders Decomposition: Algorithmic Enhancement and Model Selection Criteria
• Implementing Automatic Benders Decomposition in a Modern MIP Solver
• JuMP: A Modeling Language for Mathematical Optimization