Answers are grounded in this paper and cite their sources.
Drone technology has revolutionized e-commerce and logistics by enabling cost-effective product delivery and increased revenue. Optimizing drone scheduling and routing is challenging as delivery locations increase and the solution space expands. The primary objective is to jointly optimize delivery scheduling and routing by proposing a Multi-Objective Simulated Annealing (MO-SA) approach that satisfies payload capacity and battery life constraints while using customer priority and delivery deadlines as urgency-based sequencing criteria. This research introduces a new scheduling and routing method by modifying a simulated annealing (SA) algorithm to optimize delivery sequences and routes. The method combines local search with the K-Nearest Neighbors (KNN) algorithm to generate initial neighbor sequences, refined by the SA process using Boltzmann distribution for acceptance probabilities. Across three 100-customer benchmark instances, MO-SA reduced mean delivery distance by 28.14–54.85% relative to the four evaluated baselines, with a mean runtime of 6.16 seconds on R101. Further experiments demonstrate reduced travel distances under weight constraints, a higher number of deliveries within the assumed battery threshold than the compared methods, and priority-based sequencing. A post-hoc graph-theoretic check confirms no customer duplication, consistent with Hamiltonian and Eulerian properties at the customer-sequence level. Overall, the proposed approach offers a constraint-aware solution with promising results at the tested problem scale, indicating potential for last-mile drone delivery applications pending explicit arrival-time modeling, scalability, and real-world validation.
No takes yet. Share an insight, caveat, or question.
Sutradhar et al. (2026) studied this question.
Synapse has enriched 8 closely related papers on similar clinical questions. Consider them for comparative context: