Akademik Veri Yönetim Sistemi
INTERNATIONAL JOURNAL OF INDUSTRIAL ENGINEERING COMPUTATIONS, cilt.17, sa.1, ss.317-336, 2026 (SCI-Expanded, Scopus)
This study addresses the drone delivery problem with a unique focus on minimizing total customer waiting times, considering the heterogeneous nature of drones and the setup times required for loading customer demands. Unlike traditional routing problems that prioritize cost and route optimization, this research emphasizes timely deliveries, which are critical in both commercial and humanitarian applications. The study introduces two mathematical models and four versions of the coot optimization algorithm, including three modified variants and one classical version. These algorithms incorporate new movement mechanisms, enhanced leader selection strategies, and adaptations of the regenerating strategy to efficiently solve the drone delivery problem. Computational experiments reveal that one modified coot optimization algorithm significantly outperforms the classical version, offering valuable insights into both coot optimization literature and the drone delivery problem. By emphasizing the importance of timely deliveries, this research provides effective solution strategies applicable to both commercial and humanitarian contexts.