ccDNCA: A Dual-Neighborhood Search-Based Dual-Population Coevolutionary Algorithm for Multi-UAV Task Allocation Problems With Complex Constraints

Solving the multiple unmanned aerial vehicles task allocation problem with complex constraints (MTAPCc) by means of the constrained multiobjective evolutionary algorithms (cMOEAs) is novel research in the field of Operation Research. Its advantages mainly consist of two aspects. One is that it can f...

Full description

Saved in:
Bibliographic Details
Published in:IEEE internet of things journal Vol. 12; no. 20; pp. 43143 - 43165
Main Authors: Chen, Xi, Zhao, Zipeng, Wan, Yu, Qi, Jingtao, Ruan, Yirun, Lu, Xin, Tang, Jun
Format: Journal Article
Language:English
Published: Piscataway IEEE 15.10.2025
The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subjects:
Algorithms
Autonomous aerial vehicles
Coding
Coevolutionary framework
Combinatorial analysis
Constraint handling
constraint handling technique (CHT)
Constraints
Encoding
Evolutionary algorithms
Hands
Linear programming
multi-unmanned aerial vehicle (UAV) task allocation
multiobjective combinatorial optimization
multiobjective evolutionary algorithm (MOEA)
Multiple objective analysis
Multitasking
Neighborhoods
Optimization
Permutations
Resource management
Search methods
Search problems
Unmanned aerial vehicles
Vehicle routing
Windows (intervals)
ISSN:2327-4662, 2327-4662
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:Solving the multiple unmanned aerial vehicles task allocation problem with complex constraints (MTAPCc) by means of the constrained multiobjective evolutionary algorithms (cMOEAs) is novel research in the field of Operation Research. Its advantages mainly consist of two aspects. One is that it can find feasible solutions that satisfy the constraints within an acceptable time. The other is that the obtained Pareto solution set can offer more options for decision-makers. This article presents a dual-neighborhood search-based dual-population coevolutionary algorithm (ccDNCA), which can specifically solve the constrained multiobjective combinatorial optimization problems (cMCOPs) based on permutation encoding, including the MTAPCc. The dual-population coevolutionary framework and the multistrategy collaborative constraint handling method of ccDNCA can effectively improve the efficiency of constraint handling and the ability of finding better solutions. The dual-neighborhood alternating local search (DN-ALS) framework can effectively increase the proportion of feasible solutions during the evolution and enhance the quality of the final solution set. The strategy pool integrated with multiple local search strategies can push the search toward regions with better objective values and constraint values, while enhancing the generalization ability of ccDNCA. In the experimental part, by comprehensively comparing the solution results of ccDNCA with those of other advanced algorithms, it is demonstrated that ccDNCA has significant superiority when dealing with cMCOPs based on permutation encoding, such as the MTAPCc and the vehicle routing problem with time window constraints (VRPTW).
Bibliography:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:2327-4662
2327-4662
DOI:10.1109/JIOT.2025.3595102