GRASP Method for Vehicle Routing with Delivery Place Selection
- 358 Downloads
In this paper we present a greedy randomized adaptive search procedure (GRASP) for solving a vehicle routing problem (VRP) for package delivery with delivery place selection. The problem can be solved by stepwise optimization, i.e., first selecting delivery sites and then defining routes based on that selection. Alternatively, it can be solved by jointly optimizing delivery site selection and routing. We investigate the effects of stepwise optimization in comparison to joint optimization. The evaluation results show that our proposed stepwise approach, while expectedly producing longer routes than joint approach (by \(4\%\) on average), can provide a solution \(1000\times \) faster than the previous benchmark approach. The proposed procedure is therefore well suited for the dynamic environment of package delivery which is widespread in modern cities as a consequence of e-commerce.
KeywordsGreedy randomized adaptive search procedure Vehicle routing problem Package delivery
This research has been partly supported by the European Regional Development Fund under the grant KK.01.1.1.01.0009 (DATACROSS).
The authors acknowledge the support of the Croatian Science Foundation through the Reliable Composite Applications Based on Web Services (IP-01-2018-6423) research project.
The Titan X Pascal used for this research was donated by the NVIDIA Corporation.
- 2.Toth, P., Vigo, D.: An overview of vehicle routing problems, pp. 1–26 (2001)Google Scholar