Solving the Hard Knapsack Problems with a Binary Particle Swarm Approach

摘要: Knapsack problems are important NP-Complete combinatorial optimization problems. Although nearly all the classical instances can be solved in pseudo-polynomial time nowadays, yet there a variety of test which hard to solve for existing algorithms. In this paper we propose new approach based upon binary particle swarm algorithm (BPSO) find solutions these knapsack The standard PSO iteration equations modified operate discrete space. Furthermore, heuristic operator on total-value greedy is employed into BPSO deal with constrains. Numerical experiments show that proposed outperforms both exact approaches and recent state-of-the-art search heuristics most