Constrained fractional-order PSO with self-adaptive neighbors and differential mutators
CSTR:
Author:
Affiliation:

Clc Number:

TP16

Fund Project:

  • Article
  • |
  • Figures
  • |
  • Metrics
  • |
  • Reference
  • |
  • Related
  • |
  • Cited by
  • |
  • Materials
  • |
  • Comments
    Abstract:

    Fractional order particle swarm optimization (FOPSO) is an improved particle swarm optimization algorithm with trajectories memory. In the multimodal constrained optimization problem, a neighborhood adaptive constrained fractional order particle swarm optimization (NAFPSO) method was proposed to solve the problem that FOPSO was easy to premature and sensitive to the initial parameters. In the algorithm, the positions and velocities of particles in the swarm were updated by the neighborhood topologies adjusted dynamically according to the evolution state of particles, so as to improve the global optimizing ability and convergence speed. Meanwhile, the penalty function with penalty factor was employed to force the particles to approach the feasible area. The differential mutation strategy was designed to increase the swarm diversity and enhance the particle ability to escape from local optimum. 9 constrained benchmarks were used to test the effectiveness and convergence performance of the proposed algorithm, and then it was applied to 2 constrained engineering design problems. Comparison analysis shows that the proposed algorithm has higher optimization ability, faster convergence, higher accuracy and better stability, and can be applied to solve complex constrained engineering design optimization problems effectively.

    Reference
    Related
    Cited by
Get Citation

苏守宝,李智,何超.邻域自适应的微分变异约束分数阶粒子群优化[J].重庆大学学报,2020,43(11):84~98

Copy
Related Videos

Share
Article Metrics
  • Abstract:
  • PDF:
  • HTML:
  • Cited by:
History
  • Received:August 09,2020
  • Revised:
  • Adopted:
  • Online: December 02,2020
  • Published: November 30,2020
Article QR Code