By Topic

An Improved Particle Swarm Optimization for Knapsack Problem

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

1 Author(s)
Fangguo He ; Coll. of Math. & Inf. Sci., Huanggang Normal Univ., Huanggang, China

The knapsack problem is formulated as a discrete optimization problem. In this paper, a solution strategy based on an improved binary PSO is presented. It applies new update functions and the strategy of disturbance to deals with the knapsack problem. Furthermore, a penalty function is suggested to change constrained problem into an unconstrained one. The example shows that this algorithm has a faster convergence rate and a higher rate of success to solve the knapsack problem.

Published in:

Computational Intelligence and Software Engineering, 2009. CiSE 2009. International Conference on

Date of Conference:

11-13 Dec. 2009