A Hybrid BPSO-GA Algorithm for 0-1 Knapsack Problems

Abstract

0-1 knapsack problems (KPs) is a typical NP-hard problem in combinatorial optimization problem. For the sake of efficiency, it becomes increasingly popular for researchers to apply heuristic techniques to solve the 0-1 KPs. Due to its simplicity and convergence speed, an increasing number of techniques based on binary particle swarm optimization (BPSO) has been presented. However, BPSO-based techniques suffered from a major shortcoming which is the premature convergence of a swam. To address the problem, this paper proposed a hybrid BPSO-GA algorithm which combines the strengths of BPSO and genetic algorithm (GA). Experimental results show that our proposal is able to find more optimal solutions than BPSO-based algorithm.