A New Hybrid Particle Swarm Optimization and Greedy for 0-1 Knapsack Problem

Abstract

This paper proposes a new binary particle swarm optimization with a greedy strategy to solve 0-1 knapsack problem. Two constraint handling techniques are consider to cooperation with binary particle swarm optimization that are penalty function and greedy. The sigmoid transfer function is used to convert real code to binary code. The experimental results have proven the superior performance of the proposed algorithm.