Papers › Communication-aware Drone Delivery Problem
Communication-aware Drone Delivery Problem
Cihan Tugrul Cicek, Çağrı Koç, Hakan Gultekin, Güneş Erdoğan
The archive published only this paper's code-link row. Authors, date and abstract are from arXiv's metadata (CC0), read from the Kaggle arXiv metadata snapshot of 2026-09-12 where its title matched the archive's; the title is the archive's.
The drone delivery problem (DDP) has been introduced to include aerial vehicles in last-mile delivery operations to increase efficiency. However, the existing studies have not incorporated the communication quality requirements of such a delivery operation. This study introduces the Communication-aware DDP (C-DDP), which incorporates handover and outage constraints. In particular, any trip of a drone to deliver a customer package must require less than a certain number of handover operations and cannot exceed a predefined outage duration threshold. The authors develop a Mixed Integer Programming (MIP) model to minimize the total flight distance while satisfying communication constraints as well as the time windows of customers. We present a Genetic Algorithm (GA) that can solve large instances, and compare its performance with an off-the-shelf MIP solver. Computational results show that the GA can outperform the MIP solver for solving larger instances and is a better option.
Code
Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.
Code Syntology ran Syntology
Not run by Syntology. Nothing on this page verifies that the listed code works.
Results from the paper archive 2025-07-28
No leaderboard rows for this paper in the archive.
Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections