[论文解读] Particle Swarm Optimization: Development of a General-Purpose Optimizer

Mauro S. Innocente, Johann Sienz|arXiv (Cornell University)|Jan 25, 2021

Metaheuristic Optimization Algorithms Research被引用 3

一句话总结

本文提出了一种通用的粒子群优化（PSO）框架，通过系统化的参数调优、可靠的停止准则以及有效的约束处理技术，提升了标准PSO算法的性能。该方法具有高效率和易于实现的特点，所需代码量极少且参数较少，同时在多种优化问题（包括约束和非光滑函数）中保持了强劲的性能表现。

ABSTRACT

Traditional methods present a very restrictive range of applications, mainly limited by the features of the function to be optimized and of the constraint functions. In contrast, evolutionary algorithms present almost no restriction to the features of these functions, although the most appropriate constraint-handling technique is still an open question. The particle swarm optimization (PSO) method is sometimes viewed as another evolutionary algorithm because of their many similarities, despite not being inspired by the same metaphor. Namely, they evolve a population of individuals taking into consideration previous experiences and using stochastic operators to introduce new responses. The advantages of evolutionary algorithms with respect to traditional methods have been greatly discussed in the literature for decades. While all such advantages are valid when comparing the PSO paradigm to traditional methods, its main advantages with respect to evolutionary algorithms consist of its noticeably lower computational cost and easier implementation. In fact, the plain version can be programmed in a few lines of code, involving no operator design and few parameters to be tuned. This paper deals with three important aspects of the method: the influence of the parameters' tuning on the behaviour of the system; the design of stopping criteria so that the reliability of the solution found can be somehow estimated and computational cost can be saved; and the development of appropriate techniques to handle constraints, given that the original method is designed for unconstrained optimization problems.

研究动机与目标

• 开发一种适用于广泛优化问题的稳健、通用的PSO优化器。
• 研究PSO参数对算法行为和收敛特性的影响。
• 设计可靠的停止准则，以在解的质量和计算成本之间取得平衡。
• 提出有效的约束处理技术，以将PSO扩展至约束优化问题。
• 通过实证评估展示该方法的高效性、简洁性和可靠性。

提出的方法

• 本文采用标准PSO算法，其速度和位置更新由认知分量和社交分量控制。
• 系统评估参数调优，以确定加速系数和惯性权重的最佳取值。
• 基于收敛度量（如全局最优位置停滞和速度阈值）设计停止准则。
• 提出一种基于惩罚的约束处理技术，整合可行性与目标函数改进。
• 在极简的代码库中实现该算法，强调简洁性和低计算开销。
• 在基准问题上验证该框架，包括约束和不可微函数。

实验结果

研究问题

• RQ1 关键PSO参数（如加速系数和惯性权重）如何影响收敛性和解的质量？
• RQ2 何种停止准则可在最小化不必要的计算的同时确保可靠的解估计？
• RQ3 如何在不损害收敛性或性能的前提下有效处理PSO中的约束？
• RQ4 所提出的PSO变体在多大程度上保持了低计算成本和易于实现的特性？
• RQ5 该方法能否可靠地解决包括非光滑和约束函数在内的广泛优化问题？

主要发现

• 最优参数设置显著提升了收敛速度和解的准确性，惯性权重值约为0.7，加速系数接近1.5–2.0。
• 所提出的停止准则通过检测过早收敛和停滞现象，有效降低了计算成本。
• 基于惩罚的约束处理方法成功引导群体向可行解方向搜索，而无需复杂的修复机制。
• PSO变体实现了极简实现（仅需少量代码行）且仅有少数可调参数，显著提升了易用性。
• 该方法在多种测试问题中表现出稳健性能，包括非凸和约束函数。
• 与其它进化算法相比，该方法取得了具有竞争力的结果，且计算开销显著更低。