1
|
Yang S, Zhang L, Yang X, Sun J, Dong W. A Multiple Mechanism Enhanced Arithmetic Optimization Algorithm for Numerical Problems. Biomimetics (Basel) 2023; 8:348. [PMID: 37622953 PMCID: PMC10452629 DOI: 10.3390/biomimetics8040348] [Citation(s) in RCA: 1] [Impact Index Per Article: 0.5] [Reference Citation Analysis] [Abstract] [Key Words] [Track Full Text] [Journal Information] [Subscribe] [Scholar Register] [Received: 07/18/2023] [Revised: 08/01/2023] [Accepted: 08/01/2023] [Indexed: 08/26/2023] Open
Abstract
The Arithmetic Optimization Algorithm (AOA) is a meta-heuristic algorithm inspired by mathematical operators, which may stagnate in the face of complex optimization issues. Therefore, the convergence and accuracy are reduced. In this paper, an AOA variant called ASFAOA is proposed by integrating a double-opposite learning mechanism, an adaptive spiral search strategy, an offset distribution estimation strategy, and a modified cosine acceleration function formula into the original AOA, aiming to improve the local exploitation and global exploration capability of the original AOA. In the proposed ASFAOA, a dual-opposite learning strategy is utilized to enhance population diversity by searching the problem space a lot better. The spiral search strategy of the tuna swarm optimization is introduced into the addition and subtraction strategy of AOA to enhance the AOA's ability to jump out of the local optimum. An offset distribution estimation strategy is employed to effectively utilize the dominant population information for guiding the correct individual evolution. In addition, an adaptive cosine acceleration function is proposed to perform a better balance between the exploitation and exploration capabilities of the AOA. To demonstrate the superiority of the proposed ASFAOA, two experiments are conducted using existing state-of-the-art algorithms. First, The CEC 2017 benchmark function was applied with the aim of evaluating the performance of ASFAOA on the test function through mean analysis, convergence analysis, stability analysis, Wilcoxon signed rank test, and Friedman's test. The proposed ASFAOA is then utilized to solve the wireless sensor coverage problem and its performance is illustrated by two sets of coverage problems with different dimensions. The results and discussion show that ASFAOA outperforms the original AOA and other comparison algorithms. Therefore, ASFAOA is considered as a useful technique for practical optimization problems.
Collapse
Affiliation(s)
- Sen Yang
- College of Information and Communication Engineering, Harbin Engineering University, Harbin 150001, China; (L.Z.); (X.Y.); (J.S.); (W.D.)
| | | | | | | | | |
Collapse
|
2
|
Dhal KG, Sasmal B, Das A, Ray S, Rai R. A Comprehensive Survey on Arithmetic Optimization Algorithm. ARCHIVES OF COMPUTATIONAL METHODS IN ENGINEERING : STATE OF THE ART REVIEWS 2023; 30:3379-3404. [PMID: 37260909 PMCID: PMC10015548 DOI: 10.1007/s11831-023-09902-3] [Citation(s) in RCA: 0] [Impact Index Per Article: 0] [Reference Citation Analysis] [Abstract] [Track Full Text] [Figures] [Subscribe] [Scholar Register] [Received: 02/08/2023] [Accepted: 02/26/2023] [Indexed: 06/02/2023]
Abstract
Arithmetic Optimization Algorithm (AOA) is a recently developed population-based nature-inspired optimization algorithm (NIOA). AOA is designed under the inspiration of the distribution behavior of the main arithmetic operators in mathematics and hence, it also belongs to mathematics-inspired optimization algorithm (MIOA). MIOA is a powerful subset of NIOA and AOA is a proficient member of it. AOA is published in early 2021 and got a massive recognition from research fraternity due to its superior efficacy in different optimization fields. Therefore, this study presents an up-to-date survey on AOA, its variants, and applications.
Collapse
Affiliation(s)
- Krishna Gopal Dhal
- Department of Computer Science and Application, Midnapore College (Autonomous), Paschim Medinipur, Midnapore, West Bengal India
| | - Buddhadev Sasmal
- Department of Computer Science and Application, Midnapore College (Autonomous), Paschim Medinipur, Midnapore, West Bengal India
| | - Arunita Das
- Department of Computer Science and Application, Midnapore College (Autonomous), Paschim Medinipur, Midnapore, West Bengal India
| | - Swarnajit Ray
- Department of Computer Science and Engineering, Maulana Abul Kalam Azad University of Technology, Kolkata, West Bengal India
| | - Rebika Rai
- Department of Computer Applications, Sikkim University, Gangtok, Sikkim India
| |
Collapse
|
3
|
Abd Elaziz M, Chelloug S, Alduailij M, Al-qaness MAA. Boosted Reptile Search Algorithm for Engineering and Optimization Problems. APPLIED SCIENCES 2023; 13:3206. [DOI: 10.3390/app13053206] [Citation(s) in RCA: 0] [Impact Index Per Article: 0] [Reference Citation Analysis] [Abstract] [Track Full Text] [Subscribe] [Scholar Register] [Indexed: 09/02/2023]
Abstract
Recently, various metaheuristic (MH) optimization algorithms have been presented and applied to solve complex engineering and optimization problems. One main category of MH algorithms is the naturally inspired swarm intelligence (SI) algorithms. SI methods have shown great performance on different problems. However, individual MH and SI methods face some shortcomings, such as trapping at local optima. To solve this issue, hybrid SI methods can perform better than individual ones. In this study, we developed a boosted version of the reptile search algorithm (RSA) to be employed for different complex problems, such as intrusion detection systems (IDSs) in cloud–IoT environments, as well as different optimization and engineering problems. This modification was performed by employing the operators of the red fox algorithm (RFO) and triangular mutation operator (TMO). The aim of using the RFO was to boost the exploration of the RSA, whereas the TMO was used for enhancing the exploitation stage of the RSA. To assess the developed approach, called RSRFT, a set of six constrained engineering benchmarks was used. The experimental results illustrated the ability of RSRFT to find the solution to those tested engineering problems. In addition, it outperformed the other well-known optimization techniques that have been used to handle these problems.
Collapse
Affiliation(s)
- Mohamed Abd Elaziz
- Department of Mathematics, Faculty of Science, Zagazig University, Zagazig 44519, Egypt
- Artificial Intelligence Research Center (AIRC), Ajman University, Ajman 346, United Arab Emirates
- Department of Artificial Intelligence Science and Engineering, Galala University, Suze 435611, Egypt
- Department of Electrical and Computer Engineering, Lebanese American University, Byblos 13-5053, Lebanon
- Faculty of Information Technology, Middle East University, Amman 11831, Jordan
| | - Samia Chelloug
- Department of Information Technology, College of Computer and Information Sciences, Princess Nourah bint Abdulrahman University, Riyadh 11671, Saudi Arabia
| | - Mai Alduailij
- Department of Computer Science, College of Computer and Information Sciences, Princess Nourah bint Abdulrahman University, Riyadh 11671, Saudi Arabia
| | - Mohammed A. A. Al-qaness
- College of Physics and Electronic Information Engineering, Zhejiang Normal University, Jinhua 321004, China
| |
Collapse
|
4
|
Levy flight incorporated hybrid learning model for gravitational search algorithm. Knowl Based Syst 2023. [DOI: 10.1016/j.knosys.2023.110374] [Citation(s) in RCA: 0] [Impact Index Per Article: 0] [Reference Citation Analysis] [Track Full Text] [Journal Information] [Subscribe] [Scholar Register] [Indexed: 02/11/2023]
|
5
|
Dynamic Chaotic Opposition-Based Learning-Driven Hybrid Aquila Optimizer and Artificial Rabbits Optimization Algorithm: Framework and Applications. Processes (Basel) 2022. [DOI: 10.3390/pr10122703] [Citation(s) in RCA: 0] [Impact Index Per Article: 0] [Reference Citation Analysis] [Abstract] [Track Full Text] [Journal Information] [Subscribe] [Scholar Register] [Indexed: 12/23/2022] Open
Abstract
Aquila Optimizer (AO) and Artificial Rabbits Optimization (ARO) are two recently developed meta-heuristic optimization algorithms. Although AO has powerful exploration capability, it still suffers from poor solution accuracy and premature convergence when addressing some complex cases due to the insufficient exploitation phase. In contrast, ARO possesses very competitive exploitation potential, but its exploration ability needs to be more satisfactory. To ameliorate the above-mentioned limitations in a single algorithm and achieve better overall optimization performance, this paper proposes a novel chaotic opposition-based learning-driven hybrid AO and ARO algorithm called CHAOARO. Firstly, the global exploration phase of AO is combined with the local exploitation phase of ARO to maintain the respective valuable search capabilities. Then, an adaptive switching mechanism (ASM) is designed to better balance the exploration and exploitation procedures. Finally, we introduce the chaotic opposition-based learning (COBL) strategy to avoid the algorithm fall into the local optima. To comprehensively verify the effectiveness and superiority of the proposed work, CHAOARO is compared with the original AO, ARO, and several state-of-the-art algorithms on 23 classical benchmark functions and the IEEE CEC2019 test suite. Systematic comparisons demonstrate that CHAOARO can significantly outperform other competitor methods in terms of solution accuracy, convergence speed, and robustness. Furthermore, the promising prospect of CHAOARO in real-world applications is highlighted by resolving five industrial engineering design problems and photovoltaic (PV) model parameter identification problem.
Collapse
|
6
|
Çelik E. IEGQO-AOA: Information-Exchanged Gaussian Arithmetic Optimization Algorithm with Quasi-opposition learning. Knowl Based Syst 2022. [DOI: 10.1016/j.knosys.2022.110169] [Citation(s) in RCA: 0] [Impact Index Per Article: 0] [Reference Citation Analysis] [Track Full Text] [Journal Information] [Subscribe] [Scholar Register] [Indexed: 12/03/2022]
|
7
|
PVS: a new population-based vortex search algorithm with boosted exploration capability using polynomial mutation. Neural Comput Appl 2022. [DOI: 10.1007/s00521-022-07671-x] [Citation(s) in RCA: 0] [Impact Index Per Article: 0] [Reference Citation Analysis] [Track Full Text] [Journal Information] [Subscribe] [Scholar Register] [Indexed: 11/26/2022]
|
8
|
Xiao Y, Guo Y, Cui H, Wang Y, Li J, Zhang Y. IHAOAVOA: An improved hybrid aquila optimizer and African vultures optimization algorithm for global optimization problems. MATHEMATICAL BIOSCIENCES AND ENGINEERING : MBE 2022; 19:10963-11017. [PMID: 36124577 DOI: 10.3934/mbe.2022512] [Citation(s) in RCA: 5] [Impact Index Per Article: 1.7] [Reference Citation Analysis] [Abstract] [Key Words] [MESH Headings] [Track Full Text] [Subscribe] [Scholar Register] [Indexed: 06/15/2023]
Abstract
Aquila Optimizer (AO) and African Vultures Optimization Algorithm (AVOA) are two newly developed meta-heuristic algorithms that simulate several intelligent hunting behaviors of Aquila and African vulture in nature, respectively. AO has powerful global exploration capability, whereas its local exploitation phase is not stable enough. On the other hand, AVOA possesses promising exploitation capability but insufficient exploration mechanisms. Based on the characteristics of both algorithms, in this paper, we propose an improved hybrid AO and AVOA optimizer called IHAOAVOA to overcome the deficiencies in the single algorithm and provide higher-quality solutions for solving global optimization problems. First, the exploration phase of AO and the exploitation phase of AVOA are combined to retain the valuable search competence of each. Then, a new composite opposition-based learning (COBL) is designed to increase the population diversity and help the hybrid algorithm escape from the local optima. In addition, to more effectively guide the search process and balance the exploration and exploitation, the fitness-distance balance (FDB) selection strategy is introduced to modify the core position update formula. The performance of the proposed IHAOAVOA is comprehensively investigated and analyzed by comparing against the basic AO, AVOA, and six state-of-the-art algorithms on 23 classical benchmark functions and the IEEE CEC2019 test suite. Experimental results demonstrate that IHAOAVOA achieves superior solution accuracy, convergence speed, and local optima avoidance than other comparison methods on most test functions. Furthermore, the practicality of IHAOAVOA is highlighted by solving five engineering design problems. Our findings reveal that the proposed technique is also highly competitive and promising when addressing real-world optimization tasks. The source code of the IHAOAVOA is publicly available at https://doi.org/10.24433/CO.2373662.v1.
Collapse
Affiliation(s)
- Yaning Xiao
- College of Mechanical and Electrical Engineering, Northeast Forestry University, Harbin 150040, China
| | - Yanling Guo
- College of Mechanical and Electrical Engineering, Northeast Forestry University, Harbin 150040, China
| | - Hao Cui
- College of Mechanical and Electrical Engineering, Northeast Forestry University, Harbin 150040, China
| | - Yangwei Wang
- College of Mechanical and Electrical Engineering, Northeast Forestry University, Harbin 150040, China
| | - Jian Li
- College of Mechanical and Electrical Engineering, Northeast Forestry University, Harbin 150040, China
| | - Yapeng Zhang
- College of Mechanical and Electrical Engineering, Northeast Forestry University, Harbin 150040, China
| |
Collapse
|
9
|
Song M, Jia H, Abualigah L, Liu Q, Lin Z, Wu D, Altalhi M. Modified Harris Hawks Optimization Algorithm with Exploration Factor and Random Walk Strategy. COMPUTATIONAL INTELLIGENCE AND NEUROSCIENCE 2022; 2022:4673665. [PMID: 35535189 PMCID: PMC9078797 DOI: 10.1155/2022/4673665] [Citation(s) in RCA: 1] [Impact Index Per Article: 0.3] [Reference Citation Analysis] [Abstract] [MESH Headings] [Track Full Text] [Download PDF] [Figures] [Subscribe] [Scholar Register] [Received: 01/07/2022] [Revised: 03/13/2022] [Accepted: 04/07/2022] [Indexed: 01/11/2023]
Abstract
One of the most popular population-based metaheuristic algorithms is Harris hawks optimization (HHO), which imitates the hunting mechanisms of Harris hawks in nature. Although HHO can obtain optimal solutions for specific problems, it stagnates in local optima solutions. In this paper, an improved Harris hawks optimization named ERHHO is proposed for solving global optimization problems. Firstly, we introduce tent chaotic map in the initialization stage to improve the diversity of the initialization population. Secondly, an exploration factor is proposed to optimize parameters for improving the ability of exploration. Finally, a random walk strategy is proposed to enhance the exploitation capability of HHO further and help search agent jump out the local optimal. Results from systematic experiments conducted on 23 benchmark functions and the CEC2017 test functions demonstrated that the proposed method can provide a more reliable solution than other well-known algorithms.
Collapse
Affiliation(s)
- Meijia Song
- Network Center, Sanming University, Sanming 365004, China
| | - Heming Jia
- School of Information and Engineering, Sanming University, Sanming 365004, China
| | - Laith Abualigah
- Faculty of Computer Sciences and Informatics, Amman Arab University, Amman 11953, Jordan
- School of Computer Science, Universiti Sains Malaysia, Penang, Malaysia
| | - Qingxin Liu
- School of Computer Science and Technology, Hainan University, Haikou 570228, China
| | - Zhixing Lin
- Network Center, Sanming University, Sanming 365004, China
| | - Di Wu
- School of Education and Music, Sanming University, Sanming 365004, China
| | - Maryam Altalhi
- Department of Management Information System, College of Business Administration, Taif University, P.O. Box 11099, Taif 21944, Saudi Arabia
| |
Collapse
|