A Greedy Particle Swarm Optimization for Solving Knapsack Problem

For solving knapsack problem (KP) with binary particle swarm optimization, this paper firstly proposes a new greedy transform method and gives a kind of effective implement algorithm. Then it combines the greedy transform method with binary particle swarm optimization with double-structure coding, advanced a new algorithm for solving KP: Greedy Particle Swarm Optimization (GPSO) which is a hybrid evolution algorithm. For a famous KP instance, GPSO got the best solution of the instance as far as know. It indicates that GPSO algorithm is a new and more effective method for knapsack problem.