Solving knapsack problem based on hybrid genetic and simulated annealing algorithm

This paper proposes a hybrid genetic and simulated annealing algorithm for solving knapsack problem.The algorithm uses a modified simulated annealing algorithm as local search procedure,which improves search efficiency.A population updating strategy,which takes both solution quality and diversity of population into account,is used to maintain population diversity.Numerical results show that the proposed algorithm is efficient.