一种求解背包问题的更贪心粒子群算法

ombining particle swarm optimization algorithm and greed idea, a Very Greedy Particle Swarm Optimization algorithm (VGPSO) is proposed for knapsack problem (KP). The strategy of dealing the overweight particle is to take out the enclosed and the worst goods in ratio between value and weight, until to satisfy the weight constraint. Simultaneously, the question of sensitive parameter’s choice is avoided under this measure. The strategy of managing the feasible particle is to enclose the goods which is out of knapsack and best in ratio between value and weight, until none goods can be put into. Based on the classic instances in the reference numerical experiments are made and compared with other algorithms. The VGPSO is better than hybrid genetic algorithm (HGA), greedy genetic algorithm (GGA) and greed binary particle swarm optimization algorithm (GBPSOA) in Ref.[1,2] in the ability of finding optimal solution, the efficiency and the robustness.