By Topic

Predicted Particle Swarm Optimization

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
$33 $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

3 Author(s)
Zhihua Cui ; State Key Laboratory for Manufacturing Systems Engineering, Xi'an Jiaotong University, Xi'an, 710049, P.R.China; Division of System Simulation and Computer Application, Taiyuan University of Science and Technology, 030024, P.R.China, cui ; Jianchao Zeng ; Guoji Sun

The standard particle swarm optimization (PSO) may prematurely converge on suboptimal solution partly because of the insufficiency information utilization of the velocity. The time cost by velocity is longer than position of each particle of the swarm, though the velocity, limited by the constant vmax, only provides the positional displacement. To avoid premature convergence, a new modified PSO, predicted PSO, is proposed owning two different swarms in which the velocity without limitation, considered as a predictor, is used to explore the search space besides providing the displacement while the position considered as a corrector. The algorithm gives some balance between global and local search capability. The optimization computing of some examples is made to show the new algorithm has better global search capacity and rapid convergence rate

Published in:

2006 5th IEEE International Conference on Cognitive Informatics  (Volume:1 )

Date of Conference:

17-19 July 2006