Single vehicle routing with a predefined customer sequence and multiple depot returns

Abstract The optimal routing of a single vehicle with limited capacity that delivers one product to n clients according to a predefined client sequence can be determined using dynamic programming. In the present paper we propose and investigate three practical variations of this problem: (i) the case of multiple-product deliveries when each product is stored in its own compartment in the vehicle, (ii) the case of multiple-product deliveries when all products are stored together in the vehicle’s single compartment, and (iii) the case in which the vehicle picks up from and delivers a single product to each customer. Suitable dynamic programming algorithms that find the optimal routing of the vehicle are developed for each case. The efficiency of the algorithms is studied by solving large problem sets.

[1]  David Simchi-Levi,et al.  The logic of logistics , 1997 .

[2]  Jason D. Papastavrou,et al.  A stochastic and dynamic model for the single-vehicle pick-up and delivery problem , 1999, Eur. J. Oper. Res..

[3]  Said Salhi,et al.  A cluster insertion heuristic for single and multiple depot vehicle routing problems with backhauling , 1999, J. Oper. Res. Soc..

[4]  Bruce L. Golden,et al.  OR Practice - Computerized Vehicle Routing in the Soft Drink Industry , 1987, Oper. Res..

[5]  Yazid Mati,et al.  A tabu search heuristic for the single vehicle pickup and delivery problem with time windows , 2001, J. Intell. Manuf..

[6]  C. D. Gelatt,et al.  Optimization by Simulated Annealing , 1983, Science.

[7]  Mauro Birattari,et al.  Hybrid Metaheuristics for the Vehicle Routing Problem with Stochastic Demands , 2005, J. Math. Model. Algorithms.

[8]  Juan José Salazar González,et al.  A branch-and-cut algorithm for a traveling salesman problem with pickup and delivery , 2004, Discret. Appl. Math..

[9]  David Pisinger,et al.  A unified heuristic for a large class of Vehicle Routing Problems with Backhauls , 2006, Eur. J. Oper. Res..

[10]  Gilbert Laporte,et al.  The vehicle routing problem: An overview of exact and approximate algorithms , 1992 .

[11]  Kamlesh Mathur,et al.  Stochastic Vehicle Routing Problem with Restocking , 2000, Transp. Sci..

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

[13]  Christian Blume,et al.  Computer-integrated manufacturing technology and systems , 1985 .

[14]  V. Cerný.  Thermodynamical approach to the traveling salesman problem: An efficient simulation algorithm , 1985 .

[15]  Saïd Salhi,et al.  Heuristic algorithms for single and multiple depot vehicle routing problems with pickups and deliveries , 2005, Eur. J. Oper. Res..

[16]  Jon Louis Bentley,et al.  Experiments on traveling salesman heuristics , 1990, SODA '90.

[17]  R. Ballou.  Business Logistics Management , 1991 .

[18]  David A. Jackson,et al.  Dynamic programming : a practical introduction , 1992 .

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

[20]  Daniel Granot,et al.  The vehicle routing problem with pickups and deliveries on some special graphs , 2002, Discret. Appl. Math..

[21]  Eugene L. Lawler,et al.  The Traveling Salesman Problem: A Guided Tour of Combinatorial Optimization , 1985 .