Separating valid odd-cycle and odd-set inequalities for the multiple depot vehicle scheduling problem

Abstract

We consider the multicommodity network flow formulation of the multiple depot vehicle scheduling problem (MDVSP) and investigate several strategies within a branch-and-cut framework for solving the MDVSP. In particular, we compare subalgorithms for separating the cutting planes introduced by Hadjar et al. (Oper Res 54:130–149, 2006). We also evaluate the effectiveness of a new criterion for fixing some variables in the multicommodity flow formulation. Finally, we present computational experiments to illustrate the strengths and weaknesses of the strategies.

Keywords

• Transportation scheduling
• Multicommodity flow
• Branch-and-cut algorithm