Document Open Access Logo

Parameterized Algorithms for the Drone Delivery Problem

Authors Simon Bartlmae , Andreas Hene , Joshua Könen , Heiko Röglin

PDF

File

Thumbnail PDF
PDF
LIPIcs.ISAAC.2025.8.pdf
  • Filesize: 0.95 MB
  • 16 pages

Document Identifiers

Subject Classification

ACM Subject Classification
  • Theory of computation → Fixed parameter tractability
  • Theory of computation → Graph algorithms analysis
Keywords
  • Complexity
  • Delivery
  • FPT algorithms
  • Graph Theory

Metrics

  • Access Statistics
  • Total Accesses (updated on a weekly basis)
    0
    PDF Downloads
    0
    Metadata Views

Abstract

Timely delivery and optimal routing remain fundamental challenges in the modern logistics industry. Building on prior work that considers single-package delivery across networks using multiple types of collaborative agents with restricted movement areas (e.g., drones or trucks), we examine the complexity of the problem under structural and operational constraints. Our focus is on minimizing total delivery time by coordinating agents that differ in speed and movement range across a graph. This problem formulation aligns with the recently proposed Drone Delivery Problem with respect to delivery time (DDT), introduced by Erlebach et al. [ISAAC 2022]. 
We first resolve an open question posed by Erlebach et al. [ISAAC 2022] by showing that even when the delivery network is a path graph, DDT admits no polynomial-time approximation within any polynomially encodable factor a(n), unless P=NP. Additionally, we identify the intersection graph of the agents, where nodes represent agents and edges indicate an overlap of the movement areas of two agents, as an important structural concept. For path graphs, we show that DDT becomes tractable when parameterized by the treewidth w of the intersection graph, and we present an exact FPT algorithm with running time f(w)⋅poly(n,k), for some computable function f. For general graphs, we give an FPT algorithm with running time f(Δ,w)⋅poly(n,k), where Δ is the maximum degree of the intersection graph. In the special case where the intersection graph is a tree, we provide a simple polynomial-time algorithm.

Cite As Get BibTex

Simon Bartlmae, Andreas Hene, Joshua Könen, and Heiko Röglin. Parameterized Algorithms for the Drone Delivery Problem. In 36th International Symposium on Algorithms and Computation (ISAAC 2025). Leibniz International Proceedings in Informatics (LIPIcs), Volume 359, pp. 8:1-8:16, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2025) https://doi.org/10.4230/LIPIcs.ISAAC.2025.8

Author Details

Simon Bartlmae
  • University of Copenhagen, Denmark
  • Institute of Computer Science, University of Bonn, Germany
Andreas Hene
  • Institute of Computer Science, University of Bonn, Germany
Joshua Könen
  • Institute of Computer Science, University of Bonn, Germany
Heiko Röglin
  • Institute of Computer Science, University of Bonn, Germany

References

  1. Stefan Arnborg, Derek G Corneil, and Andrzej Proskurowski. Complexity of Finding Embeddings in a k-Tree. SIAM Journal on Algebraic Discrete Methods, 8(2):277-284, 1987. URL: https://doi.org/10.1137/0608024.
  2. Dane Bamburry. Drones: Designed for Product Delivery. Design Management Review, 26(1):40-48, 2015. URL: https://doi.org/10.1111/drev.10313.
  3. Simon Bartlmae, Andreas Hene, and Kelin Luo. On the Hardness of the Drone Delivery Problem. In Irene Finocchi and Loukas Georgiadis, editors, Algorithms and Complexity - 14th International Conference, CIAC 2025, Rome, Italy, June 10-12, 2025, Proceedings, Part II, volume 15680 of Lecture Notes in Computer Science, pages 200-215. Springer, 2025. URL: https://doi.org/10.1007/978-3-031-92935-9_13.
  4. Andreas Bärtschi, Daniel Graf, and Matús Mihalák. Collective Fast Delivery by Energy-Efficient Agents. In Igor Potapov, Paul G. Spirakis, and James Worrell, editors, 43rd International Symposium on Mathematical Foundations of Computer Science, MFCS 2018, volume 117 of LIPIcs, pages 56:1-56:16. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2018. URL: https://doi.org/10.4230/LIPICS.MFCS.2018.56.
  5. Lotte Blank, Kien C. Huynh, Kelin Luo, and Anurag Murty Naredla. Algorithms for the Collaborative Delivery Problem with Monitored Constraints. In Shin-ichi Nakano and Mingyu Xiao, editors, WALCOM: Algorithms and Computation - 19th International Conference and Workshops on Algorithms and Computation, WALCOM 2025, Chengdu, China, February 28 - March 2, 2025, Proceedings, volume 15411 of Lecture Notes in Computer Science, pages 62-78. Springer, 2025. URL: https://doi.org/10.1007/978-981-96-2845-2_5.
  6. Hans L. Bodlaender. A linear time algorithm for finding tree-decompositions of small treewidth. In S. Rao Kosaraju, David S. Johnson, and Alok Aggarwal, editors, Proceedings of the Twenty-Fifth Annual ACM Symposium on Theory of Computing, May 16-18, 1993, San Diego, CA, USA, pages 226-234. ACM, 1993. URL: https://doi.org/10.1145/167088.167161.
  7. Heleen Buldeo Rai, Sara Verlinde, and Cathy Macharis. Unlocking the failed delivery problem? Opportunities and challenges for smart locks from a consumer perspective. Research in Transportation Economics, 87:100753, 2021. E-groceries, digitalization and sustainability. URL: https://doi.org/10.1016/j.retrec.2019.100753.
  8. Iago A. Carvalho, Thomas Erlebach, and Kleitos Papadopoulos. On the fast delivery problem with one or two packages. Journal of Computer and System Sciences, 115:246-263, 2021. URL: https://doi.org/10.1016/J.JCSS.2020.09.002.
  9. Marek Cygan, Fedor V. Fomin, Lukasz Kowalik, Daniel Lokshtanov, Dániel Marx, Marcin Pilipczuk, Michal Pilipczuk, and Saket Saurabh. Parameterized Algorithms. Springer, 2015. URL: https://doi.org/10.1007/978-3-319-21275-3.
  10. Mo ElSayed, Ahmed Foda, and Moataz Mohamed. The impact of civil airspace policies on the viability of adopting autonomous unmanned aerial vehicles in last-mile applications. Transport Policy, 145:37-54, 2024. URL: https://doi.org/10.1016/j.tranpol.2023.10.002.
  11. Thomas Erlebach, Kelin Luo, and Frits C. R. Spieksma. Package Delivery Using Drones with Restricted Movement Areas. In Sang Won Bae and Heejin Park, editors, 33rd International Symposium on Algorithms and Computation, ISAAC 2022, December 19-21, 2022, Seoul, Korea, volume 248 of LIPIcs, pages 49:1-49:16. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2022. URL: https://doi.org/10.4230/LIPICS.ISAAC.2022.49.
  12. M. R. Garey and David S. Johnson. Complexity Results for Multiprocessor Scheduling under Resource Constraints. SIAM J. Comput., 4(4):397-411, 1975. URL: https://doi.org/10.1137/0204035.
  13. Anne Goodchild and Jordan Toy. Delivery by drone: An evaluation of unmanned aerial vehicle technology in reducing CO2 emissions in the delivery service industry. Transportation Research Part D: Transport and Environment, 61:58-67, 2018. Innovative Approaches to Improve the Environmental Performance of Supply Chains and Freight Transportation Systems. URL: https://doi.org/10.1016/j.trd.2017.02.017.
  14. Heather Hulett, Todd G. Will, and Gerhard J. Woeginger. Multigraph realizations of degree sequences: Maximization is easy, minimization is hard. Oper. Res. Lett., 36(5):594-596, 2008. URL: https://doi.org/10.1016/J.ORL.2008.05.004.
  15. Cornelis Lekkeikerker and Johan Boland. Representation of a finite graph by a set of intervals on the real line. Fundamenta Mathematicae, 51(1):45-64, 1962. Google Scholar
  16. Kelin Luo, Chenran Yang, Zonghan Yang, and Yuhao Zhang. The subinterval cover problem. In Vincent Chau, Christoph Dürr, Minming Li, and Pinyan Lu, editors, Frontiers of Algorithmics - 19th International Joint Conference, IJTCS-FAW 2025, Paris, France, June 30 - July 2, 2025, Proceedings, volume 15828 of Lecture Notes in Computer Science, pages 152-165. Springer, 2025. URL: https://doi.org/10.1007/978-981-96-8312-3_12.
  17. Almodather Mohamed and Moataz Mohamed. Unmanned Aerial Vehicles in Last-Mile Parcel Delivery: A State-of-the-Art Review. Drones, 9(6), 2025. URL: https://doi.org/10.3390/drones9060413.
  18. Neil Robertson and Paul D. Seymour. Graph Minors. II. Algorithmic Aspects of Tree-Width. J. Algorithms, 7(3):309-322, 1986. URL: https://doi.org/10.1016/0196-6774(86)90023-4.
  19. Donald J. Rose, Robert Endre Tarjan, and George S. Lueker. Algorithmic Aspects of Vertex Elimination on Graphs. SIAM J. Comput., 5(2):266-283, 1976. URL: https://doi.org/10.1137/0205021.
  20. Sartaj Sahni. Algorithms for Scheduling Independent Tasks. J. ACM, 23(1):116-127, 1976. URL: https://doi.org/10.1145/321921.321934.
  21. Frank Schroth. IBM granted patent for package transfer between drones. https://dronelife.com/2017/04/30/ibm-granted-patent-package-transfer-drones/, 2017. [Accessed 23-06-2025].
Any Issues?
X

Feedback on the Current Page

CAPTCHA

Thanks for your feedback!

Feedback submitted to Dagstuhl Publishing

Could not send message

Please try again later or send an E-mail
© 2023-2025 Schloss Dagstuhl – LZI GmbH About DROPS Imprint Privacy Contact