Dynamic Particle Swarm Optimization with Any Irregular Initial Small-World Topology

Dynamic Particle Swarm Optimization with Any Irregular Initial Small-World Topology

Shuangxin Wang (School of Mechanical, Electronic and Control Engineering, Beijing Jiaotong University, Beijing, China), Guibin Tian (School of Mechanical, Electronic and Control Engineering, Beijing Jiaotong University, Beijing, China), Dingli Yu (School of Engineering, Liverpool John Moores University, Liverpool, UK) and Yijiang Lin (School of Mechanical, Electronic and Control Engineering, Beijing Jiaotong University, Beijing, China)
Copyright: © 2015 |Pages: 23
DOI: 10.4018/IJSIR.2015100101
OnDemand PDF Download:
No Current Special Offers


It is realized that the topological structure of the particle swarm optimization (PSO) algorithm has a great influence on its optimization ability. This paper presents a new dynamic small-world neighborhood PSO (D-SWPSO) algorithm whose neighbourhood structure can be constructed with any irregular initial networks. The choice of the learning exemplar is not only based upon the big clustering coefficient and the average shortest distance for a regular network, but also based upon the eigenvalues of Laplacian matrix for irregular networks. Therefore, the D-SWPSO is a PSO algorithm based on small-world topological neighbourhood with universal significance. The proposed algorithm is tested by some typical benchmark test functions, and the results confirm that there is a significant improvement over the basic PSO algorithm. Finally, the algorithm is applied to a real-world optimization problem, the economic dispatch on the IEEE30 system with wind farms. The results demonstrate that the proposed D-SWPSO is a practically feasible and effective algorithm.
Article Preview

1. Introduction

Particle swarm optimization algorithm (PSO) is a stochastic global optimization algorithm which came of the research on bird flock preying behavior by sharing information and competing between individuals in the population (Kennedy & Eberhart, 1995). Using particles to represent potential solutions within the search space, PSO is a good candidate for dealing with collaborative optimization problem because of its simplicity and fast convergence to the optimum (Barrera & Coello, 2009). Although it is possible to solve the problems that the function to be optimized has multiple global optima or one global optimum with many local optima in the search space, when solving complicated large-scale nonlinear programming or multimodal problems, it may be easily trapped in a local minimum (Liang, 2006; Passaro, 2008; Liu, 2009).

The topological structure plays a key role in information flowing and transferring within a particle swarm. By use of the hybrid algorithm on simulated annealing and heuristic search to randomly generate 1343 kinds of topologies in particle swarm network, and after testing for different ones, Kennedy & Mendes (2006) revealed that the topology structure of the particles’ neighborhood has considerable influence on optimization performance of the PSO algorithm, and the best neighborhood topology of the particle is not fixed. Subsequently, they confirmed five kinds of basic topology structure were All, Ring, Square, Four clusters and Pyramid type. As Kennedy & Mendes (2002) proved that the higher the connectivity of particle swarm network topology is, the more unfavorable its global optimization ability would be, Mendes et al. (2004) further proposed a local neighborhood topology structure. Although its convergence speed is slow, it is doubtlessly uneasy to fall into local bests and avoided the premature phenomenon. Afterwards, researches concerning population topology were focused. For example, Haruna and Yoshifumi (2009) proposed a network-structured PSO (NS-PSO) with various neighborhood topologies; Lu and Chen (2014) introduced a fuzzy logic parameter tuning system to adjust the constraints in PSO. More results concerning connected topology had better abilities to improve the performance of PSO algorithms (Marco, 2009; Ni, 2013; Chen, 2012).

Recently, studies based on small-world model are getting more and more attention. Cui et al. (2009) proposed a nearest neighbor interaction PSO based on small-world model. Gong & Zhang (2013) presented a small-world particle swarm optimization with topology adaptation. Liu & Niu (2014) examined an improved PSO with small-world topology and comprehensive learning strategy in which the learning exemplar of each particle includes the global best particle, personal best particle, and the best particle of its neighborhood.

However, previous studies on the local neighborhood topology structure did not give the quantitative analysis of correlation and coordination between individual particle and other particles. Besides, they did not construct the neighborhood structure based on any irregular initial networks. How to get a way to design the topological structure according to the concept of complex network or method of graph theory and explore the potential of PSO for multimodal optimization is a key problem we are going to tackle.

Complete Article List

Search this Journal:
Open Access Articles: Forthcoming
Volume 13: 4 Issues (2022): Forthcoming, Available for Pre-Order
Volume 12: 4 Issues (2021): 2 Released, 2 Forthcoming
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