arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2504.09574cs.AI
收藏

一种使用自适应探索与开发的改进FOX优化算法用于全局优化

An Improved FOX Optimization Algorithm Using Adaptive Exploration and Exploitation for Global Optimization

College of Computer Science, University of Technology(技术大学计算机科学学院);Department of Computer Science and Engineering(大学工程学院;人工智能研究所,库尔德大学);AIIC, University of Kurdistan

Mahmood A. Jumaah, Yossra H. Ali, Tarik A. Rashid

AI总结:

本文提出改进FOX算法IFOX,通过自适应步长平衡探索与开发并减少超参数,在多个基准和实际问题上相比原FOX提升40%,展现出较强竞争力。

摘要:

优化算法对于解决许多现实世界问题至关重要。然而,诸如陷入局部最优以及有效平衡探索与开发等挑战往往限制了它们的性能。本文介绍了FOX优化算法(FOX)的一种改进变体,称为Improved FOX(IFOX),该算法引入了一种新的自适应方法,使用动态缩放的步长参数,根据当前解的适应度值来平衡探索与开发。所提出的IFOX还通过移除四个参数(C1、C2、a、Mint)减少了超参数的数量,并改进了FOX的主要方程。为了评估其性能,IFOX在20个经典基准函数、来自进化计算大会(CEC)的61个基准测试函数以及十个现实世界问题上进行了测试。实验结果表明,IFOX在整体性能指标上相比原始FOX实现了40%的提升。此外,在所有涉及的函数和问题上,它与16种优化算法相比取得了880次胜利、228次平局和348次失败。此外,包括Friedman检验和Wilcoxon符号秩检验在内的非参数统计检验证实了其相对于近期和最新的优化算法(如LSHADE和NRO)的竞争力,在17种算法中平均排名为5.92。这些发现凸显了IFOX在解决多样化优化问题方面的巨大潜力,使其成为一种具有竞争力且有效的优化算法。

英文摘要:

Optimization algorithms are essential for solving many real-world problems. However, challenges such as getting trapped in local minima and effectively balancing exploration and exploitation often limit their performance. This paper introduces an improved variation of the FOX optimization algorithm (FOX), termed Improved FOX (IFOX), incorporating a new adaptive method using a dynamically scaled step-size parameter to balance exploration and exploitation based on the current solution's fitness value. The proposed IFOX also reduces the number of hyperparameters by removing four parameters (C1, C2, a, Mint) and refines the primary equations of FOX. To evaluate its performance, IFOX was tested on 20 classical benchmark functions, 61 benchmark test functions from the congress on evolutionary computation (CEC), and ten real-world problems. The experimental results showed that IFOX achieved a 40% improvement in overall performance metrics over the original FOX. Additionally, it achieved 880 wins, 228 ties, and 348 losses against 16 optimization algorithms across all involved functions and problems. Furthermore, non-parametric statistical tests, including the Friedman and Wilcoxon signed-rank tests, confirmed its competitiveness against recent and state-of-the-art optimization algorithms, such as LSHADE and NRO, with an average rank of 5.92 among 17 algorithms. These findings highlight the significant potential of IFOX for solving diverse optimization problems, establishing it as a competitive and effective optimization algorithm.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑