An improved arithmetic optimization algorithm with forced switching mechanism for global optimization problems
Arithmetic optimization algorithm (AOA) is a newly proposed meta-heuristic method which is inspired by the arithmetic operators in mathematics. However, the AOA has the weaknesses of insufficient exploration capability and is likely to fall into local optima. To improve the searching quality of orig...
| Main Authors: | , , , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
AIMS Press
2022-01-01
|
| Series: | Mathematical Biosciences and Engineering |
| Subjects: | |
| Online Access: | https://www.aimspress.com/article/doi/10.3934/mbe.2022023?viewType=HTML |
| _version_ | 1818952773352292352 |
|---|---|
| author | Rong Zheng Heming Jia Laith Abualigah Qingxin Liu Shuang Wang |
| author_facet | Rong Zheng Heming Jia Laith Abualigah Qingxin Liu Shuang Wang |
| author_sort | Rong Zheng |
| collection | DOAJ |
| description | Arithmetic optimization algorithm (AOA) is a newly proposed meta-heuristic method which is inspired by the arithmetic operators in mathematics. However, the AOA has the weaknesses of insufficient exploration capability and is likely to fall into local optima. To improve the searching quality of original AOA, this paper presents an improved AOA (IAOA) integrated with proposed forced switching mechanism (FSM). The enhanced algorithm uses the random math optimizer probability (RMOP) to increase the population diversity for better global search. And then the forced switching mechanism is introduced into the AOA to help the search agents jump out of the local optima. When the search agents cannot find better positions within a certain number of iterations, the proposed FSM will make them conduct the exploratory behavior. Thus the cases of being trapped into local optima can be avoided effectively. The proposed IAOA is extensively tested by twenty-three classical benchmark functions and ten CEC2020 test functions and compared with the AOA and other well-known optimization algorithms. The experimental results show that the proposed algorithm is superior to other comparative algorithms on most of the test functions. Furthermore, the test results of two training problems of multi-layer perceptron (MLP) and three classical engineering design problems also indicate that the proposed IAOA is highly effective when dealing with real-world problems. |
| first_indexed | 2024-12-20T09:55:42Z |
| format | Article |
| id | doaj.art-cd0b34e039c54abbab381db64cc74b29 |
| institution | Directory Open Access Journal |
| issn | 1551-0018 |
| language | English |
| last_indexed | 2024-12-20T09:55:42Z |
| publishDate | 2022-01-01 |
| publisher | AIMS Press |
| record_format | Article |
| series | Mathematical Biosciences and Engineering |
| spelling | doaj.art-cd0b34e039c54abbab381db64cc74b292022-12-21T19:44:28ZengAIMS PressMathematical Biosciences and Engineering1551-00182022-01-0119147351210.3934/mbe.2022023An improved arithmetic optimization algorithm with forced switching mechanism for global optimization problemsRong Zheng0Heming Jia1Laith Abualigah2Qingxin Liu3Shuang Wang 41. School of Information Engineering, Sanming University, Sanming 365004, China1. School of Information Engineering, Sanming University, Sanming 365004, China2. Faculty of Computer Sciences and Informatics, Amman Arab University, Amman 11953, Jordan 3. School of Computer Science, Universiti Sains Malaysia, Penang 11800, Malaysia4. School of Computer Science and Technology, Hainan University, Haikou 570228, China1. School of Information Engineering, Sanming University, Sanming 365004, ChinaArithmetic optimization algorithm (AOA) is a newly proposed meta-heuristic method which is inspired by the arithmetic operators in mathematics. However, the AOA has the weaknesses of insufficient exploration capability and is likely to fall into local optima. To improve the searching quality of original AOA, this paper presents an improved AOA (IAOA) integrated with proposed forced switching mechanism (FSM). The enhanced algorithm uses the random math optimizer probability (RMOP) to increase the population diversity for better global search. And then the forced switching mechanism is introduced into the AOA to help the search agents jump out of the local optima. When the search agents cannot find better positions within a certain number of iterations, the proposed FSM will make them conduct the exploratory behavior. Thus the cases of being trapped into local optima can be avoided effectively. The proposed IAOA is extensively tested by twenty-three classical benchmark functions and ten CEC2020 test functions and compared with the AOA and other well-known optimization algorithms. The experimental results show that the proposed algorithm is superior to other comparative algorithms on most of the test functions. Furthermore, the test results of two training problems of multi-layer perceptron (MLP) and three classical engineering design problems also indicate that the proposed IAOA is highly effective when dealing with real-world problems.https://www.aimspress.com/article/doi/10.3934/mbe.2022023?viewType=HTMLarithmetic optimization algorithmmeta-heuristic algorithmglobal optimizationexploration and exploitationhigh-dimensional optimization problems |
| spellingShingle | Rong Zheng Heming Jia Laith Abualigah Qingxin Liu Shuang Wang An improved arithmetic optimization algorithm with forced switching mechanism for global optimization problems Mathematical Biosciences and Engineering arithmetic optimization algorithm meta-heuristic algorithm global optimization exploration and exploitation high-dimensional optimization problems |
| title | An improved arithmetic optimization algorithm with forced switching mechanism for global optimization problems |
| title_full | An improved arithmetic optimization algorithm with forced switching mechanism for global optimization problems |
| title_fullStr | An improved arithmetic optimization algorithm with forced switching mechanism for global optimization problems |
| title_full_unstemmed | An improved arithmetic optimization algorithm with forced switching mechanism for global optimization problems |
| title_short | An improved arithmetic optimization algorithm with forced switching mechanism for global optimization problems |
| title_sort | improved arithmetic optimization algorithm with forced switching mechanism for global optimization problems |
| topic | arithmetic optimization algorithm meta-heuristic algorithm global optimization exploration and exploitation high-dimensional optimization problems |
| url | https://www.aimspress.com/article/doi/10.3934/mbe.2022023?viewType=HTML |
| work_keys_str_mv | AT rongzheng animprovedarithmeticoptimizationalgorithmwithforcedswitchingmechanismforglobaloptimizationproblems AT hemingjia animprovedarithmeticoptimizationalgorithmwithforcedswitchingmechanismforglobaloptimizationproblems AT laithabualigah animprovedarithmeticoptimizationalgorithmwithforcedswitchingmechanismforglobaloptimizationproblems AT qingxinliu animprovedarithmeticoptimizationalgorithmwithforcedswitchingmechanismforglobaloptimizationproblems AT shuangwang animprovedarithmeticoptimizationalgorithmwithforcedswitchingmechanismforglobaloptimizationproblems AT rongzheng improvedarithmeticoptimizationalgorithmwithforcedswitchingmechanismforglobaloptimizationproblems AT hemingjia improvedarithmeticoptimizationalgorithmwithforcedswitchingmechanismforglobaloptimizationproblems AT laithabualigah improvedarithmeticoptimizationalgorithmwithforcedswitchingmechanismforglobaloptimizationproblems AT qingxinliu improvedarithmeticoptimizationalgorithmwithforcedswitchingmechanismforglobaloptimizationproblems AT shuangwang improvedarithmeticoptimizationalgorithmwithforcedswitchingmechanismforglobaloptimizationproblems |