Dynamic Population Cooperative: Particle Swarm Optimization for Global Optimization Problems

Dynamic Population Cooperative: Particle Swarm Optimization for Global Optimization Problems

Wei Li, Cisong Shi, Qing Xu, Ying Huang
Copyright: © 2022 |Pages: 20
DOI: 10.4018/IJSIR.313664
OnDemand:
(Individual Articles)
Available
$37.50
No Current Special Offers
TOTAL SAVINGS: $37.50

Abstract

Particle swarm optimization (PSO) has attracted wide attention in the recent decade. Although PSO is an efficient and simple evolutionary algorithm and has been successfully applied to solve optimization problems in many real-world fields, premature maturation and poor local search capability remain two critical issues for PSO. Therefore, to alleviate these disadvantages, a dynamic population cooperative particle swarm optimization for global optimization problems (DPCPSO) is proposed. Firstly, to enhance local search capability, an elite neighborhood learning strategy is constructed by leveraging information from elite particles. Meanwhile, to make the particle easily jump out of the local optimum, a crossover-mutation mechanism is utilized. Finally, a dynamic population partitioning mechanism is designed to balance exploration and exploitation capabilities. 16 classic benchmark functions and 1 real-world optimization problem are used to test the proposed algorithm against with 6 typical PSO algorithms. The experimental results show that DPCPSO is statistically and significantly better than the compared algorithms for most of the test problems. Moreover, the convergence speed and convergence accuracy of DPCPSO are also significantly improved. Therefore, the algorithm is highly competitive in solving global optimization problems.
Article Preview
Top

In standard PSO, each particle has its own velocity and position. The velocity is guided by the global optimal particle and the individual historical optimal particle, it determines the direction and distance the particle position moves. The position of each particle means one of the solutions. In the iterative process, the ith particle updates its velocity and position according to Eq (1) and Eq (2).

IJSIR.313664.m01
(1)
IJSIR.313664.m02
(2) where IJSIR.313664.m03,IJSIR.313664.m04 is the population size and IJSIR.313664.m05 is the problem dimension, IJSIR.313664.m06is the inertia weight, IJSIR.313664.m07 are the two acceleration coefficients, IJSIR.313664.m08 are two random numbers in the range 0 to 1, IJSIR.313664.m09 is individual historical optimal solutions,IJSIR.313664.m10 is the optimal solution for the overall population.

Complete Article List

Search this Journal:
Reset
Volume 15: 1 Issue (2024)
Volume 14: 3 Issues (2023)
Volume 13: 4 Issues (2022)
Volume 12: 4 Issues (2021)
Volume 11: 4 Issues (2020)
Volume 10: 4 Issues (2019)
Volume 9: 4 Issues (2018)
Volume 8: 4 Issues (2017)
Volume 7: 4 Issues (2016)
Volume 6: 4 Issues (2015)
Volume 5: 4 Issues (2014)
Volume 4: 4 Issues (2013)
Volume 3: 4 Issues (2012)
Volume 2: 4 Issues (2011)
Volume 1: 4 Issues (2010)
View Complete Journal Contents Listing