Advertisement

GRASP Method for Vehicle Routing with Delivery Place Selection

Conference paper
  • 358 Downloads
Part of the Lecture Notes in Computer Science book series (LNCS, volume 11516)

Abstract

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.

Keywords

Greedy randomized adaptive search procedure Vehicle routing problem Package delivery 

Notes

Acknowledgment

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.

References

  1. 1.
    Schittekat, P., Kinable, J., Sörensen, K., Sevaux, M., Spieksma, F., Springael, J.: A metaheuristic for the school bus routing problem with bus stop selection. Eur. J. Oper. Res. 229(2), 518–528 (2013)CrossRefGoogle Scholar
  2. 2.
    Toth, P., Vigo, D.: An overview of vehicle routing problems, pp. 1–26 (2001)Google Scholar
  3. 3.
    Archetti, C., Speranza, M.G.: A survey on matheuristics for routing problems. EURO J. Comput. Optim. 2(4), 223–246 (2014)CrossRefGoogle Scholar
  4. 4.
    Laporte, G., Nobert, Y., Taillefer, S.: Solving a family of multi-depot vehicle routing and location-routing problems. Transp. Sci. 22(3), 161–172 (1988)MathSciNetCrossRefGoogle Scholar
  5. 5.
    Feo, T.A., Resende, M.G.C.: Greedy randomized adaptive search procedures. J. Glob. Optim. 6(2), 109–133 (1995).  https://doi.org/10.1007/BF01096763MathSciNetCrossRefzbMATHGoogle Scholar
  6. 6.
    Park, J., Kim, B.I.: The school bus routing problem: a review. Eur. J. Oper. Res. 202(2), 311–319 (2010)MathSciNetCrossRefGoogle Scholar

Copyright information

© Springer Nature Switzerland AG 2019

Authors and Affiliations

  1. 1.Faculty of Electrical Engineering and ComputingUniversity of ZagrebZagrebCroatia

Personalised recommendations