Hybrid Heuristics for the Vehicle Routing Problem with Time Windows

This paper addresses the development of effective heuristics for solving the vehicle routing and scheduling problem with time window constraints. Both tour construction and local search tour improvement heuristics are developed. A major premise of the paper is that embedding global tour improvement procedures within the tour construction process can lead to improved solutions. Computational results are reported on test problems from the literature as well as real world applications. The hybrid construction/improvement heuristic is more effective in reducing vehicle fleet size requirements than previously reported heuristics.

[1]  Jean-Yves Potvin,et al.  A parallel route building algorithm for the vehicle routing and scheduling problem with time windows , 1993 .

[2]  Edward K. Baker,et al.  Solution Improvement Heuristics for the Vehicle Routing and Scheduling Problem with Time Window Constraints , 1986 .

[3]  Marshall L. Fisher,et al.  A generalized assignment heuristic for vehicle routing , 1981, Networks.

[4]  Gilbert Laporte,et al.  New Insertion and Postoptimization Procedures for the Traveling Salesman Problem , 1992, Oper. Res..

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

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

[7]  Nicos Christofides,et al.  The period routing problem , 1984, Networks.

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

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

[10]  Paul M. Thompson,et al.  Cyclic Transfer Algorithm for Multivehicle Routing and Scheduling Problems , 1993, Oper. Res..

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

[12]  Brian W. Kernighan,et al.  An Effective Heuristic Algorithm for the Traveling-Salesman Problem , 1973, Oper. Res..

[13]  Martin Desrochers,et al.  A New Optimization Algorithm for the Vehicle Routing Problem with Time Windows , 1990, Oper. Res..