TY - JOUR
T1 - Hybrid remora crayfish optimization for engineering and wireless sensor network coverage optimization
AU - Zhong, Rui
AU - Fan, Qinqin
AU - Zhang, Chao
AU - Yu, Jun
N1 - Publisher Copyright:
© The Author(s), under exclusive licence to Springer Science+Business Media, LLC, part of Springer Nature 2024.
PY - 2024
Y1 - 2024
N2 - 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.
AB - 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.
KW - Crayfish optimization algorithm (COA)
KW - Engineering problem
KW - Hybridization
KW - Remora optimization algorithm (ROA)
KW - Wireless sensor networks (WSNs) coverage optimization
UR - http://www.scopus.com/inward/record.url?scp=85192092516&partnerID=8YFLogxK
U2 - 10.1007/s10586-024-04508-1
DO - 10.1007/s10586-024-04508-1
M3 - 学術論文
AN - SCOPUS:85192092516
SN - 1386-7857
JO - Cluster Computing
JF - Cluster Computing
ER -