An optimized multi objective simulated annealing approach for efficient drone based product delivery

Abstract 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.

Authors

Institutions

Publication Details

Journal
Discover Computing
Published
2026-11-14
DOI
https://doi.org/10.1007/s10791-026-10846-y
Primary Topic
Vehicle Routing Optimization Methods
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
NOV
article

An optimized multi objective simulated annealing approach for efficient drone based product delivery

Hamish A. Campbell, Nur Mohammad Fahad, Mohaimenul Azam Khan Raiaan, Sheikh Izzal Azid et al.
Discover Computing
Vehicle Routing Optimization Methods
article

An optimized multi objective simulated annealing approach for efficient drone based product delivery

Hamish A. Campbell, Nur Mohammad Fahad, Mohaimenul Azam Khan Raiaan, Sheikh Izzal Azid, Debopom Sutradhar, Wasimul Karim, Sami Azam
article en

Abstract

Abstract 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.

Discover ComputingVol. 29(1)
Murdoch University (AU), Charles Darwin University (AU), Monash University (AU), United International University (BD)
Vehicle Routing Optimization Methods
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Laika access coming soon