Ala Kana, Imtiaz Ahmad^*

CMC-Computers, Materials & Continua, Vol.76, No.3, pp. 3443-3464, 2023, DOI:10.32604/cmc.2023.040775

Abstract A newly proposed competent population-based optimization algorithm called RUN, which uses the principle of slope variations calculated by applying the Runge Kutta method as the key search mechanism, has gained wider interest in solving optimization problems. However, in high-dimensional problems, the search capabilities, convergence speed, and runtime of RUN deteriorate. This work aims at filling this gap by proposing an improved variant of the RUN algorithm called the Adaptive-RUN. Population size plays a vital role in both runtime efficiency and optimization effectiveness of metaheuristic algorithms. Unlike the original RUN where population size is fixed throughout the search process, Adaptive-RUN automatically… More >

Fatemeh Ahmadi Zeidabadi¹, Ali Dehghani², Mohammad Dehghani³, Zeinab Montazeri⁴, Štěpán Hubálovský⁵, Pavel Trojovský^3,*, Gaurav Dhiman⁶

CMC-Computers, Materials & Continua, Vol.71, No.3, pp. 4237-4256, 2022, DOI:10.32604/cmc.2022.023682

Abstract Finding the suitable solution to optimization problems is a fundamental challenge in various sciences. Optimization algorithms are one of the effective stochastic methods in solving optimization problems. In this paper, a new stochastic optimization algorithm called Search Step Adjustment Based Algorithm (SSABA) is presented to provide quasi-optimal solutions to various optimization problems. In the initial iterations of the algorithm, the step index is set to the highest value for a comprehensive search of the search space. Then, with increasing repetitions in order to focus the search of the algorithm in achieving the optimal solution closer to the global optimal, the… More >