The Period Vehicle Routing Problem with Service Choice

The period vehicle routing problem (PVRP) is a variation of the classic vehicle routing problem in which delivery routes are constructed for a period of time (for example, multiple days). In this paper, we consider a variation of the PVRP in which service frequency is a decision of the model. We refer to this problem as the PVRP with service choice (PVRP-SC). We explore modeling issues that arise when service choice is introduced, and suggest efficient solution methods. Contributions are made both in modeling this new variation of the PVRP and in introducing an exact solution method for the PVRP-SC. In addition, we propose a heuristic variation of the exact method to be used for larger problem instances. Computational tests show that adding service choice can improve system efficiency and customer service. We also present general insights on the impact of node distribution on the value of service choice.

[1]  Moshe Dror,et al.  A Decomposition Approach to the Inventory Routing Problem with Satellite Facilities , 1998, Transp. Sci..

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

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

[4]  Lap Mui Ann Chan,et al.  Probabilistic Analyses and Practical Algorithms for Inventory-Routing Models , 1998, Oper. Res..

[5]  Marshall L. Fisher,et al.  The Lagrangian Relaxation Method for Solving Integer Programming Problems , 2004, Manag. Sci..

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

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

[8]  Yun-Hi Kim,et al.  A Lagrangian relaxation approach to multi-period inventory/distribution planning , 2000, J. Oper. Res. Soc..

[9]  Marshall L. Fisher,et al.  A Periodic Inventory Routing Problem at a Supermarket Chain , 2004, Oper. Res..

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

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

[12]  Michel Gendreau,et al.  Traveling Salesman Problems with Profits , 2005, Transp. Sci..

[13]  A. Federgruen,et al.  Rejoinder to “Comments on one-warehouse multiple retailer systems with vehicle routing costs” , 1991 .

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

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

[16]  Marshall L. Fisher,et al.  An Applications Oriented Guide to Lagrangian Relaxation , 1985 .

[17]  Awi Federgruen,et al.  One warehouse multiple retailer systems with vehicle routing costs , 1990 .

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

[19]  Martin W. P. Savelsbergh,et al.  The Stochastic Inventory Routing Problem with Direct Deliveries , 2002, Transp. Sci..

[20]  David Simchi-Levi,et al.  Analysis of vehicle routing and inventory-routing problems , 1995 .

[21]  Shoshana Anily,et al.  Vehicle Routing and the Supply Chain , 1999 .

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

[23]  Philip M. Kaminsky,et al.  Third Party Logistics Planning with Routing and Inventory Costs , 2005 .

[24]  J. K. Lenstra,et al.  Complexity of vehicle routing and scheduling problems , 1981, Networks.