Back to Search
Start Over
Adaptive opposition slime mould algorithm.
- Source :
-
Soft Computing - A Fusion of Foundations, Methodologies & Applications . Nov2021, Vol. 25 Issue 22, p14297-14313. 17p. - Publication Year :
- 2021
-
Abstract
- Recently, the slime mould algorithm (SMA) has become popular in function optimization, because it effectively uses exploration and exploitation to reach an optimal solution or near-optimal solution. However, the SMA uses two random search agents from the whole population to decide the future displacement and direction from the best search agents, which limits its exploitation and exploration. To solve this problem, we investigate an adaptive approach to decide whether opposition-based learning (OBL) will be used or not. Sometimes, the OBL is used to further increase the exploration. In addition, it maximizes the exploitation by replacing one random search agent with the best one in the position updating. The suggested technique is called an adaptive opposition slime mould algorithm (AOSMA). The qualitative and quantitative analysis of AOSMA is reported using 29 test functions that consisting of 23 classical test functions and 6 recently used composition functions from the IEEE CEC 2014 test suite. The results are compared with state-of-the-art optimization methods. Results presented in this paper show that AOSMA's performance is better than other optimization algorithms. The AOSMA is evaluated using Wilcoxon's rank-sum test. It also ranked one in Friedman's mean rank test. The proposed AOSMA algorithm would be useful for function optimization to solve real-world engineering problems. [ABSTRACT FROM AUTHOR]
- Subjects :
- *MYXOMYCETES
*ALGORITHMS
*PROBLEM solving
*SEARCH engines
*MATHEMATICAL optimization
Subjects
Details
- Language :
- English
- ISSN :
- 14327643
- Volume :
- 25
- Issue :
- 22
- Database :
- Academic Search Index
- Journal :
- Soft Computing - A Fusion of Foundations, Methodologies & Applications
- Publication Type :
- Academic Journal
- Accession number :
- 153186309
- Full Text :
- https://doi.org/10.1007/s00500-021-06140-2