The split delivery vehicle scheduling problem with time windows and grid network distances

Abstract We consider an extension of the Split Delivery Vehicle Routing Problem, whereby customers may have a time window for their delivery. A construction heuristic is developed which uses a look-ahead approach to solve the Split Delivery Vehicle Scheduling Problem with Time Windows. Two improvement heuristics are also described: one attempts to move customers between routes, while the other exchanges customers between routes. All three heuristics are implemented on a specifically developed data set and on some standard problems from the literature. Our heuristic implementations also consider the possibility of multiple time windows, grid network distances, non-linear delivery time functions and bounds on the size of any split deliveries.

[1]  Moshe Dror,et al.  Savings by Split Delivery Routing , 1989, Transp. Sci..

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

[3]  Marius Mihai Solomon,et al.  VEHICLE ROUTING AND SCHEDULING WITH TIME WINDOW CONSTRAINTS: MODELS AND ALGORITHMS (HEURISTICS) , 1984 .

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

[5]  Warren B. Powell,et al.  An Optimization-Based Heuristic for Vehicle Routing and Scheduling with Soft Time Window Constraints , 1992, Transp. Sci..

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

[7]  Billy E. Gillett,et al.  A Heuristic Algorithm for the Vehicle-Dispatch Problem , 1974, Oper. Res..

[8]  J. Mulvey,et al.  Solving capacitated clustering problems , 1984 .

[9]  W B Powell,et al.  APPLICATION OF OPTIMIZATION BASED MODELS ON VEHICLE ROUTING AND SCHEDULING PROBLEMS WITH TIME WINDOW CONSTRAINTS , 1990 .

[10]  Nicos Christofides,et al.  Distribution management : mathematical modelling and practical analysis , 1971 .

[11]  Bruce L. Golden,et al.  VEHICLE ROUTING: METHODS AND STUDIES , 1988 .

[12]  Jan Karel Lenstra,et al.  A classification scheme for vehicle routing and scheduling problems , 1990 .

[13]  H. Van Landeghem,et al.  A bi-criteria heuristic for the vehicle routing problem with time windows , 1988 .

[14]  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 .

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

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

[17]  M. Dror,et al.  Split delivery routing , 1990 .

[18]  B. Sh. Mordukhovich,et al.  Optimization and approximation of differential inclusions , 1988 .

[19]  Alexander H. G. Rinnooy Kan,et al.  Bounds and Heuristics for Capacitated Routing Problems , 1985, Math. Oper. Res..

[20]  Methods and Studies , 1945 .

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

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

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

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

[25]  C. D. J. Waters,et al.  Expert Systems for Vehicle Scheduling , 1990 .