The vehicle routing problem with coupled time windows

In this article we introduce the vehicle routing problem with coupled time windows (VRPCTW), which is an extension of the vehicle routing problem with time windows (VRPTW), where additional coupling constraints on the time windows are imposed. VRPCTW is applied to model a real-world planning problem concerning the integrated optimization of school starting times and public bus services. A mixed-integer programming formulation for the VRPCTW within this context is given. It is solved using a new meta-heuristic that combines classical construction aspects with mixed-integer preprocessing techniques, and improving hit-and-run, a randomized search strategy from global optimization. Solutions for several randomly generated and real-world instances are presented.

[1]  Jean-François Cordeau,et al.  VRP with Time Windows , 1999, The Vehicle Routing Problem.

[2]  Armin Fügenschuh,et al.  Integrated Optimization of School Starting Times and Public Bus Services , 2004, OR.

[3]  R. Sivanandan,et al.  A linear programming approach for synthesizing origin-destination trip tables from link traffic volumes , 1994 .

[4]  Paolo Toth,et al.  The Vehicle Routing Problem , 2002, SIAM monographs on discrete mathematics and applications.

[5]  Jacques Desrosiers,et al.  VRP with Pickup and Delivery , 2000, The Vehicle Routing Problem.

[6]  Robert L. Smith,et al.  Improving Hit-and-Run for global optimization , 1993, J. Glob. Optim..

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

[8]  Michael R. Bussieck,et al.  Discrete optimization in public rail transport , 1997, Math. Program..

[9]  Malachy Carey,et al.  A Method for Direct Estimation of Origin/Destination Trip Matrices , 1981 .

[10]  T. J. Gaskell,et al.  Bases for Vehicle Fleet Scheduling , 1967 .

[11]  David Simchi-Levi,et al.  A computerized approach to the New York City school bus routing problem , 1997 .

[12]  Lawrence Bodin,et al.  Routing and Scheduling of School Buses by Computer , 1979 .

[13]  Nico M. van Dijk,et al.  Cost optimal allocation of rail passenger lines , 1998, Eur. J. Oper. Res..

[14]  Ángel Corberán,et al.  Heuristic solutions to the problem of routing school buses with multiple objectives , 2002, J. Oper. Res. Soc..

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

[16]  P. C. Yellow,et al.  A Computational Modification to the Savings Method of Vehicle Scheduling , 1970 .

[17]  Jeffrey C. Lagarias The Computational Complexity of Simultaneous Diophantine Approximation Problems , 1985, SIAM J. Comput..

[18]  George B. Dantzig,et al.  The Truck Dispatching Problem , 1959 .

[19]  Gilbert Laporte,et al.  Classical Heuristics for the Capacitated VRP , 2002, The Vehicle Routing Problem.

[20]  Zelda B. Zabinsky,et al.  Stochastic Adaptive Search for Global Optimization , 2003 .

[21]  Paul H. Calamai,et al.  A multi-objective optimization approach to urban school bus routing: Formulation and solution method , 1995 .

[22]  Informationstechnik Berlin,et al.  A Path-Based Model for Line Planning in Public Transport , 2005 .

[23]  G. Clarke,et al.  Scheduling of Vehicles from a Central Depot to a Number of Delivery Points , 1964 .

[24]  Martin Grötschel,et al.  Duty Scheduling in Public Transit , 2003 .

[25]  Dror Rawitz,et al.  Efficient Algorithms for Integer Programs with Two Variables per Constraint1 , 2001, Algorithmica.

[26]  P. Kreuzer,et al.  Optimal lines for railway systems , 1997 .

[27]  Michael G.H. Bell,et al.  The Estimation of an Origin-Destination Matrix from Traffic Counts , 1983 .