The Period Vehicle Routing Problem with Service Choice
Authors:
- 1 November 2006
- journal article
- Published by Institute for Operations Research and the Management Sciences (INFORMS) in Transportation Science
- Vol. 40 (4) , 439-454
Abstract
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.Keywords
This publication has 22 references indexed in Scilit:
- A Lagrangian relaxation approach to multi-period inventory/distribution planningJournal of the Operational Research Society, 2000
- An improved heuristic for the period vehicle routing problemNetworks, 1995
- Chapter 4 Analysis of vehicle routing and inventory-routing problems1995
- A multiphase approach to the period routing problemNetworks, 1991
- The period routing problemNetworks, 1984
- A heuristic algorithm for the period vehicle routing problemOmega, 1984
- Complexity of vehicle routing and scheduling problemsNetworks, 1981
- A generalized assignment heuristic for vehicle routingNetworks, 1981
- An assignment routing problemNetworks, 1979
- Networks and vehicle routing for municipal waste collectionNetworks, 1974