The periodic vehicle routing problem with intermediate facilities

Abstract In this paper, we study an extension of the PVRP where the vehicles can renew their capacity at some intermediate facilities. Each vehicle returns to the depot only when its work shift is over. For this problem we propose a tabu search (TS) algorithm and present computational results on a set of randomly generated instances and on a set of PVRP instances taken from the literature.

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

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

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

[4]  Gilbert Laporte,et al.  Routing problems: A bibliography , 1995, Ann. Oper. Res..

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

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

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

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

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

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

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

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

[13]  L. Bodin.  ROUTING AND SCHEDULING OF VEHICLES AND CREWS–THE STATE OF THE ART , 1983 .

[14]  Éric D. Taillard,et al.  Parallel iterative search methods for vehicle routing problems , 1993, Networks.

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

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