Modified FOX Optimizer for Solving optimization problems

TL;DR

The paper introduces a modified FOX optimizer (mFOX) that enhances exploration and balances exploitation in optimization tasks, outperforming several existing algorithms on benchmark functions and engineering problems.

Contribution

The study proposes a novel mFOX algorithm with improved exploration strategies, including oppositional-based learning and a new update equation, to prevent premature convergence.

Findings

Outperforms 12 algorithms on benchmark functions

Achieves higher success rates in engineering problems

Effective on unimodal, constrained, high-dimensional problems

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.