A variable neighborhood search heuristic for periodic routing problems

The aim of this paper is to propose a new heuristic for the Periodic Vehicle Routing Problem (PVRP) without time windows. The PVRP extends the classical Vehicle Routing Problem (VRP) to a planning horizon of several days. Each customer requires a certain number of visits within this time horizon while there is some flexibility on the exact days of the visits. Hence, one has to choose the visit days for each customer and to solve a VRP for each day. Our method is based on Variable Neighborhood Search (VNS). Computational results are presented, that show that our approach is competitive and even outperforms existing solution procedures proposed in the literature. Also considered is the special case of a single vehicle, i.e. the Periodic Traveling Salesman Problem (PTSP). It is shown that slight changes of the proposed VNS procedure is also competitive for the PTSP.

[1]  Richard F. Hartl,et al.  Scheduling periodic customer visits for a traveling salesperson , 2007, Eur. J. Oper. Res..

[2]  Pierre Hansen,et al.  Variable Neighborhood Search: A Chapter of Handbook of Applied Optimization , 2000 .

[3]  Luca Bertazzi,et al.  An improved heuristic for the period traveling salesman problem , 2004, Computers & Operations Research.

[4]  J. K. Lenstra,et al.  Local Search in Combinatorial Optimisation. , 1997 .

[5]  Joaquín A. Pacheco,et al.  Optimizing the periodic pick-up of raw materials for a manufacturer of auto parts , 2007, Eur. J. Oper. Res..

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

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

[8]  Giuseppe Paletta,et al.  A multiperiod traveling salesman problem: Heuristic algorithms , 1992, Comput. Oper. Res..

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

[10]  P. Hansen,et al.  Variable neighborhood search for the p-median , 1997 .

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

[12]  Giuseppe Paletta,et al.  The period traveling salesman problem: a new heuristic algorithm , 2002, Comput. Oper. Res..

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

[14]  Bruce L. Golden,et al.  A new heuristic for the period traveling salesman problem , 1995, Comput. Oper. Res..

[15]  Pierre Hansen,et al.  Les Cahiers Du Gerad Variable Neighborhood Search Methods , 1999 .

[16]  Olli Bräysy,et al.  A Reactive Variable Neighborhood Search for the Vehicle-Routing Problem with Time Windows , 2003, INFORMS J. Comput..

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

[18]  R. Russell,et al.  An assignment routing problem , 1979, Networks.

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

[20]  Pierre Hansen,et al.  Variable neighborhood search: Principles and applications , 1998, Eur. J. Oper. Res..

[21]  Karl F. Doerner.  Delivery Strategies for Periodic Blood Products Supplies , 2005 .

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

[23]  Richard F. Hartl,et al.  A Variable Neighborhood Search for the Multi Depot Vehicle Routing Problem with Time Windows , 2004, J. Heuristics.

[24]  Lawrence Bodin,et al.  Networks and vehicle routing for municipal waste collection , 1974, Networks.

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

[26]  Jack J. Dongarra,et al.  Performance of various computers using standard linear equations software in a FORTRAN environment , 1988, CARN.

[27]  John E. Beasley,et al.  A heuristic algorithm for the period vehicle routing problem , 1984 .

[28]  Martin W. P. Savelsbergh,et al.  Delivery strategies for blood products supplies , 2009, OR Spectr..

[29]  Bruce L. Golden,et al.  An improved heuristic for the period vehicle routing problem , 1995, Networks.

[30]  Wei-Tzen Yang,et al.  A heuristic algorithm for the multi-depot periodic vehicle routing problem , 2000 .

[31]  Dalessandro Soares Vianna,et al.  An asynchronous parallel metaheuristic for the period vehicle routing problem , 2001, Future Gener. Comput. Syst..

[32]  Giuseppe Paletta,et al.  A Heuristic for the Periodic Vehicle Routing Problem , 1992, Transp. Sci..

[33]  Pierre Hansen,et al.  Variable Neighborhood Search , 2018, Handbook of Heuristics.

[34]  Roberto Baldacci,et al.  A multi-depot period vehicle routing problem arising in the utilities sector , 1998, J. Oper. Res. Soc..

[35]  Buyang Cao,et al.  Special Issue: 2002 Franz Edelman Award for Achievement in Operations Research and the Management Sciences: Optimizing Periodic Maintenance Operations for Schindler Elevator Corporation , 2003, Interfaces.

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

[37]  G. Croes.  A Method for Solving Traveling-Salesman Problems , 1958 .

[38]  Robert A. Russell,et al.  A multiphase approach to the period routing problem , 1991, Networks.

[39]  Panos M. Pardalos,et al.  Handbook of applied optimization , 2002 .

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

[41]  Alex Van Breedam,et al.  An analysis of the behavior of heuristics for the vehicle routing problem for a selection of problems with vehicle-relatezd, customer-related, and time-related constraints , 1994 .