Skip to main content

Algorithms for Solving the Vehicle Routing Problem with Drones

  • Conference paper
  • First Online:

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 10751))

Abstract

The Vehicle Routing Problem (VRP) and its variants are well-studied problems in Operations Research. They are related to many real-world applications. Recently, several companies like Amazon, UPS, and Deutsche Post AG showed interest in the integration of autonomous drones in delivery of parcels. This motivates researchers to extend the classical VRP to the Vehicle Routing Problem with Drones (VRPD), where a drone works in tandem with a vehicle to reduce delivery times. In this paper, we focus on solving the VRPD. In particular, we introduce two heuristic algorithms for solving this problem and, through numerical experiments on large-scale instances, we evaluate the performance of the heuristics and show the potential benefit that can be expected when using drones.

This is a preview of subscription content, log in via an institution.

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   84.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Notes

  1. 1.

    https://www.iwr.uni-heidelberg.de/groups/comopt/software/TSPLIB95/.

References

  1. Gendreau, M., Potvin, J.-Y.: Handbook of Metaheuristics. Springer, Heidelberg (2010). https://doi.org/10.1007/978-1-4419-1665-5

    Book  MATH  Google Scholar 

  2. Ha, Q.M., Deville, Y., Pham, Q.D., Ha, M.H.: Heuristic methods for the traveling salesman problem with drone, pp. 1–13. Technical report, CTEAM/INGI/EPL (2015)

    Google Scholar 

  3. Jiang, X., Zhou, Q., Ye, Y.: Method of task assignment for UAV based on particle swarm optimization in logistics. In: Proceedings of the 2017 International Conference on Intelligent Systems, Metaheuristics & Swarm Intelligence - ISMSI 2017, pp. 113–117. ACM Press (2017)

    Google Scholar 

  4. Mathew, N., Smith, S.L., Waslander, S.L.: Planning paths for package delivery in heterogeneous multirobot teams. IEEE Trans. Autom. Sci. Eng. 12(4), 1298–1308 (2015)

    Article  Google Scholar 

  5. Mourelo, F.S., Harbison, T., Weber, T., Sturges, R., Rich, R.: Optimization of a truck-drone in tandem delivery network using k-means and genetic algorithm. J. Ind. Eng. Manag. 9(2), 374–388 (2016)

    Google Scholar 

  6. Murray, C.C., Chu, A.G.: The flying sidekick traveling salesman problem: optimization of drone-assisted parcel delivery. Transp. Res. Part C: Emerg. Technol. 54, 86–109 (2015)

    Article  Google Scholar 

  7. Poikonen, S., Wang, X., Golden, B.: The vehicle routing problem with drones: extended models and connections. Networks 70(1), 34–43 (2017)

    Article  MathSciNet  MATH  Google Scholar 

  8. Solomon, M.M.: Algorithms for the vehicle routing and scheduling problems with time window constraints. Oper. Res. 35(2), 254–265 (1987)

    Article  MathSciNet  MATH  Google Scholar 

  9. Toth, P., Vigo, D.: The Vehicle Routing Problem. Society for Industrial and Applied Mathematics, Philadelphia (2002)

    Book  MATH  Google Scholar 

  10. Ulmer, M., Barrett, W.T.: Same-day delivery with a heterogeneous fleet of drones and vehicles. Technical report, pp. 1–30 (2017)

    Google Scholar 

  11. van Breedam, A.: An analysis of the behavior of heuristics for the vehicle routing problem for a selection of problems with vehicle-related, customer-related, and time-related constraints contents. Ph.D. dissertation, University of Antwerp (1994)

    Google Scholar 

  12. Wang, X., Poikonen, S., Golden, B.: The vehicle routing problem with drones: several worst-case results. Optim. Lett. 11(4), 679–697 (2016)

    Article  MathSciNet  MATH  Google Scholar 

Download references

Acknowledgements

The authors acknowledge the chair of Business Information Systems and Operations Research (BISOR) at the TU-Kaiserslautern (Germany) for the financial support, through the research program “CoVaCo”.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Mahdi Moeini .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2018 Springer International Publishing AG, part of Springer Nature

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Schermer, D., Moeini, M., Wendt, O. (2018). Algorithms for Solving the Vehicle Routing Problem with Drones. In: Nguyen, N., Hoang, D., Hong, TP., Pham, H., Trawiński, B. (eds) Intelligent Information and Database Systems. ACIIDS 2018. Lecture Notes in Computer Science(), vol 10751. Springer, Cham. https://doi.org/10.1007/978-3-319-75417-8_33

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-75417-8_33

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-75416-1

  • Online ISBN: 978-3-319-75417-8

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics