A multi-strategy improved gazelle optimization algorithm for solving numerical optimization and engineering applications

• URL: http://arxiv.org/abs/2509.07211v1
• Date: Mon, 08 Sep 2025 20:44:15 GMT
• Title: A multi-strategy improved gazelle optimization algorithm for solving numerical optimization and engineering applications
• Authors: Qi Diao, Chengyue Xie, Yuchen Yin, Hoileong Lee, Haolong Yang,
• Abstract summary: This paper proposes a multi-strategy improved gazelle optimization algorithm (MSIGOA)<n>Two adaptive parameter tuning strategies improve the applicability of the algorithm and promote a smoother optimization process.<n>The dominant population-based restart strategy enhances the algorithms ability to escape from local optima and avoid its premature convergence.
• Score: 0.09320657506524145
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Aiming at the shortcomings of the gazelle optimization algorithm, such as the imbalance between exploration and exploitation and the insufficient information exchange within the population, this paper proposes a multi-strategy improved gazelle optimization algorithm (MSIGOA). To address these issues, MSIGOA proposes an iteration-based updating framework that switches between exploitation and exploration according to the optimization process, which effectively enhances the balance between local exploitation and global exploration in the optimization process and improves the convergence speed. Two adaptive parameter tuning strategies improve the applicability of the algorithm and promote a smoother optimization process. The dominant population-based restart strategy enhances the algorithms ability to escape from local optima and avoid its premature convergence. These enhancements significantly improve the exploration and exploitation capabilities of MSIGOA, bringing superior convergence and efficiency in dealing with complex problems. In this paper, the parameter sensitivity, strategy effectiveness, convergence and stability of the proposed method are evaluated on two benchmark test sets including CEC2017 and CEC2022. Test results and statistical tests show that MSIGOA outperforms basic GOA and other advanced algorithms. On the CEC2017 and CEC2022 test sets, the proportion of functions where MSIGOA is not worse than GOA is 92.2% and 83.3%, respectively, and the proportion of functions where MSIGOA is not worse than other algorithms is 88.57% and 87.5%, respectively. Finally, the extensibility of MSIGAO is further verified by several engineering design optimization problems.

Related papers

• CMA-ES with Radial Basis Function Surrogate for Black-Box Optimization [1.581191445609191]
  We propose the adoption of surrogate models within the CMA-ES framework called CMA-SAO to develop an initial surrogate model.<n> Empirical validation reveals that CMA-SAO algorithm markedly diminishes the number of function evaluations in comparison to prevailing algorithms.
  arXiv  Detail & Related papers  (2025-05-22T02:10:04Z)
• Preference Optimization for Combinatorial Optimization Problems [54.87466279363487]
  Reinforcement Learning (RL) has emerged as a powerful tool for neural optimization, enabling models learns that solve complex problems without requiring expert knowledge.<n>Despite significant progress, existing RL approaches face challenges such as diminishing reward signals and inefficient exploration in vast action spaces.<n>We propose Preference Optimization, a novel method that transforms quantitative reward signals into qualitative preference signals via statistical comparison modeling.
  arXiv  Detail & Related papers  (2025-05-13T16:47:00Z)
• Goat Optimization Algorithm: A Novel Bio-Inspired Metaheuristic for Global Optimization [1.2289361708127877]
  This paper presents a novel bio-inspired metaheuristic optimization technique inspired by goats' adaptive foraging, strategic movement, and parasite avoidance behaviors.<n>The algorithm's performance is evaluated on standard unimodal benchmark functions.<n>The findings suggest that GOA is a promising advancement in bio-inspired optimization techniques.
  arXiv  Detail & Related papers  (2025-03-04T06:44:07Z)
• Enhancing Optimization Through Innovation: The Multi-Strategy Improved Black Widow Optimization Algorithm (MSBWOA) [11.450701963760817]
  This paper introduces a Multi-Strategy Improved Black Widow Optimization Algorithm (MSBWOA) It is designed to enhance the performance of the standard Black Widow Algorithm (BW) in solving complex optimization problems. It integrates four key strategies: initializing the population using Tent chaotic mapping to enhance diversity and initial exploratory capability; implementing mutation optimization on the least fit individuals to maintain dynamic population and prevent premature convergence; and adding a random perturbation strategy to enhance the algorithm's ability to escape local optima.
  arXiv  Detail & Related papers  (2023-12-20T19:55:36Z)
• Advancements in Optimization: Adaptive Differential Evolution with Diversification Strategy [0.0]
  The study employs single-objective optimization in a two-dimensional space and runs ADEDS on each of the benchmark functions with multiple iterations. ADEDS consistently outperforms standard DE for a variety of optimization challenges, including functions with numerous local optima, plate-shaped, valley-shaped, stretched-shaped, and noisy functions.
  arXiv  Detail & Related papers  (2023-10-02T10:05:41Z)
• Improving Performance Insensitivity of Large-scale Multiobjective Optimization via Monte Carlo Tree Search [7.34812867861951]
  We propose an evolutionary algorithm for solving large-scale multiobjective optimization problems based on Monte Carlo tree search. The proposed method samples the decision variables to construct new nodes on the Monte Carlo tree for optimization and evaluation. It selects nodes with good evaluation for further search to reduce the performance sensitivity caused by large-scale decision variables.
  arXiv  Detail & Related papers  (2023-04-08T17:15:49Z)
• An Empirical Evaluation of Zeroth-Order Optimization Methods on AI-driven Molecule Optimization [78.36413169647408]
  We study the effectiveness of various ZO optimization methods for optimizing molecular objectives. We show the advantages of ZO sign-based gradient descent (ZO-signGD) We demonstrate the potential effectiveness of ZO optimization methods on widely used benchmark tasks from the Guacamol suite.
  arXiv  Detail & Related papers  (2022-10-27T01:58:10Z)
• Evolving Pareto-Optimal Actor-Critic Algorithms for Generalizability and Stability [67.8426046908398]
  Generalizability and stability are two key objectives for operating reinforcement learning (RL) agents in the real world. This paper presents MetaPG, an evolutionary method for automated design of actor-critic loss functions.
  arXiv  Detail & Related papers  (2022-04-08T20:46:16Z)
• Bilevel Optimization: Convergence Analysis and Enhanced Design [63.64636047748605]
  Bilevel optimization is a tool for many machine learning problems. We propose a novel stoc-efficientgradient estimator named stoc-BiO.
  arXiv  Detail & Related papers  (2020-10-15T18:09:48Z)
• EOS: a Parallel, Self-Adaptive, Multi-Population Evolutionary Algorithm for Constrained Global Optimization [68.8204255655161]
  EOS is a global optimization algorithm for constrained and unconstrained problems of real-valued variables. It implements a number of improvements to the well-known Differential Evolution (DE) algorithm. Results prove that EOSis capable of achieving increased performance compared to state-of-the-art single-population self-adaptive DE algorithms.
  arXiv  Detail & Related papers  (2020-07-09T10:19:22Z)
• Adaptivity of Stochastic Gradient Methods for Nonconvex Optimization [71.03797261151605]
  Adaptivity is an important yet under-studied property in modern optimization theory. Our algorithm is proved to achieve the best-available convergence for non-PL objectives simultaneously while outperforming existing algorithms for PL objectives.
  arXiv  Detail & Related papers  (2020-02-13T05:42:27Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.