By Topic

Particle swarm optimization for nonlinear 0-1 programming 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
$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

4 Author(s)
Takeshi Matsui ; Department of Artificial Complex Systems Engineering, Graduate School of Engineering, Hiroshima University, Japan ; Masatoshi Sakawa ; Kosuke Kato ; Takeshi Uno

In this research, focusing on nonlinear 0-1 programming problems, we propose an approximate solution method based on particle swarm optimization proposed by Kennedy et al. To be more specific, we develop a new particle swarm optimization method which is applicable to discrete optimization problems by incorporating new methods for generating initial search points and move schemes. Furthermore, we show the efficiency of the proposed particle swarm optimization method by comparing it with existing methods through the application of them into the numerical examples.

Published in:

Systems, Man and Cybernetics, 2008. SMC 2008. IEEE International Conference on

Date of Conference:

12-15 Oct. 2008