A New Optimization Algorithm for the Vehicle Routing Problem with Time Windows

The vehicle routing problem with time windows VRPTW is a generalization of the vehicle routing problem where the service of a customer can begin within the time window defined by the earliest and the latest times when the customer will permit the start of service. In this paper, we present the development of a new optimization algorithm for its solution. The LP relaxation of the set partitioning formulation of the VRPTW is solved by column generation. Feasible columns are added as needed by solving a shortest path problem with time windows and capacity constraints using dynamic programming. The LP solution obtained generally provides an excellent lower bound that is used in a branch-and-bound algorithm to solve the integer set partitioning formulation. Our results indicate that this algorithm proved to be successful on a variety of practical sized benchmark VRPTW test problems. The algorithm was capable of optimally solving 100-customer problems. This problem size is six times larger than any reported to date by other published research.

[1]  Ward Whitt,et al.  An Interpolation Approximation for the Mean Workload in a GI/G/1 Queue , 1989, Oper. Res..

[2]  J. Desrosiers,et al.  Plus court chemin avec contraintes d'horaires , 1983 .

[3]  G. Laporte,et al.  Exact Algorithms for the Vehicle Routing Problem , 1987 .

[4]  Samuel J. Raff,et al.  Routing and scheduling of vehicles and crews : The state of the art , 1983, Comput. Oper. Res..

[5]  Edward G. Coffman,et al.  Diffusion Approximations for Computer/Communications Systems , 1983, Computer Performance and Reliability.

[6]  Jacques Desrosiers,et al.  Routing with time windows by column generation , 1983, Networks.

[7]  Roy E. Marsten,et al.  The Design of the XMP Linear Programming Library , 1981, TOMS.

[8]  Marius M. Solomon,et al.  Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints , 1987, Oper. Res..

[9]  M. Desrochers,et al.  A Generalized Permanent Labelling Algorithm For The Shortest Path Problem With Time Windows , 1988 .

[10]  Martin I. Reiman,et al.  An Interpolation Approximation for Queueing Systems with Poisson Input , 1988, Oper. Res..

[11]  Thomas L. Magnanti,et al.  Combinatorial optimization and vehicle fleet planning: Perspectives and prospects , 1981, Networks.

[12]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[13]  Martin I. Reiman,et al.  Open Queueing Systems in Light Traffic , 1989, Math. Oper. Res..

[14]  J. Harrison,et al.  Reflected Brownian Motion in an Orthant: Numerical Methods for Steady-State Analysis , 1992 .

[15]  Jacques Desrosiers,et al.  The Pickup and Delivery Problem with Time Windows , 1989 .

[16]  Burton Simon.  A New Estimator of Sensitivity Measures for Simulations Based on Light Traffic Theory , 1989, INFORMS J. Comput..

[17]  H. Psaraftis.  An Exact Algorithm for the Single Vehicle Many-to-Many Dial-A-Ride Problem with Time Windows , 1983 .

[18]  Alexander H. G. Rinnooy Kan,et al.  Vehicle Routing with Time Windows , 1987, Oper. Res..

[19]  Jacques Desrosiers,et al.  A Dynamic Programming Solution of the Large-Scale Single-Vehicle Dial-A-Ride Problem with Time Windows , 1984 .

[20]  Martin I. Reiman,et al.  A network of priority queues in heavy traffic: One bottleneck station , 1990, Queueing Syst. Theory Appl..

[21]  Jacques Desrosiers,et al.  Survey Paper - Time Window Constrained Routing and Scheduling Problems , 1988, Transp. Sci..

[22]  Paolo Toth,et al.  Exact algorithms for the vehicle routing problem, based on spanning tree and shortest path relaxations , 1981, Math. Program..

[23]  J. Desrosiers,et al.  Lagrangian relaxation methods for solving the minimum fleet size multiple traveling salesman problem with time windows , 1988 .

[24]  Martin W. P. Savelsbergh,et al.  Local search in routing problems with time windows , 1984 .

[25]  P. J. Fleming,et al.  An approximate analysis of sojourn times in the M/G/1 queue with round-robin service discipline , 1984, AT&T Bell Laboratories Technical Journal.

[26]  M M Solomon,et al.  VEHICLE ROUTING AND SCHEDULING PROBLEMS WITH TIME WINDOW CONSTRAINTS: EFFICIENT IMPLEMENTATIONS OF SOLUTION IMPROVEMENT PROCEDURES , 1988 .

[27]  Paolo Toth,et al.  State-space relaxation procedures for the computation of bounds to routing problems , 1981, Networks.

[28]  Mwp Martin Savelsbergh,et al.  VEHICLE ROUTING WITH TIME WINDOWS: OPTIMIZATION AND APPROXIMATION. VEHICLE ROUTING: METHOD AND STUDIES. STUDIES IN MANAGEMENT SCIENCE AND SYSTEMS - VOLUME 16 , 1987 .

[29]  D. Burman,et al.  Asymptotic analysis of a queueing model with bursty traffic , 1983, The Bell System Technical Journal.

[30]  M. Desrochers,et al.  A reoptimization algorithm for the shortest path problem with time windows , 1988 .