Back to Search
Start Over
A novel search space reduction optimization algorithm.
- Source :
-
Soft Computing - A Fusion of Foundations, Methodologies & Applications . Jul2021, Vol. 25 Issue 14, p9455-9482. 28p. - Publication Year :
- 2021
-
Abstract
- This paper proposes a novel metaheuristic-based optimization technique called search space reduction (SSR) optimization algorithm. This algorithm attempts to solve the common pitfalls in the existing algorithms in the literature by randomly generating the search agents in every iteration instead of following the best solution. This new algorithm is simple, computationally efficient, which is based on the concept of reducing the search space. The performance of this algorithm is tested over classical test functions and CEC'17 benchmark test functions. The results are compared with well-established algorithms in the literature. The test results show that the proposed algorithm exhibits good exploration and exploitation capabilities. Further, this algorithm also outperforms other algorithms in solving multimodal optimization problems. In addition to this, the computational complexity of this algorithm is also presented according to CEC'17 guidelines. The proposed algorithm is also employed to solve three engineering design problems and a more complex re-entry trajectory optimization problem to show its effectiveness. [ABSTRACT FROM AUTHOR]
Details
- Language :
- English
- ISSN :
- 14327643
- Volume :
- 25
- Issue :
- 14
- Database :
- Academic Search Index
- Journal :
- Soft Computing - A Fusion of Foundations, Methodologies & Applications
- Publication Type :
- Academic Journal
- Accession number :
- 150974642
- Full Text :
- https://doi.org/10.1007/s00500-021-05838-7