Cargando…
Hybrid Slime Mold and Arithmetic Optimization Algorithm with Random Center Learning and Restart Mutation
The slime mold algorithm (SMA) and the arithmetic optimization algorithm (AOA) are two novel meta-heuristic optimization algorithms. Among them, the slime mold algorithm has a strong global search ability. Still, the oscillation effect in the later iteration stage is weak, making it difficult to fin...
Autores principales: | , , , , |
---|---|
Formato: | Online Artículo Texto |
Lenguaje: | English |
Publicado: |
MDPI
2023
|
Materias: | |
Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC10526150/ https://www.ncbi.nlm.nih.gov/pubmed/37754147 http://dx.doi.org/10.3390/biomimetics8050396 |
_version_ | 1785110953518432256 |
---|---|
author | Chen, Hongmin Wang, Zhuo Jia, Heming Zhou, Xindong Abualigah, Laith |
author_facet | Chen, Hongmin Wang, Zhuo Jia, Heming Zhou, Xindong Abualigah, Laith |
author_sort | Chen, Hongmin |
collection | PubMed |
description | The slime mold algorithm (SMA) and the arithmetic optimization algorithm (AOA) are two novel meta-heuristic optimization algorithms. Among them, the slime mold algorithm has a strong global search ability. Still, the oscillation effect in the later iteration stage is weak, making it difficult to find the optimal position in complex functions. The arithmetic optimization algorithm utilizes multiplication and division operators for position updates, which have strong randomness and good convergence ability. For the above, this paper integrates the two algorithms and adds a random central solution strategy, a mutation strategy, and a restart strategy. A hybrid slime mold and arithmetic optimization algorithm with random center learning and restart mutation (RCLSMAOA) is proposed. The improved algorithm retains the position update formula of the slime mold algorithm in the global exploration section. It replaces the convergence stage of the slime mold algorithm with the multiplication and division algorithm in the local exploitation stage. At the same time, the stochastic center learning strategy is adopted to improve the global search efficiency and the diversity of the algorithm population. In addition, the restart strategy and mutation strategy are also used to improve the convergence accuracy of the algorithm and enhance the later optimization ability. In comparison experiments, different kinds of test functions are used to test the specific performance of the improvement algorithm. We determine the final performance of the algorithm by analyzing experimental data and convergence images, using the Wilcoxon rank sum test and Friedman test. The experimental results show that the improvement algorithm, which combines the slime mold algorithm and arithmetic optimization algorithm, is effective. Finally, the specific performance of the improvement algorithm on practical engineering problems was evaluated. |
format | Online Article Text |
id | pubmed-10526150 |
institution | National Center for Biotechnology Information |
language | English |
publishDate | 2023 |
publisher | MDPI |
record_format | MEDLINE/PubMed |
spelling | pubmed-105261502023-09-28 Hybrid Slime Mold and Arithmetic Optimization Algorithm with Random Center Learning and Restart Mutation Chen, Hongmin Wang, Zhuo Jia, Heming Zhou, Xindong Abualigah, Laith Biomimetics (Basel) Article The slime mold algorithm (SMA) and the arithmetic optimization algorithm (AOA) are two novel meta-heuristic optimization algorithms. Among them, the slime mold algorithm has a strong global search ability. Still, the oscillation effect in the later iteration stage is weak, making it difficult to find the optimal position in complex functions. The arithmetic optimization algorithm utilizes multiplication and division operators for position updates, which have strong randomness and good convergence ability. For the above, this paper integrates the two algorithms and adds a random central solution strategy, a mutation strategy, and a restart strategy. A hybrid slime mold and arithmetic optimization algorithm with random center learning and restart mutation (RCLSMAOA) is proposed. The improved algorithm retains the position update formula of the slime mold algorithm in the global exploration section. It replaces the convergence stage of the slime mold algorithm with the multiplication and division algorithm in the local exploitation stage. At the same time, the stochastic center learning strategy is adopted to improve the global search efficiency and the diversity of the algorithm population. In addition, the restart strategy and mutation strategy are also used to improve the convergence accuracy of the algorithm and enhance the later optimization ability. In comparison experiments, different kinds of test functions are used to test the specific performance of the improvement algorithm. We determine the final performance of the algorithm by analyzing experimental data and convergence images, using the Wilcoxon rank sum test and Friedman test. The experimental results show that the improvement algorithm, which combines the slime mold algorithm and arithmetic optimization algorithm, is effective. Finally, the specific performance of the improvement algorithm on practical engineering problems was evaluated. MDPI 2023-08-28 /pmc/articles/PMC10526150/ /pubmed/37754147 http://dx.doi.org/10.3390/biomimetics8050396 Text en © 2023 by the authors. https://creativecommons.org/licenses/by/4.0/Licensee MDPI, Basel, Switzerland. This article is an open access article distributed under the terms and conditions of the Creative Commons Attribution (CC BY) license (https://creativecommons.org/licenses/by/4.0/). |
spellingShingle | Article Chen, Hongmin Wang, Zhuo Jia, Heming Zhou, Xindong Abualigah, Laith Hybrid Slime Mold and Arithmetic Optimization Algorithm with Random Center Learning and Restart Mutation |
title | Hybrid Slime Mold and Arithmetic Optimization Algorithm with Random Center Learning and Restart Mutation |
title_full | Hybrid Slime Mold and Arithmetic Optimization Algorithm with Random Center Learning and Restart Mutation |
title_fullStr | Hybrid Slime Mold and Arithmetic Optimization Algorithm with Random Center Learning and Restart Mutation |
title_full_unstemmed | Hybrid Slime Mold and Arithmetic Optimization Algorithm with Random Center Learning and Restart Mutation |
title_short | Hybrid Slime Mold and Arithmetic Optimization Algorithm with Random Center Learning and Restart Mutation |
title_sort | hybrid slime mold and arithmetic optimization algorithm with random center learning and restart mutation |
topic | Article |
url | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC10526150/ https://www.ncbi.nlm.nih.gov/pubmed/37754147 http://dx.doi.org/10.3390/biomimetics8050396 |
work_keys_str_mv | AT chenhongmin hybridslimemoldandarithmeticoptimizationalgorithmwithrandomcenterlearningandrestartmutation AT wangzhuo hybridslimemoldandarithmeticoptimizationalgorithmwithrandomcenterlearningandrestartmutation AT jiaheming hybridslimemoldandarithmeticoptimizationalgorithmwithrandomcenterlearningandrestartmutation AT zhouxindong hybridslimemoldandarithmeticoptimizationalgorithmwithrandomcenterlearningandrestartmutation AT abualigahlaith hybridslimemoldandarithmeticoptimizationalgorithmwithrandomcenterlearningandrestartmutation |