DocumentCode
2809103
Title
An Improved Particle Swarm Optimization for Knapsack Problem
Author
He, Fangguo
Author_Institution
Coll. of Math. & Inf. Sci., Huanggang Normal Univ., Huanggang, China
fYear
2009
fDate
11-13 Dec. 2009
Firstpage
1
Lastpage
4
Abstract
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.
Keywords
knapsack problems; particle swarm optimisation; discrete optimization problem; improved particle swarm optimization; knapsack problem; penalty function; Birds; Concrete; Dynamic programming; Educational institutions; Helium; Information science; Investments; Mathematics; Particle swarm optimization; Resource management;
fLanguage
English
Publisher
ieee
Conference_Titel
Computational Intelligence and Software Engineering, 2009. CiSE 2009. International Conference on
Conference_Location
Wuhan
Print_ISBN
978-1-4244-4507-3
Electronic_ISBN
978-1-4244-4507-3
Type
conf
DOI
10.1109/CISE.2009.5362891
Filename
5362891
Link To Document