Solving a vehicle-routing problem arising in soft-drink distribution

The problem studied in this article arises from the distribution of soft drinks and collection of recyclable containers in a Quebec-based company. It can be modelled as a variant of the vehicle routing problem with a heterogeneous vehicle fleet, time windows, capacity and volume constraints, and an objective function combining routing costs and the revenue resulting from the sale of recyclable material. Three construction heuristics and an improvement procedure are developed for the problem. Comparative tests are performed on a real-life instance and on 10 randomly generated instances.

[1]  Christos D. Tarantilis,et al.  A meta-heuristic algorithm for the efficient distribution of perishable foods , 2001 .

[2]  Gilbert Laporte,et al.  Improvements and extensions to the Miller-Tucker-Zemlin subtour elimination constraints , 1991, Oper. Res. Lett..

[3]  Ibrahim H. Osman,et al.  Metastrategy simulated annealing and tabu search algorithms for the vehicle routing problem , 1993, Ann. Oper. Res..

[4]  R. A. Zemlin,et al.  Integer Programming Formulation of Traveling Salesman Problems , 1960, JACM.

[5]  Christos D. Tarantilis,et al.  A threshold accepting metaheuristic for the heterogeneous fixed fleet vehicle routing problem , 2004, Eur. J. Oper. Res..

[6]  Michel Gendreau,et al.  A tabu search heuristic for periodic and multi-depot vehicle routing problems , 1997, Networks.

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

[8]  Jiefeng Xu,et al.  Solving An Integrated Logistics Problem Arising In Grocery Distribution , 1996 .

[9]  Brian Kallehauge,et al.  The Vehicle Routing Problem with Time Windows , 2006, Vehicle Routing.

[10]  Bruce L. Golden,et al.  Routing Vehicles in the Real World: Applications in the Solid Waste, Beverage, Food, Dairy, and Newspaper Industries , 2002, The Vehicle Routing Problem.

[11]  Vladimir Vacic,et al.  VEHICLE ROUTING PROBLEM WITH TIME WINDOWS , 2014 .

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

[13]  Fred Glover,et al.  Extensions of the Petal Method for Vehicle Routeing , 1993 .

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

[15]  Charlotte Diane Jacobs.  The vehicle routing problem with backhauls , 1987 .