Skip to Main Content
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.