Parking buses in a depot using block patterns: a Benders decomposition approach for minimizing type mismatches

DOI10.1016/j.cor.2006.02.002zbMath1278.90078OpenAlexW2063042933MaRDI QIDQ883301

Guy Desaulniers, Mohamed Hamdouni, François Soumis

Publication date: 4 June 2007

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

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

zbMATH Keywords

mathematical modelingBenders decompositionbus parkingpublic transittype mismatch

Mathematics Subject Classification ID

Traffic problems in operations research (90B20) Decomposition methods (49M27)

Related Items (4)

Parking buses in a depot with stochastic arrival times ⋮ On the online track assignment problem ⋮ Track assignment ⋮ Integrating rolling stock scheduling with train unit shunting

Cites Work

• A modification of Benders' decomposition algorithm for discrete subproblems: An approach for stochastic programs with integer recourse
• Partitioning procedures for solving mixed-variables programming problems
• Scheduling trams in the morning
• Real-time dispatch of trams in storage yards
• A computational study of Benders decomposition for the integrated aircraft routing and crew scheduling problem
• A Benders Decomposition Approach for the Locomotive and Car Assignment Problem
• Multicommodity Distribution System Design by Benders Decomposition
• Dispatching Buses in Parking Depots

This page was built for publication: Parking buses in a depot using block patterns: a Benders decomposition approach for minimizing type mismatches