【24h】

Optimized PSO algorithm based on the simplicial algorithm of fixed point theory

机译:基于固定点理论单一算法的优化PSO算法

获取原文
获取原文并翻译 | 示例
获取外文期刊封面目录资料

摘要

Particle swarm optimization algorithm (PSO) has been optimized from various aspects since it was proposed. Optimization of PSO can be realized by optimizing its iterative process or the initial parameters and heuristic methods have been combined with the initial PSO algorithm to improve its performance. In this paper, we introduce the Simplicial Algorithm (SA) of fixed point theory into the optimization of PSO and proposed a FP-PSO (Fixed-point PSO) improved algorithm. In FP-PSO algorithm, the optimization of target function is converted into the problem of solving a fixed point equation set, and the solution set obtained by Simplicial Algorithm (SA) of fixed point theory is used as the initial population of PSO algorithm, then the remaining parameters can be obtained accordingly with classical PSO algorithm. Since the fixed point method has sound mathematical properties, the initial population obtained with FP-PSO include nearly all the approximate local extremes which maintain the diversity of population and can optimize the flight direction of particles, and shows their advantages on setting other initial parameters. We make an experimental study with five commonly used testing functions from UCI (University of California Irvine) which include two single-peak functions and three multi-peak functions. The results indicate that the convergence accuracy, stability, and robustness of FP-PSO algorithm are significantly superior to existing improve strategies which also optimize PSO algorithm by optimizing initial population, especially when dealing with complex situations. In addition, we nest the FP-PSO algorithm with four classical improved PSO algorithms that improve PSO by optimizing iterative processes, and carry out contrast experiments on three multi-peak functions under different conditions (rotating or non-rotating). The experimental results show that the performance of the improved algorithm using nested strategy are also significantly enhanced compared with these original algorithms.
机译:粒子群优化算法(PSO)已经从各个方面进行了优化,因为提出了它。通过优化其迭代过程或初始参数和启发式方法可以与初始PSO算法结合以提高其性能来实现PSO的优化。在本文中,我们将固定点理论的单纯算法(SA)介绍到PSO优化中,提出了一种改进FP-PSO(定点PSO)改进算法。在FP-PSO算法中,将目标函数的优化转换为求解一个固定点等式集的问题,并且通过固定点理论的单纯算法(SA)获得的解决方案集用作PSO算法的初始群体,然后通过古典PSO算法,可以获得剩余的参数。由于定点方法具有声音数学特性,因此使用FP-PSO获得的初始群体包括几乎所有近似的局部极端,它们保持群体的多样性,并且可以优化粒子的飞行方向,并显示其在设置其他初始参数上的优势。我们采用来自UCI(加州大学Irvine)的五种常用的测试功能进行了实验研究,包括两个单峰函数和三个多峰函数。结果表明,FP-PSO算法的收敛准确性,稳定性和鲁棒性显着优于现有的改进策略,该策略还通过优化初始群体优化PSO算法,特别是在处理复杂情况时。此外,我们用四种经典改进的PSO算法嵌套FP-PSO算法,通过优化迭代过程来改善PSO,并在不同条件下进行三个多峰函数的对比实验(旋转或非旋转)。实验结果表明,与这些原始算法相比,使用嵌套策略的改进算法的性能也显着提高。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号