Modified FOX Optimizer for Solving optimization problems

• URL: http://arxiv.org/abs/2502.20027v1
• Date: Thu, 27 Feb 2025 12:11:05 GMT
• Title: Modified FOX Optimizer for Solving optimization problems
• Abstract summary: This study proposes a modified FOX (mFOX) to enhance exploration and balance exploration and exploitation.<n>The mFOX algorithm's performance is evaluated against 12 well-known algorithms on 23 classical benchmark functions.<n>mFOX effectively addresses four engineering problems, including unimodal, constrained, and high-dimensional problems.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: The FOX optimizer, inspired by red fox hunting behavior, is a powerful algorithm for solving real-world and engineering problems. However, despite balancing exploration and exploitation, it can prematurely converge to local optima, as agent positions are updated solely based on the current best-known position, causing all agents to converge on one location. This study proposes the modified FOX optimizer (mFOX) to enhance exploration and balance exploration and exploitation in three steps. First, the Oppositional-Based Learning (OBL) strategy is used to improve the initial population. Second, control parameters are refined to achieve a better balance between exploration and exploitation. Third, a new update equation is introduced, allowing agents to adjust their positions relative to one another rather than relying solely on the best-known position. This approach improves exploration efficiency without adding complexity. The mFOX algorithm's performance is evaluated against 12 well-known algorithms on 23 classical benchmark functions, 10 CEC2019 functions, and 12 CEC2022 functions. It outperforms competitors in 74% of the classical benchmarks, 60% of the CEC2019 benchmarks, and 58% of the CEC2022 benchmarks. Additionally, mFOX effectively addresses four engineering problems. These results demonstrate mFOX's strong competitiveness in solving complex optimization tasks, including unimodal, constrained, and high-dimensional problems.

Related papers

• Do Agent Optimizers Compound? A Continual-Learning Evaluation on Terminal-Bench 2.0 [53.71882250666667]
  Most reported gains from agent-optimization methods are one-shot.<n>This does not test the setting that matters for deployed agents.<n>We compare three approaches to agent-harness optimization.
  arXiv  Detail & Related papers  (2026-07-15T16:36:04Z)
• optimize_anything: A Universal API for Optimizing any Text Parameter [98.42497715725356]
  We show a single AI-based optimization system-supporting single-task search, multi-task search with cross-problem transfer, and generalization to unseen inputs.<n>We show for the first time that text optimization with LLM-based search is a general-purpose problem-solving paradigm.
  arXiv  Detail & Related papers  (2026-05-19T10:18:12Z)
• Evaluation-driven Scaling for Scientific Discovery [77.20820317940581]
  We introduce Simple Test-time Evaluation-driven Scaling (SimpleTES), a framework that combines parallel exploration, feedback-driven refinement, and local selection.<n>We find substantial gains unlocked by scaling evaluation-driven discovery loops along the right dimensions.<n>Our results establish effective evaluation-driven loop scaling as a central axis for advancing scientific discovery.
  arXiv  Detail & Related papers  (2026-04-21T11:24:09Z)
• A multi-strategy improved gazelle optimization algorithm for solving numerical optimization and engineering applications [0.09320657506524145]
  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.
  arXiv  Detail & Related papers  (2025-09-08T20:44:15Z)
• Improved FOX Optimization Algorithm [4.395397502990339]
  This paper proposes an improved FOX optimization algorithm, Improved FOX (IFOX) IFOX introduces a new adaptive mechanism for balancing exploration and exploitation based on fitness values. Results show IFOX outperforms existing optimization algorithms, achieving superior results on 51 benchmark functions.
  arXiv  Detail & Related papers  (2025-04-13T13:50:18Z)
• An Enhancement of Cuckoo Search Algorithm for Optimal Earthquake Evacuation Space Allocation in Intramuros, Manila City [0.0]
  Enhanced Cuckoo Search Algorithm (ECSA) is proposed to solve complex optimization problems.<n>The performance of the algorithms was evaluated on 13 benchmark functions.<n>The ECSA is subsequently applied to optimize earthquake evacuation space allocation in Intramuros, Manila.
  arXiv  Detail & Related papers  (2025-02-19T07:01:23Z)
• Scattered Forest Search: Smarter Code Space Exploration with LLMs [55.71665969800222]
  We propose SCATTERED FOREST SEARCH (SFS), a novel approach that improves solution diversity and better exploits feedback during evolutionary search.<n>Our approach scales more efficiently than existing search techniques, including tree search, line search, and repeated sampling.
  arXiv  Detail & Related papers  (2024-10-22T01:58:29Z)
• MRSO: Balancing Exploration and Exploitation through Modified Rat Swarm Optimization for Global Optimization [3.7503163440313463]
  This study introduces Modified Rat Swarm (MRSO) to enhance the balance between exploration and exploitation. MRSO incorporates unique modifications to improve search efficiency and durability, making it suitable for challenging engineering problems such as welded beam, pressure vessel, and gear train design. In the CEC 2019 benchmarks, MRSO outperforms the standard RSO in six out of ten functions, demonstrating superior global search capabilities.
  arXiv  Detail & Related papers  (2024-09-20T14:52:25Z)
• In Search of Excellence: SHOA as a Competitive Shrike Optimization Algorithm for Multimodal Problems [4.939986309170004]
  The main inspiration for the proposed algorithm is taken from the swarming behaviours of shrike birds in nature. Two parts of optimization exploration and exploitation are designed by modelling shrike breeding and searching for foods. This paper is a mathematical model for the SHOA to perform optimization.
  arXiv  Detail & Related papers  (2024-07-09T11:19:37Z)
• An Enhanced Grey Wolf Optimizer with Elite Inheritance and Balance Search Mechanisms [13.754649370512924]
  The Grey Wolf (GWO) is recognized as a novel meta-heuristic algorithm inspired by the social leadership hierarchy and hunting mechanism of grey wolves. In the original GWO, there are two significant flaws in its fundamental optimization mechanisms. An enhanced Grey Wolf with Elite Inheritance Mechanism and Balance Search Mechanism is proposed.
  arXiv  Detail & Related papers  (2024-04-09T03:28:00Z)
• VeLO: Training Versatile Learned Optimizers by Scaling Up [67.90237498659397]
  We leverage the same scaling approach behind the success of deep learning to learn versatiles. We train an ingest for deep learning which is itself a small neural network that ingests and outputs parameter updates. We open source our learned, meta-training code, the associated train test data, and an extensive benchmark suite with baselines at velo-code.io.
  arXiv  Detail & Related papers  (2022-11-17T18:39:07Z)
• 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)
• ZARTS: On Zero-order Optimization for Neural Architecture Search [94.41017048659664]
  Differentiable architecture search (DARTS) has been a popular one-shot paradigm for NAS due to its high efficiency. This work turns to zero-order optimization and proposes a novel NAS scheme, called ZARTS, to search without enforcing the above approximation. In particular, results on 12 benchmarks verify the outstanding robustness of ZARTS, where the performance of DARTS collapses due to its known instability issue.
  arXiv  Detail & Related papers  (2021-10-10T09:35:15Z)
• The Archerfish Hunting Optimizer: a novel metaheuristic algorithm for global optimization [0.8315801422499861]
  Global optimization solves real-world problems numerically or analytically by minimizing their objective functions. We propose a global metahistic algorithm based on the Archerfish Hunting (AHO)
  arXiv  Detail & Related papers  (2021-02-03T16:22:31Z)
• Incorporating Expert Prior in Bayesian Optimisation via Space Warping [54.412024556499254]
  In big search spaces the algorithm goes through several low function value regions before reaching the optimum of the function. One approach to subside this cold start phase is to use prior knowledge that can accelerate the optimisation. In this paper, we represent the prior knowledge about the function optimum through a prior distribution. The prior distribution is then used to warp the search space in such a way that space gets expanded around the high probability region of function optimum and shrinks around low probability region of optimum.
  arXiv  Detail & Related papers  (2020-03-27T06:18:49Z)
• Self-Directed Online Machine Learning for Topology Optimization [58.920693413667216]
  Self-directed Online Learning Optimization integrates Deep Neural Network (DNN) with Finite Element Method (FEM) calculations. Our algorithm was tested by four types of problems including compliance minimization, fluid-structure optimization, heat transfer enhancement and truss optimization. It reduced the computational time by 2 5 orders of magnitude compared with directly using methods, and outperformed all state-of-the-art algorithms tested in our experiments.
  arXiv  Detail & Related papers  (2020-02-04T20:00:28Z)

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.