Hybrid Algorithm of Slime Mould Algorithm and Arithmetic Optimization Algorithm Based on Random Opposition-Based Learning
Slime mould algorithm (SMA) and arithmetic optimization algorithm (AOA) are new meta-heuristic optimization algorithms proposed recently. SMA has strong ability of global exploration, but the oscillation effect is weak in the late iteration. It is easy to fall into local optimum, and the contraction...
| Main Author: | |
|---|---|
| Format: | Article |
| Language: | zho |
| Published: |
Journal of Computer Engineering and Applications Beijing Co., Ltd., Science Press
2022-05-01
|
| Series: | Jisuanji kexue yu tansuo |
| Subjects: | |
| Online Access: | http://fcst.ceaj.org/fileup/1673-9418/PDF/1652926954129-1075223832.pdf |
| _version_ | 1828812249282641920 |
|---|---|
| author | JIA Heming, LIU Yuxiang, LIU Qingxin, WANG Shuang, ZHENG Rong |
| author_facet | JIA Heming, LIU Yuxiang, LIU Qingxin, WANG Shuang, ZHENG Rong |
| author_sort | JIA Heming, LIU Yuxiang, LIU Qingxin, WANG Shuang, ZHENG Rong |
| collection | DOAJ |
| description | Slime mould algorithm (SMA) and arithmetic optimization algorithm (AOA) are new meta-heuristic optimization algorithms proposed recently. SMA has strong ability of global exploration, but the oscillation effect is weak in the late iteration. It is easy to fall into local optimum, and the contraction mechanism is not strong, which leads to slow convergence speed. AOA algorithm uses multiplication and division operator to update position, which has strong randomness and good ability to avoid premature convergence. To solve the above problems, this paper combines the two algorithms and uses random opposition-based learning strategy to improve the convergence speed, and proposes a hybrid algorithm of slime mould algorithm and arithmetic optimization algorithm based on random opposition-based learning (HSMAAOA) with superior performance and high efficiency. The improved algorithm retains the SMA’s exploration phase and the exploitation phase will be replaced by the multiplication and division operators, which improves the capacity of the algorithm and the ability to jump out of the local optimal solution. In addition, random opposition-based learning strategy is used to enhance the diversity of the improved algorithm population and improve the convergence speed. The experimental results show that the HSMAAOA algorithm has good robustness and optimization accuracy, and significantly improves the convergence speed. Finally, the applicability and effectiveness of HSMAAOA in engineering problems are verified through the design of welded beams and the design of pressure vessels. |
| first_indexed | 2024-12-12T09:40:57Z |
| format | Article |
| id | doaj.art-df0630934a344ecca59e958f935d09e5 |
| institution | Directory Open Access Journal |
| issn | 1673-9418 |
| language | zho |
| last_indexed | 2024-12-12T09:40:57Z |
| publishDate | 2022-05-01 |
| publisher | Journal of Computer Engineering and Applications Beijing Co., Ltd., Science Press |
| record_format | Article |
| series | Jisuanji kexue yu tansuo |
| spelling | doaj.art-df0630934a344ecca59e958f935d09e52022-12-22T00:28:34ZzhoJournal of Computer Engineering and Applications Beijing Co., Ltd., Science PressJisuanji kexue yu tansuo1673-94182022-05-011651182119210.3778/j.issn.1673-9418.2105016Hybrid Algorithm of Slime Mould Algorithm and Arithmetic Optimization Algorithm Based on Random Opposition-Based LearningJIA Heming, LIU Yuxiang, LIU Qingxin, WANG Shuang, ZHENG Rong01. Department of Information Engineering, Sanming University, Sanming, Fujian 365004, China;2. College of Physics and Information Engineering, Fuzhou University, Fuzhou 350108, China;3. School of Computer Science and Technology, Hainan University, Haikou 570228, ChinaSlime mould algorithm (SMA) and arithmetic optimization algorithm (AOA) are new meta-heuristic optimization algorithms proposed recently. SMA has strong ability of global exploration, but the oscillation effect is weak in the late iteration. It is easy to fall into local optimum, and the contraction mechanism is not strong, which leads to slow convergence speed. AOA algorithm uses multiplication and division operator to update position, which has strong randomness and good ability to avoid premature convergence. To solve the above problems, this paper combines the two algorithms and uses random opposition-based learning strategy to improve the convergence speed, and proposes a hybrid algorithm of slime mould algorithm and arithmetic optimization algorithm based on random opposition-based learning (HSMAAOA) with superior performance and high efficiency. The improved algorithm retains the SMA’s exploration phase and the exploitation phase will be replaced by the multiplication and division operators, which improves the capacity of the algorithm and the ability to jump out of the local optimal solution. In addition, random opposition-based learning strategy is used to enhance the diversity of the improved algorithm population and improve the convergence speed. The experimental results show that the HSMAAOA algorithm has good robustness and optimization accuracy, and significantly improves the convergence speed. Finally, the applicability and effectiveness of HSMAAOA in engineering problems are verified through the design of welded beams and the design of pressure vessels.http://fcst.ceaj.org/fileup/1673-9418/PDF/1652926954129-1075223832.pdf|slime mould algorithm (sma)|arithmetic optimization algorithm (aoa)|hybrid optimization|random opposition-based learning |
| spellingShingle | JIA Heming, LIU Yuxiang, LIU Qingxin, WANG Shuang, ZHENG Rong Hybrid Algorithm of Slime Mould Algorithm and Arithmetic Optimization Algorithm Based on Random Opposition-Based Learning Jisuanji kexue yu tansuo |slime mould algorithm (sma)|arithmetic optimization algorithm (aoa)|hybrid optimization|random opposition-based learning |
| title | Hybrid Algorithm of Slime Mould Algorithm and Arithmetic Optimization Algorithm Based on Random Opposition-Based Learning |
| title_full | Hybrid Algorithm of Slime Mould Algorithm and Arithmetic Optimization Algorithm Based on Random Opposition-Based Learning |
| title_fullStr | Hybrid Algorithm of Slime Mould Algorithm and Arithmetic Optimization Algorithm Based on Random Opposition-Based Learning |
| title_full_unstemmed | Hybrid Algorithm of Slime Mould Algorithm and Arithmetic Optimization Algorithm Based on Random Opposition-Based Learning |
| title_short | Hybrid Algorithm of Slime Mould Algorithm and Arithmetic Optimization Algorithm Based on Random Opposition-Based Learning |
| title_sort | hybrid algorithm of slime mould algorithm and arithmetic optimization algorithm based on random opposition based learning |
| topic | |slime mould algorithm (sma)|arithmetic optimization algorithm (aoa)|hybrid optimization|random opposition-based learning |
| url | http://fcst.ceaj.org/fileup/1673-9418/PDF/1652926954129-1075223832.pdf |
| work_keys_str_mv | AT jiahemingliuyuxiangliuqingxinwangshuangzhengrong hybridalgorithmofslimemouldalgorithmandarithmeticoptimizationalgorithmbasedonrandomoppositionbasedlearning |