A Benders decomposition algorithm for demand-driven metro scheduling

DOI10.1016/J.COR.2021.105598MaRDI QIDQ2669703zbMATH OpenOpenAlexFDO

Authors Tommaso Schettini, Ola Jabali, 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 decompositiondemand-drivenmetro schedulingshort-turning

Mathematics Subject Classification ID

Operations research and management science (90Bxx)

Recommendations

• Exact formulations and algorithm for the train timetabling problem with dynamic demand
• Periodic metro scheduling
• The demand-dependent optimization of regular train timetables
• Generation of optimal schedules for metro lines using model predictive control
• Optimal real-time traffic control in metro stations

Cites work

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

Cited in

(2)

• Exact formulations and algorithm for the train timetabling problem with dynamic demand
• Collaborative optimization of last-train timetables for metro network to increase service time for passengers

Describes a project that uses

Uses Software

• JuMP
• GitHub

This page was built for publication: A Benders decomposition algorithm for demand-driven metro scheduling

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