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

Intelligent particle swarm optimization in multiobjective 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
$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)
Zhang Xiao-hua ; Inst. of Intelligent Inf. Process., Xidian Univ., Xi''an ; Meng Hong-yun ; Jiao Li-cheng

How to find a sufficient number of uniformly distributed and representative Pareto optimal solutions is very important for multiobjective optimization (MO) problems. A new model for particle swarm optimization is constructed firstly, and then an intelligent particle swarm optimization (IPSO) for MO problems is proposed based on AER (agent-environment-rules) model, in which competition operator and clonal selection operator are designed to provide an appropriate selection pressure to propel the swarm population towards the Pareto-optimal front. The quantitative and qualitative comparisons indicate that the proposed approach is highly competitive and that can be considered as a viable alternative to solve MO problems

Published in:

Evolutionary Computation, 2005. The 2005 IEEE Congress on  (Volume:1 )

Date of Conference:

5-5 Sept. 2005

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.