4.5 Article

Parallel quantum-behaved particle swarm optimization

Journal

Publisher

SPRINGER HEIDELBERG
DOI: 10.1007/s13042-013-0168-2

Keywords

Quantum-behaved particle swarm optimization; Master-slave; Static subpopulation; Shape identification

Funding

  1. Bursary of the University of Greenwich, The Fundamental Research Funds for the Central Universities'' [JUSRP21012]
  2. innovative research team project of Jiangnan University [JNIRT0702]
  3. National Natural Science Foundation of China [60973094]

Ask authors/readers for more resources

Quantum-behaved particle swarm optimization (QPSO), like other population-based algorithms, is intrinsically parallel. The master-slave (synchronous and asynchronous) and static subpopulation parallel QPSO models are investigated and applied to solve the inverse heat conduction problem of identifying the unknown boundary shape. The performance of all these parallel models is compared. The synchronous parallel QPSO can obtain better solutions, while the asynchronous parallel QPSO converges fast without idle waiting. The scalability of the static subpopulation parallel QPSO is not as good as the master-slave parallel model.

Authors

I am an author on this paper
Click your name to claim this paper and add it to your profile.

Reviews

Primary Rating

4.5
Not enough ratings

Secondary Ratings

Novelty
-
Significance
-
Scientific rigor
-
Rate this paper

Recommended

No Data Available
No Data Available