Skip to content
Open access

An Adaptive Sliding-Window Ant Colony Optimization Approach for Multi-UAV Delivery Routing with Safety and Lateness Objectives

Jul 2026 · Algorithms · 0 citations

TL;DR

Simulation experiments demonstrate that SW-MSACO achieves improved Pareto solution quality and search stability compared with existing heuristic optimization approaches, particularly under large-scale and high-load scenarios, confirming the effectiveness of the proposed framework for complex UAV logistics optimization.

Abstract

Urban unmanned aerial vehicle (UAV) logistics systems require routing algorithms that can balance delivery efficiency and operational safety under complex physical and environmental constraints. However, existing multi-objective routing methods often show limited adaptability when the search landscape changes during optimization. In particular, conventional ant colony optimization (ACO) algorithms usually rely on fixed pheromone update rules, which may lead to premature convergence, uneven Pareto front distributions, and pheromone-induced search stagnation. To address these limitations, this paper proposes a Sliding-Window Adaptive Multi-Strategy Ant Colony Optimization (SW-MSACO) framework for complex urban UAV delivery routing. First, a Complex Multi-objective Urban Routing Problem (CMURP) is formulated by jointly considering cumulative delivery lateness and safety risk under payload and nonlinear battery energy constraints. Second, a multi-strategy pheromone evolution pool is designed to provide complementary search behaviors for convergence acceleration, safety-efficiency balancing, and Pareto front diversity preservation. Third, a Sliding-Window Adaptive Strategy Selection (SW-ASS) mechanism is introduced to adjust strategy selection probabilities according to recent search performance rather than long-term cumulative rewards. Comprehensive simulation experiments under different map scales and task-load conditions demonstrate that SW-MSACO achieves improved Pareto solution quality and search stability compared with existing heuristic optimization approaches, particularly under large-scale and high-load scenarios, confirming the effectiveness of the proposed framework for complex UAV logistics optimization.

Read PDF

Similar papers

Aug 2026

Dynamic-robustness-oriented hierarchical task planning for UAV swarm based on improved pigeon-inspired optimization

Simulation results show that the proposed hierarchical task planning framework significantly outperforms traditional approaches in efficiency, robustness, and scalability, highlighting its strong potential for UAV swarm mission planning in complex environments.

Yalan Peng, Haibin Duan, Ming Li et al. · 0 citations
Open access Jul 2026

A Multi-Objective Optimization Model for Collaborative UAV–Rider Meal Delivery Routing Using an Enhanced NSGA-II Algorithm

Urban instant-delivery platforms increasingly require efficient, punctual, and low-carbon delivery services. Unmanned aerial vehicles (UAVs) can reduce dependence on congested ground traffic in meal delivery and further improve overall delivery efficiency through coordinated operations with ground riders at rendezvous points. However, existing studies mainly focus on ground-based routing or simplify UAV-assisted delivery as a single-objective problem, limiting their ability to balance cost, completion time, carbon emissions, and service quality. To address this limitation, this paper investigates a collaborative UAV–rider meal delivery routing problem and formulates a multi-objective optimization model integrating restaurant pickup, UAV transfer, rider last-mile delivery, and soft customer time windows. An Enhanced NSGA-II algorithm is then developed, where hybrid initialization improves solution quality and diversity, adaptive operators balance exploration and exploitation, local search refines route structures, structural repair maintains feasibility, and diversity preservation supports a well-distributed Pareto front. Comparative experiments against NSGA-II, MOPSO, NSGA-III, MOEA/D, MODE, and IMODE, together with scalability, ablation, sensitivity, and case analyses, show that E-NSGA-II provides stronger Pareto-front approximation. The results support its use as a decision-support method for service-aware and low-carbon UAV–rider meal delivery, while also revealing additional computational cost.

Shicheng Hu, Yuan Zheng, Jingqi Dai et al. · 0 citations
Open access Jul 2026

A Dynamic Multi-Priority Unmanned Aerial Vehicle Assignment Algorithm Integrating an Improved Discrete Particle Swarm Optimization and Greedy Strategy

To address the fundamental trade-off between real-time responsiveness to high-priority missions and long-term overall economic efficiency of the system in multi-UAV dynamic task assignment, we propose a hybrid intelligent scheduling algorithm abbreviated as DPSO-Greedy. The algorithm performs periodic global batch optimization for regular orders using an improved discrete particle swarm optimization (DPSO) method, and realizes instantaneous allocation of emergency orders via an adaptive multi-factor Greedy strategy, thus enabling efficient collaborative processing of differentiated tasks. Targeting the trade-off between real-time response and long-term system efficiency, this paper proposes a hybrid DPSO-Greedy algorithm with decoupled task scheduling mechanisms. Comparative simulation results demonstrate that compared with mainstream metaheuristic algorithms (Greedy, SSA, GWO and RHS), the proposed method reduces the average response time of emergency orders by 33.2–68.2%, achieves an emergency order completion rate exceeding 90%, and improves system load balancing performance by 24–35% in dynamic scenarios characterized by burst and tidal demands. This study provides a promising solution for dynamic UAV assignment problems and offers valuable insights for a broader range of real-time resource collaborative decision-making applications.

Mei You, Huihui Xu, Zhangsong Shi et al. · 0 citations
#edge computing Sep 2026

Dynamic Multiobjective Co-Optimization of Unmanned Aerial Vehicle Placement, Task Scheduling, and Resource Allocation for Remote Sensing

This article investigates the dynamic multiobjective co-optimization problem in unmanned aerial vehicle (UAV)-assisted remote sensing systems, aiming to jointly optimize UAV placement, task scheduling strategies, and computing/communication resource allocation to minimize the system’s average processing latency and the total energy consumption of UAVs. Addressing the shortcomings of existing research, which often overlooks the computational capabilities of UAVs, optimizes only a single aspect, and fails to account for environmental dynamics, this work formulates the problem as a dynamic multiobjective optimization problem. A hybrid optimization framework named DSG, integrating swarm intelligence and evolutionary algorithms, is proposed. The framework first derives a closed-form optimal resource allocation solution for given deployment and scheduling strategies through theoretical analysis. It then employs an improved dynamic multiobjective evolutionary algorithm (DMOEA) to co-optimize UAV positions (continuous variables) and task scheduling (discrete variables). Experimental results demonstrate that DSG achieves significantly better normalized hypervolume performance than comparative algorithms across various system scales [number of UAVs, access points (APs), and sensors] while exhibiting good stability and scalability. This provides an effective solution for the efficient co-optimization of UAV-assisted edge computing in dynamic environments.

Bo Wang, Xiaoyun Qin, Zhifeng Zhang et al. · 0 citations