Advertisement

The Traveling Salesman Drone Station Location Problem

  • Daniel SchermerEmail author
  • Mahdi Moeini
  • Oliver Wendt
Conference paper
Part of the Advances in Intelligent Systems and Computing book series (AISC, volume 991)

Abstract

In this paper, we introduce the Traveling Salesman Drone Station Location Problem (TSDSLP). The TSDSLP exhibits features of the Traveling Salesman, Facility Location, and Parallel Machine Scheduling problems. More precisely, given a truck located at a central depot, a multitude of possible drone stations, and a set of customer locations, the TSDSLP seeks for a feasible routing of the truck and drone operations such that all requests are fulfilled, no more than a given number of drone stations is used, and the makespan (or operational cost) is minimized. We formulate the TSDSLP as a Mixed Integer Linear Program (MILP) and use the state-of-the-art solver Gurobi to obtain solutions for small- and medium-sized instances. Through our numerical results, we show that the utilization of drone stations might reduce the makespan significantly.

Keywords

Traveling salesman problem Drone station Drones Last-mile delivery Logistics 

References

  1. 1.
    Agatz, N., Bouman, P., Schmidt, M.: Optimization approaches for the traveling salesman problem with drone. Transp. Sci. 52(4), 965–981 (2018)CrossRefGoogle Scholar
  2. 2.
    Chauhan, D., Unnikrishnan, A., Figliozzi, M.: Maximum coverage capacitated facility location problem with range constrained drones. Transp. Res. Part C: Emerg. Technol. 1–18 (2019)CrossRefGoogle Scholar
  3. 3.
    Dorling, K., Heinrichs, J., Messier, G.G., Magierowski, S.: Vehicle routing problems for drone delivery. IEEE Trans. Syst. Man Cybern. Syst. 47(1), 70–85 (2017)CrossRefGoogle Scholar
  4. 4.
    Kim, S., Moon, I.: Traveling salesman problem with a drone station. IEEE Trans. Syst. Man Cybern. Syst. 49(1), 42–52 (2018)CrossRefGoogle Scholar
  5. 5.
    Miller, C.E., Tucker, A.W., Zemlin, R.A.: Integer programming formulation of traveling salesman problems. J. ACM 7(4), 326–329 (1960)MathSciNetCrossRefGoogle Scholar
  6. 6.
    Min, H., Jayaraman, V., Srivastava, R.: Combined location-routing problems: a synthesis and future research directions. Eur. J. Oper. Res. 108(1), 1–15 (1998)CrossRefGoogle Scholar
  7. 7.
    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)CrossRefGoogle Scholar
  8. 8.
    Nagy, G., Salhi, S.: Location-routing: issues, models and methods. Eur. J. Oper. Res. 177(2), 649–672 (2006)MathSciNetCrossRefGoogle Scholar
  9. 9.
    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)MathSciNetCrossRefGoogle Scholar
  10. 10.
    Schermer, D., Moeini, M., Wendt, O.: Algorithms for solving the vehicle routing problem with drones. In: LNCS, vol. 10751, pp. 352–361 (2018)Google Scholar
  11. 11.
    Schermer, D., Moeini, M., Wendt, O.: A variable neighborhood search algorithm for solving the vehicle routing problem with drones (Technical report), pp. 1–33. BISOR, Technische Universität Kaiserslautern (2018)Google Scholar
  12. 12.
    Schermer, D., Moeini, M., Wendt, O.: A hybrid VNS/Tabu search algorithm for solving the vehicle routing problem with drones and en route operations. Comput. Oper. Res. 109, 134–158 (2019).  https://doi.org/10.1016/j.cor.2019.04.021MathSciNetCrossRefGoogle Scholar
  13. 13.
    Schermer, D., Moeini, M., Wendt, O.: A matheuristic for the vehicle routing problem with drones and its variants (Technical report), pp. 1–37. BISOR, Technische Universität Kaiserslautern (2019)Google Scholar
  14. 14.
    Schermer, D., Moeini, M., Wendt, O.: Instances for the traveling salesman drone station location problem (TSDSLP) (2019).  https://doi.org/10.5281/zenodo.2594795
  15. 15.
    Wang, X., Poikonen, S., Golden, B.: The vehicle routing problem with drones: several worst-case results. Optim. Lett. 11(4), 679–697 (2016)MathSciNetCrossRefGoogle Scholar

Copyright information

© Springer Nature Switzerland AG 2020

Authors and Affiliations

  1. 1.Chair of Business Information Systems and Operations Research (BISOR)Technische Universität KaiserslauternKaiserslauternGermany

Personalised recommendations