By Topic

A New Parallel Algorithm of Adaptive QPSO to Solve Constrained Optimization Problems

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Yang Liu ; Dept. of Inf. Sci. & Technol., TaiShan Univ., Tai''an ; Yan Ma

Parallel and adaptability are introduced in the algorithm of quantum-behaved PSO in this paper, which is named PAQPSO and used to solve the CO problem. The PAQPSO outperforms QPSO and AQPSO in global search ability and local search ability, because the parallel and adaptive method is more approximate to the learning process of social organism with high-level swarm intelligence and can make the population evolve persistently. We adopt a non-stationary multi-stage assignment penalty in solving constrained problem to improve the convergence and gain more accurate results. This approach is tested on several accredited benchmark functions and the experiment results show much advantage of PAQPSO to AQPSO, QPSO and the traditional PSO (Particle Swarm Optimization). And the running time is also decreased in proximity linear.

Published in:

Genetic and Evolutionary Computing, 2008. WGEC '08. Second International Conference on

Date of Conference:

25-26 Sept. 2008