|
Abstract
|
This paper introduces a variant version of the AO for efficiently solving high-dimensional computationally expensive problems. Traditional optimization techniques struggle with problems characterized by expensive objective functions and a large number of variables. To address this challenge, this paper proposes a SMAO that leverages machine learning techniques to approximate the objective function. SMAO utilizes RBF to build an accurate and efficient surrogate model. By iteratively optimizing the surrogate model, the search process is directed toward the global optimum while significantly reducing the computational cost compared to traditional optimization methods. To evaluate and compare the performance of SMAO with the surrogate model-based versions of the Gazelle Optimization Algorithm GOA, RSA, PDO, and FLA, they are analyzed on a set of benchmark test functions with dimensions varying from 30 to 200. According to the reported results, SMAO has a higher performance compared to others in terms of achieving the nearest solutions to an optimum, early convergence, and accuracy.
|