Parking buses in a depot using block patterns: a Benders decomposition approach for minimizing type mismatches
From MaRDI portal
Publication:883301
DOI10.1016/J.COR.2006.02.002zbMATH Open1278.90078OpenAlexW2063042933MaRDI QIDQ883301FDOQ883301
Authors: Mohamed Hamdouni, Guy Desaulniers, 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
Recommendations
- Parking buses in a depot with stochastic arrival times
- Dispatching Buses in Parking Depots
- Solving large multiple-depot multiple-vehicle-type bus scheduling problems in practice
- Optimal Trip Assignment To Depots In A Large Inter-City Bus System
- A decomposition approach for the integrated vehicle-crew-roster problem with days-off pattern
Cites Work
- Partitioning procedures for solving mixed-variables programming problems
- A Benders decomposition approach for the locomotive and car assignment problem
- A modification of Benders' decomposition algorithm for discrete subproblems: An approach for stochastic programs with integer recourse
- A computational study of Benders decomposition for the integrated aircraft routing and crew scheduling problem
- Multicommodity Distribution System Design by Benders Decomposition
- Scheduling trams in the morning
- Dispatching Buses in Parking Depots
- Real-time dispatch of trams in storage yards
Cited In (5)
This page was built for publication: Parking buses in a depot using block patterns: a Benders decomposition approach for minimizing type mismatches
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q883301)
