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, Marcotte, and Soumis in "A Branch-and-Cut Algorithm for the Multiple Depot Vehicle Scheduling Problem" (Operations Research 54, pp. 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.
Published December 2012 , 27 pages
This cahier was revised in April 2013