A Novel Chaotic Elite Adaptive Genetic Algorithm for Task Allocation of Intelligent Unmanned Wireless Sensor Networks

In recent times, the progress of Intelligent Unmanned Wireless Sensor Networks (IUWSNs) has inspired scientists to develop inventive task allocation algorithms. These efficient techniques serve as robust stochastic optimization methods, aimed at maximizing revenue for the network’s objectives. Howev...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Applied sciences Jg. 13; H. 17; S. 9870
Hauptverfasser: Fei, Hongmei, Zhang, Baitao, Liu, Yan, Yan, Manli, Lu, Yi, Zhou, Jie
Format: Journal Article
Sprache:Englisch
Veröffentlicht: Basel MDPI AG 01.09.2023
Schlagworte:
Algorithms
Assignment problem
Efficiency
Energy consumption
genetic algorithm
Genetic algorithms
Genetic research
Internet of Things
Linear programming
Mathematical optimization
Mutation
Optimization algorithms
Particle Swarm Optimization
Research methodology
Sensors
task allocation
Wireless sensor networks
ISSN:2076-3417, 2076-3417
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:In recent times, the progress of Intelligent Unmanned Wireless Sensor Networks (IUWSNs) has inspired scientists to develop inventive task allocation algorithms. These efficient techniques serve as robust stochastic optimization methods, aimed at maximizing revenue for the network’s objectives. However, with the increase in sensor numbers, the computation time for addressing the challenge grows exponentially. To tackle the task allocation issue in IUWSNs, this paper introduces a novel approach: the Chaotic Elite Adaptive Genetic Algorithm (CEAGA). The optimization problem is formulated as an NP-complete integer programming challenge. Innovative elite and chaotic operators have been devised to expedite convergence and unveil the overall optimal solution. By merging the strengths of genetic algorithms with these new elite and chaotic operators, the CEAGA optimizes task allocation in IUWSNs. Through simulation experiments, we compare the CEAGA with other methods—Hybrid Genetic Algorithm (HGA), Multi-objective Binary Particle Swarm Optimization (MBPSO), and Improved Simulated Annealing (ISA)—in terms of task allocation performance. The results compellingly demonstrate that the CEAGA outperforms the other approaches in network revenue terms.
Bibliographie:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:2076-3417
2076-3417
DOI:10.3390/app13179870