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

Particle swarm optimization algorithm based on divided-interval chaotic search

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)
Qiushi Xu ; Shenyang Univ. of Technol., Shenyang ; Xiangdong Wang

Though chaotic particle swarm optimization algorithm lets particles search in the whole variable space, the search scale is too large and the high precision of solution is hard to achieve. This paper proposes a particle swarm optimization algorithm based on divide-interval chaotic search, it lets the particles search in the selected interval, reduces the scope of the search space, and makes the solution more approximate to the global optimum. And the comparable experiment shows that the algorithm has preferable results.

Published in:

Bio-Inspired Models of Network, Information and Computing Systems, 2007. Bionetics 2007. 2nd

Date of Conference:

10-12 Dec. 2007

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.