GSO Algorithm and Its Enhanced Variants

This paper discusses the GSO algorithm and its improved variants. The GSO algorithm serves as an effective optimization method for structural cross-section optimization, geometric optimization, dynamic optimization, and topology optimization. Compared to alternative algorithms, GSO demonstrates superior convergence speed and delivers higher-quality optimization results. To further enhance GSO's performance, we developed HGSO by integrating harmony search algorithm principles. The improved HGSO algorithm implements a memory consideration mechanism and pitch adjustment operations that effectively escape local optima, making it more practical for real-world applications. Both GSO and HGSO represent significant contributions to optimization methodologies, employing population-based search strategies with fitness evaluation functions to handle complex engineering constraints. These algorithms play crucial roles in solving challenging optimization problems across various engineering domains.