2023
DOI: 10.3390/app13020945
|View full text |Cite
|
Sign up to set email alerts
|

Improved Reptile Search Optimization Algorithm: Application on Regression and Classification Problems

Abstract: The reptile search algorithm is a newly developed optimization technique that can efficiently solve various optimization problems. However, while solving high-dimensional nonconvex optimization problems, the reptile search algorithm retains some drawbacks, such as slow convergence speed, high computational complexity, and local minima trapping. Therefore, an improved reptile search algorithm (IRSA) based on a sine cosine algorithm and Levy flight is proposed in this work. The modified sine cosine algorithm wit… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
5
0

Year Published

2023
2023
2024
2024

Publication Types

Select...
5
2

Relationship

0
7

Authors

Journals

citations
Cited by 17 publications
(8 citation statements)
references
References 59 publications
0
5
0
Order By: Relevance
“…The Reptile Search Algorithm (RSA) draws inspiration from the foraging behaviors observed in crocodiles within their natural environment [44]. It operates by alternating between encircling and hunting search phases, with the transition between these phases achieved by dividing the total number of iterations into four segments [45], [46].…”
Section: Reptile Search Algorithmmentioning
confidence: 99%
“…The Reptile Search Algorithm (RSA) draws inspiration from the foraging behaviors observed in crocodiles within their natural environment [44]. It operates by alternating between encircling and hunting search phases, with the transition between these phases achieved by dividing the total number of iterations into four segments [45], [46].…”
Section: Reptile Search Algorithmmentioning
confidence: 99%
“…Some potential defects of the original RSA include: (i) the RSA, like many optimization algorithms, can sometimes get trapped in local optima, especially in complex search spaces with multiple peaks and valleys. This means the algorithm might converge to a sub-optimal solution rather than the global optimum, (ii) the performance of the RSA can be sensitive to its parameter settings, such as the values of α and β, (iii) when dealing with high-dimensional problems, the RSA might exhibit slow convergence rates, (iv) the original RSA might not always strike the right balance between exploration and exploitation, (v) there might be situations where the algorithm becomes stagnant, with solutions oscillating around certain values without significant improvements, (vi) the computational cost can increase significantly, and the algorithm might struggle to find good solutions within a reasonable time frame, and (vii) the original RSA does not have mechanisms to adapt its parameters or strategies based on the problem's characteristics or its current performance [68][69][70][71]. This lack of adaptability can hinder its performance on diverse problems.…”
Section: Proposed Multi-learning-based Reptile Search Algorithmmentioning
confidence: 99%
“…Additionally, Crocodiles engage in communication and collaboration to effectively execute hunting strategies. The RSA aims to develop robust search algorithms that yield high-quality outcomes and generate novel solutions to address intricate realworld problems [68,69]. According to the authors, the RSA has effectively addressed artificial landscape functions and practical engineering challenges, surpassing other widely used optimization techniques [63].…”
Section: Introductionmentioning
confidence: 99%
“…The GRU unit and the output of the gates are evaluated. The output of integration of reset and update gates is represented in Equation (18). The reset and update gates, the computation for the GRU unit, and their corresponding outputs are given as follows below: The output of the gates is calculated using the hyperbolic tangent, the logistic sigmoid function, and the GRU unit.…”
Section: Bigru Modelmentioning
confidence: 99%
“…The presented IRSO‐EDLCS technique primarily carries out the IRSO‐FS technique to improve the detection rate. The RSO is a recently established optimization method that could effectively resolve different problems of optimization 18 . But the RSO poses some drawbacks while resolving high dimensional non‐convex optimization problems like higher computation difficulty, local minima trapping and slower convergence speed.…”
Section: The Proposed Modelmentioning
confidence: 99%