By Topic

Multi-objective Particle Swarm Optimization Method Based on Fitness Function and Sequence Approximate Model

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

3 Author(s)
Zhan Si Jiang ; Dept. of Mech. & Electr. Eng., Gui Lin Univ. of Electron. Technol., Gui Lin, China ; Jia Wei Xiang ; Hui Jiang

Heuristic search methods usually require a large amount of evolutionary iterative calculation, which has become a bottleneck for applying them to practical engineering problems. In order to reduce the number of analysis of heuristic search methods, a Pareto multi-objective particle swarm optimization (MOPSO) method is presented. In this approach, Pareto fitness function is used to select global extremum particles. And the solution accuracy and efficiency are balanced by adopting sequence approximate model. Research shows that the method can ensure the accuracy of calculation, at the same time help to reduce the number of accurate analysis.

Published in:

Genetic and Evolutionary Computing, 2009. WGEC '09. 3rd International Conference on

Date of Conference:

14-17 Oct. 2009