México
Global optimization problems are ubiquitous across academic and scientific disciplines, presenting a persistent challenge to experts in each field. Coupled with it, real-life problems often involve discontinuities, multiple local optima, and indeterminacies, rendering deterministic optimization algorithms insufficient for finding global solutions. Stochastic global optimization algorithms are crucial to tackle and overcome these difficulties. Therefore, this paper proposes a new stochastic global optimization algorithm and compares its performance with other algorithms, such as Cuckoo Search and Differential Evolution, for solving benchmark problems. In turn, performance indexes are used to evaluate the algorithms based on computational effort and the solutions' quality, and the convergence of each algorithm is also compared.
© 2001-2026 Fundación Dialnet · Todos los derechos reservados