arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2509.06985cs.NE
收藏

使用变量交互图改进粒子群优化

Using Variable Interaction Graphs to Improve Particle Swarm Optimization

Caz L. Czworkowski, John W. Sheppard

AI总结:

本文提出VIGPSO,通过动态学习变量交互图改进粒子群优化,在高维基准测试中显著优于标准PSO,尤其适用于高维问题。

摘要:

本文提出了变量交互图粒子群优化(VIGPSO),这是对粒子群优化(PSO)的一种改进,在优化过程中动态学习并利用变量之间的交互关系。PSO 广泛用于实值优化问题,但在高维搜索空间中面临挑战。虽然变量交互图(VIG)已被证明对处理已知问题结构的优化算法有效,但其在黑箱优化中的应用仍然有限。VIGPSO 通过分析粒子在搜索空间中的移动方式来学习变量之间如何相互影响,并利用这些学习到的关系来指导粒子未来的移动。VIGPSO 在八个基准函数(三个可分离、两个部分可分离和三个不可分离)上,在 10、30、50 和 1000 维下与标准 PSO 进行了对比评估。VIGPSO 在 32 个测试配置中的 28 个中取得了相对于标准 PSO 算法具有统计显著性的改进(p<0.05),尤其在 1000 维情况下表现突出。该算法的有效性随维度增加而增强,但在某些测试案例中以方差增大为代价。这些结果表明,动态 VIG 学习可以有效地弥合 PSO 中黑箱优化与灰箱优化之间的差距,尤其适用于高维问题。

英文摘要:

This paper presents Variable Interaction Graph Particle Swarm Optimization (VIGPSO), an adaptation to Particle Swarm Optimization (PSO) that dynamically learns and exploits variable interactions during the optimization process. PSO is widely used for real-valued optimization problems but faces challenges in high-dimensional search spaces. While Variable Interaction Graphs (VIGs) have proven effective for optimization algorithms operating with known problem structure, their application to black-box optimization remains limited. VIGPSO learns how variables influence each other by analyzing how particles move through the search space, and uses these learned relationships to guide future particle movements. VIGPSO was evaluated against standard PSO on eight benchmark functions (three separable, two partially separable, and three non-separable) across 10, 30, 50 and 1000 dimensions. VIGPSO achieved statistically significant improvements ($p<0.05$) over the standard PSO algorithm in 28 out of 32 test configurations, with particularly strong performance extending to the 1000-dimensional case. The algorithm showed increasing effectiveness with dimensionality, though at the cost of higher variance in some test cases. These results suggest that dynamic VIG learning can bridge the gap between black-box and gray-box optimization effectively in PSO, particularly for high-dimensional problems.

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

↑