Hybrid remora crayfish optimization for engineering and wireless sensor network coverage optimization

This paper proposes a novel hybrid metaheuristic algorithm called the remora crayfish optimization algorithm (HRCOA) designed for solving continuous optimization problems. The crayfish optimization algorithm (COA), recently proposed as a meta-heuristic algorithm (MA), exhibits certain limitations su...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:Cluster computing Ročník 27; číslo 7; s. 10141 - 10168
Hlavní autoři: Zhong, Rui, Fan, Qinqin, Zhang, Chao, Yu, Jun
Médium: Journal Article
Jazyk:angličtina
Vydáno: New York Springer US 01.10.2024
Témata:
Computer Communication Networks
Computer Science
Operating Systems
Processor Architectures
Remora optimization algorithm (ROA)
Hybridization
Crayfish optimization algorithm (COA)
Engineering problem
Wireless sensor networks (WSNs) coverage optimization
ISSN:1386-7857, 1573-7543
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí:This paper proposes a novel hybrid metaheuristic algorithm called the remora crayfish optimization algorithm (HRCOA) designed for solving continuous optimization problems. The crayfish optimization algorithm (COA), recently proposed as a meta-heuristic algorithm (MA), exhibits certain limitations such as imbalanced exploration and exploitation capacities, susceptibility to premature optimization, and a propensity for stagnation. To address these shortcomings, we incorporate the exploitation operators from the remora optimization algorithm (ROA) to enhance the exploitative behaviors of COA. In addition, we simplify the summer resort operator in the original COA to streamline the search operator design, thus avoiding unnecessary complexity. Furthermore, numerical experiments on 10-dimensional (D) and 20-D CEC2022 benchmark functions, 50-D and 100-D CEC2020 benchmark functions, engineering optimization problems, and wireless sensor networks (WSNs) coverage optimization problems are conducted to investigate the performance of our proposed HRCOA comprehensively. We compare the proposed HRCOA against eight well-known state-of-the-art MAs, including CMAES and the original COA, as competitor algorithms. The experimental and statistical results confirm the effectiveness, competitiveness, and scalability of our proposal. Finally, we conclude that the proposed HRCOA possesses significant potential for addressing diverse optimization challenges in real-world scenarios.
ISSN:1386-7857
1573-7543
DOI:10.1007/s10586-024-04508-1