Cart (Loading....) | Create Account
Close category search window
 

A Quantum-Based Particle Swarm Optimization Algorithm Applied to Inverse 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

4 Author(s)
Ho, S.L. ; Dept. of Electr. Eng., Hong Kong Polytech. Univ., Hong Kong, China ; Shiyou Yang ; Guangzheng Ni ; Jin Huang

To balance exploration and exploitation searches in order to prevent premature convergences in Particle Swarm Optimization (PSO) algorithms, an improved Quantum-based PSO (QPSO) algorithm is proposed with an ultimate goal of preserving the simplicities of available QPSOs. The improvements include the design of diversification and intensification phases, searching mechanisms and a strategy to shift away from the worst solutions. The proposed QPSO are compared to available optimizers on two case studies to showcase its merits.

Published in:

Magnetics, IEEE Transactions on  (Volume:49 ,  Issue: 5 )

Date of Publication:

May 2013

Need Help?


IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.