Knapsack problem is belongs among NP-hard problems, and it is also one of the combinatorial optimization problems. Knapsack problem has wide applications in a lot of fields, so it is meaningful for optimizing the combinatorial optimization problem.In this thesis, an improved algorithm based on probability particle swarm optimization is proposed, which is used for solving
(Read More…)
