An Adaptive Particle Swarm Optimization Algorithm Based on Directed Weighted Complex Network

Ming Li, Wenqiang Du and Fuzhong Nian

Mathematical Problems in Engineering, 2014, vol. 2014, 1-7

Abstract:

The disadvantages of particle swarm optimization (PSO) algorithm are that it is easy to fall into local optimum in high-dimensional space and has a low convergence rate in the iterative process. To deal with these problems, an adaptive particle swarm optimization algorithm based on directed weighted complex network (DWCNPSO) is proposed. Particles can be scattered uniformly over the search space by using the topology of small-world network to initialize the particles position. At the same time, an evolutionary mechanism of the directed dynamic network is employed to make the particles evolve into the scale-free network when the in-degree obeys power-law distribution. In the proposed method, not only the diversity of the algorithm was improved, but also particles’ falling into local optimum was avoided. The simulation results indicate that the proposed algorithm can effectively avoid the premature convergence problem. Compared with other algorithms, the convergence rate is faster.

Date: 2014
References: Add references at CitEc
Citations: View citations in EconPapers (4)

Downloads: (external link)
http://downloads.hindawi.com/journals/MPE/2014/434972.pdf (application/pdf)
http://downloads.hindawi.com/journals/MPE/2014/434972.xml (text/xml)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:hin:jnlmpe:434972

DOI: 10.1155/2014/434972

Access Statistics for this article

More articles in Mathematical Problems in Engineering from Hindawi
Bibliographic data for series maintained by Mohamed Abdelhakeem ().