Skip to main content

A Genetic Algorithm for Solving the Truck-Drone-ATV Routing Problem

  • Conference paper
  • First Online:
Optimization of Complex Systems: Theory, Models, Algorithms and Applications (WCGO 2019)

Abstract

In this paper, we introduce and investigate a new style of delivery in last-mile logistics, in which we merge the existing concept of conventional truck-based delivery with emerging technologies, i.e., drones and autonomous robots (autonomous transport vehicles (ATVs)). More precisely, in the Truck-Drone-ATV Routing Problem (TDA-RP), a truck, carrying several drones and ATVs as well as the parcels, departs from a depot, visits a given list of grid points, each of them at most once, and returns to the depot by the end of the mission. In addition, at each visited grid point, a set of drones and ATVs are tasked to deliver the parcels to the customers via circumjacent operations. The objective consists in serving all customers in shortest possible time. However, due to the computational complexity of the problem, we cannot solve it by exact methods. Hence, we suggest a Genetic Algorithm for solving the problem and, through our computational experiments on randomly generated instances, we show the benefits of using a mixed fleet of drones and ATVs assisting a truck.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 129.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 169.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

Institutional subscriptions

Notes

  1. 1.

    A TSP route might be then polished to include only a subset of all grid points. However, it is ensured that the limited range of the ATVs as well as drones are respected and all customers can be reached from at least on grid point.

References

  1. Bouman, P., Agatz, N., Schmidt, M.: Dynamic programming approaches for the traveling salesman problem with drone. Networks 72(4), 528–542 (2018)

    Google Scholar 

  2. Boysen, N., Schwerdfeger, S., Weidinger, F.: Scheduling last-mile deliveries with truck-based autonomous robots. Eur. J. Oper. Res. 271(3), 1085–1099 (2018)

    Google Scholar 

  3. Carlsson, J.G., Song, S.: Coordinated logistics with a truck and a drone. Manag. Sci. 64(9), 4052–4069 (2018)

    Google Scholar 

  4. Coffman, E., Garey, M., Johnson, D.: An application of bin-packing to multiprocessor scheduling. SIAM J. Comput. 7(1), 1–17 (1978)

    Google Scholar 

  5. Deutsche Post DHL Group: DHL Parcelcopter. Press Kit. https://www.dpdhl.com/en/media-relations/specials/dhl-parcelcopter.html (2019)

  6. Reeves, C.R.: Genetic algorithms. In: Gendreau, M., Potvin, J.-Y. (eds.) Handbook of Metaheuristics, pp. 109–139. Springer, New York (2010). https://doi.org/10.1007/978-1-4419-1665-5_5

  7. Ha, Q.M., Deville, Y., Pham, Q.D., Hà, M.H.: On the min-cost traveling salesman problem with drone. Transp. Res. Part C 86, 597–621 (2018)

    Google Scholar 

  8. Lin, S., Kernighan, B.W.: An effective heuristic algorithm for the traveling-salesman problem. Oper. Res. 21(2), 498–516 (1973)

    Google Scholar 

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

    Google Scholar 

  10. Otto, A., Agatz, N., Campbell, J., Golden, B., Pesch, E.: Optimization approaches for civil applications of unmanned aerial vehicles (UAVs) or aerial drones: a survey. Networks 72(4), 411–458 (2018)

    Google Scholar 

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

    Google Scholar 

  12. Salewski, H., Moeini, M.: Instances for the truck-drone-ATV routing problem. https://doi.org/10.5281/zenodo.2600809

  13. Schermer, D., Moeini, M., Wendt, O.: Algorithms for solving the vehicle routing problem with drones. Lect. Notes Artif. Intell. 10751, 352–361 (2018)

    Google Scholar 

  14. Schermer, D., Moeini, M., Wendt, O.: A Variable Neighborhood Search Algorithm for Solving the Vehicle Routing Problem with Drones, pp. 1–33. Technical Report, Technische Universität Kaiserslautern (2018)

    Google Scholar 

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

    Google Scholar 

Download references

Acknowledgment

The authors would like to acknowledge the Technische Universität Kaiserslautern (Germany) for the financial support through the research program “Forschungsförderung des TU Nachwuchsringes”.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Hagen Salewski .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2020 Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Moeini, M., Salewski, H. (2020). A Genetic Algorithm for Solving the Truck-Drone-ATV Routing Problem. In: Le Thi, H., Le, H., Pham Dinh, T. (eds) Optimization of Complex Systems: Theory, Models, Algorithms and Applications. WCGO 2019. Advances in Intelligent Systems and Computing, vol 991. Springer, Cham. https://doi.org/10.1007/978-3-030-21803-4_101

Download citation

Publish with us

Policies and ethics