A hybrid genetic algorithm to solve zero-one knapsack problem

Abstract

In order to overcome the disadvantages of the traditional genetic algorithm and improve the speed and precision of the algorithm, the author improved the selection strategy, integrated the greedy algorithm with the genetic algorithm and formed the hybrid genetic algorithm. The paper discussed the basic idea and method to solve the zero-one knapsack problem using this hybrid genetic algorithm. The experiments prove the feasibility and validity of the algorithm. © 2011 Springer-Verlag.