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

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.

[1]  Alan A. Bertossi,et al.  On some matching problems arising in vehicle scheduling models , 1987, Networks.

[2]  Laurence A. Wolsey,et al.  Integer and Combinatorial Optimization , 1988, Wiley interscience series in discrete mathematics and optimization.

[3]  Matteo Fischetti,et al.  A Polyhedral Approach to Simplified Crew Scheduling and Vehicle Scheduling Problems , 2001, Manag. Sci..

[4]  Jacques Desrosiers,et al.  Stabilized column generation for highly degenerate multiple-depot vehicle scheduling problems , 2004, Comput. Oper. Res..

[5]  Matteo Fischetti,et al.  A Branch-and-Cut Algorithm for the Multiple Depot Vehicle Scheduling Problem , 2001 .

[6]  Pierre Hansen,et al.  Stabilized column generation , 1998, Discret. Math..

[7]  R. Kraut,et al.  Vehicle scheduling in public transit and Lagrangean pricing , 1998 .

[8]  L. Bianco,et al.  A set partitioning approach to the multiple depot vehicle scheduling problem , 1994 .

[9]  A. Löbel.  Optimale Vehicle Scheduling in Public Transit , 1997 .

[10]  G. Nemhauser,et al.  A Strong Cutting Plane/Branch-and-Bound Algorithm for Node Packing , 1992 .

[11]  Jorge J. Moré,et al.  Digital Object Identifier (DOI) 10.1007/s101070100263 , 2001 .

[12]  Jacques Desrosiers,et al.  Time Constrained Routing and Scheduling , 1992 .

[13]  Lawrence Bodin,et al.  UCOST: A MICRO APPROACH TO A TRANSPORTATION PLANNING PROBLEM , 1978 .

[14]  Jacques Desrosiers,et al.  Chapter 2 Time constrained routing and scheduling , 1995 .

[15]  Stefan Irnich,et al.  Path-Reduced Costs for Eliminating Arcs in Routing and Scheduling , 2010, INFORMS J. Comput..

[16]  François Soumis,et al.  A Branch-and-Cut Algorithm for the Multiple Depot Vehicle Scheduling Problem , 2001, Oper. Res..

[17]  Guy Desaulniers,et al.  Chapter 2 Public Transit , 2007, Transportation.

[18]  J. Edmonds,et al.  Facets of I-matching polyhedra , 1974 .

[19]  Boulevard Lavoisier.  Iterated Local Search for the Multiple Depot Vehicle Scheduling Problem , 2008 .

[20]  Leena Suhl,et al.  Solving large multiple-depot multiple-vehicle-type bus scheduling problems in practice , 2005, OR Spectr..

[21]  Leena Suhl,et al.  A time-space network based exact optimization model for multi-depot bus scheduling , 2006, Eur. J. Oper. Res..

[22]  Laurence A. Wolsey,et al.  Integer and Combinatorial Optimization , 1988 .

[23]  Dennis Huisman,et al.  A comparison of five heuristics for the multiple depot vehicle scheduling problem , 2009, J. Sched..

[24]  Matteo Fischetti,et al.  {0, 1/2}-Chvátal-Gomory cuts , 1996, Math. Program..

[25]  M. R. Rao,et al.  Odd Minimum Cut-Sets and b-Matchings , 1982, Math. Oper. Res..

[26]  Celso C. Ribeiro,et al.  A Column Generation Approach to the Multiple-Depot Vehicle Scheduling Problem , 1991, Oper. Res..

[27]  Dennis Huisman,et al.  Comparison of heuristic approaches for the multiple depot vehicle scheduling problem , 2006 .