A decomposition approach to the integrated vehicle-crew-rostering problem

The problem addressed in this paper is the integrated vehicle-crew-rostering problem (VCRP) aiming to define the schedules for the buses and the rosters for the drivers of a public transit company. The VCRP is described by a bi-objective mixed binary linear programming model with one objective function aggregating vehicle and crew scheduling costs and the other the rostering features. The VCRP is solved by a heuristic approach based on Benders decomposition where the master problem is partitioned into daily integrated vehicle-crew scheduling problems and the sub-problem is a rostering problem. Computational experience with data from a bus company in Lisbon shows the ability of the decomposition approach for producing a variety of potentially efficient solutions for the VCRP within low computing times.

[1]  Ralph E. Steuer.  Multiple criteria optimization , 1986 .

[2]  Marta Mesquita,et al.  Set partitioning/covering-based approaches for the integrated vehicle and crew scheduling problem , 2008, Comput. Oper. Res..

[3]  Jean-François Cordeau,et al.  Benders Decomposition for Simultaneous Aircraft Routing and Crew Scheduling , 2000, Transp. Sci..

[4]  Andreas T. Ernst,et al.  An Integrated Optimization Model for Train Crew Management , 2001, Ann. Oper. Res..

[5]  Marta Mesquita,et al.  Branching approaches for integrated vehicle and crew scheduling , 2009, Public Transp..

[6]  Dennis Huisman,et al.  Multiple-Depot Integrated Vehicle and Crew Scheduling , 2003, Transp. Sci..

[7]  Vittorio Maniezzo,et al.  Benders decomposition, Lagrangean relaxation and metaheuristic design , 2009, J. Heuristics.

[8]  François Soumis,et al.  An integrated aircraft routing, crew scheduling and flight retiming model , 2005, Comput. Oper. Res..

[9]  Peter Deuflhard,et al.  Numerische Mathematik. I , 2002 .

[10]  Fang Lu.  Integrated airline scheduling : models and algorithms , 1997 .

[11]  R. S. Laundy,et al.  Multiple Criteria Optimisation: Theory, Computation and Application , 1989 .

[12]  Xavier Gandibleux,et al.  A survey and annotated bibliography of multiobjective combinatorial optimization , 2000, OR Spectr..

[13]  Chi-Kang Lee,et al.  SCHEDULING OF TRAIN DRIVER FOR TAIWAN RAILWAY ADMINISTRATION , 2003 .

[14]  Mathias Stolpe,et al.  Generalized Benders’ Decomposition for topology optimization problems , 2011, J. Glob. Optim..

[15]  Jacques F. Benders,et al.  Partitioning procedures for solving mixed-variables programming problems , 2005, Comput. Manag. Sci..

[16]  Sydney C. K. Chu,et al.  Generating, scheduling and rostering of shift crew-duties: Applications at the Hong Kong International Airport , 2007, Eur. J. Oper. Res..

[17]  Marta Mesquita,et al.  Solving Public Transit Scheduling Problems , 2008 .

[18]  Jean-François Cordeau,et al.  A computational study of Benders decomposition for the integrated aircraft routing and crew scheduling problem , 2003, Comput. Oper. Res..

[19]  Paolo Toth,et al.  A Global Method for Crew Planning in Railway Applications , 2001 .

[20]  M. A. Forbes,et al.  Vehicle routing and crew scheduling for metropolitan mail distribution at Australia Post , 2006, Eur. J. Oper. Res..

[21]  A. M. Geoffrion.  Generalized Benders decomposition , 1972 .

[22]  Albert P. M. Wagelmans,et al.  A Decision Support System for Crew Planning in Passenger Transportation Using a Flexible Branch-and-Price Algorithm , 2004, Ann. Oper. Res..