The multi-depot vehicle routing problem with inter-depot routes

The multi-depot vehicle routing problem with inter-depot routes (MDVRPI) is an extension to the classical Vehicle Routing Problem (VRP); it is the major research topics in the supply chain management field. It is an extension of the multi-depot vehicle routing problem in which vehicles may be replenished at intermediate depots along their route. In this paper, we propose a heuristic combining the adaptative memory principle, a tabu search method for the solution of subproblems, and integer programming. Tests are conducted on randomly generated instances. The experiment indicates the validity of the technique to MDVRPI with the above-mentioned conditions.

[1]  Yves Rochat,et al.  Probabilistic diversification and intensification in local search for vehicle routing , 1995, J. Heuristics.

[2]  M. G. Speranza,et al.  The vehicle routing problem with capacity 2 and 3, general distances and multiple customer visits , 2001 .

[3]  Bruce L. Golden,et al.  A new heuristic for the multi-depot vehicle routing problem that improves upon best-known solutions , 1993 .

[4]  G. Laporte,et al.  A tabu search heuristic for periodic and multi-depot vehicle routing problems , 1997, Networks.

[5]  Clara Simón de Blas,et al.  Vehicle routing problem with time windows and intermediate facilities , 2003 .

[6]  Alan Mercer,et al.  A tabu search algorithm for the multi-trip vehicle routing and scheduling problem , 1997, Eur. J. Oper. Res..

[7]  K. Fagerholt.  Designing optimal routes in a liner shipping problem , 2004 .

[8]  Maria Grazia Speranza,et al.  The periodic vehicle routing problem with intermediate facilities , 2002, Eur. J. Oper. Res..

[9]  G. Dueck.  New optimization heuristics , 1993 .

[10]  Gilbert Laporte,et al.  A unified tabu search heuristic for vehicle routing problems with time windows , 2001, J. Oper. Res. Soc..

[11]  Ismail Karaoglan,et al.  A branch-and-cut algorithm for the vehicle routing problem with multiple use of vehicles , 2015 .

[12]  Gilbert Laporte,et al.  Solving a Family of Multi-Depot Vehicle Routing and Location-Routing Problems , 1988, Transp. Sci..

[13]  Gilbert Laporte,et al.  A Tabu Search Heuristic for the Vehicle Routing Problem , 1991 .

[14]  F. A. Tillman,et al.  An Upperbound Algorithm for the Single and Multiple Terminal Delivery Problem , 1972 .

[15]  Anthony Wren,et al.  Computer Scheduling of Vehicles from One or More Depots to a Number of Delivery Points , 1972 .

[16]  Tong Zhen,et al.  A Hybrid Intelligent Algorithm for the Vehicle Routing with Time Windows , 2008, ICIC.

[17]  Shen Lin.  Computer solutions of the traveling salesman problem , 1965 .

[18]  Gilbert Laporte,et al.  A tabu search heuristic for the multi-depot vehicle routing problem , 1996, Comput. Oper. Res..

[19]  F. A. Tillman,et al.  A study of a look-ahead procedure for solving the multiterminal delivery problem , 1971 .

[20]  Michel Gendreau,et al.  Vehicle Routeing with Multiple Use of Vehicles , 1996 .

[21]  Thomas L. Magnanti,et al.  Implementing vehicle routing algorithms , 1977, Networks.

[22]  Tong Zhen,et al.  Hybrid Ant Colony Algorithm for the Vehicle Routing with Time Windows , 2008, 2008 ISECS International Colloquium on Computing, Communication, Control, and Management.

[23]  Suprayogi,et al.  33)Ship routing design for the oily liquid waste collection , 2001 .

[24]  B. Gillett,et al.  Multi-terminal vehicle-dispatch algorithm , 1976 .

[25]  Maria Grazia Speranza,et al.  The application of a vehicle routing model to a waste-collection problem: two case studies , 2002, J. Oper. Res. Soc..

[26]  F. Tillman.  The Multiple Terminal Delivery Problem with Probabilistic Demands , 1969 .

[27]  Ole M. Raft.  A modular algorithm for an extended vehicle scheduling problem , 1982 .

[28]  William C. Jordan.  Truck backhauling on networks with many terminals , 1987 .

[29]  Gilbert Laporte,et al.  An Improved Petal Heuristic for the Vehicle Routeing Problem , 1996 .

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

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

[32]  Zne-Jung Lee,et al.  Improving Ant Colony Optimization Algorithms for Solving Traveling Salesman Problems , 2007, J. Adv. Comput. Intell. Intell. Informatics.

[33]  Alan Mercer,et al.  The multi-trip vehicle routing problem , 1998, J. Oper. Res. Soc..

[34]  Chinyao Low,et al.  Heuristic solutions to multi-depot location-routing problems , 2002, Comput. Oper. Res..

[35]  Michel Gendreau,et al.  IN THE VEHICLE ROUTING PROBLEM , 2002 .

[36]  William C. Jordan,et al.  Truck backhauling on two terminal networks , 1984 .

[37]  Michel Gendreau,et al.  A guide to vehicle routing heuristics , 2002, J. Oper. Res. Soc..