Solving 0-1 Knapsack Problem Based on Genetic Algorithm with Improved Simulated Annealing

The paper brings in simulated annealing to improve the performance of genetic algorithms. The algorithm combines the advantages and avoids the disadvantages of genetic algorithm and simulated annealing algorithm. It has superiority in performance, efficiency and reliability. This algorithm is used to solve 0-1 knapsack problem on different scaled datasets, and the results is better than either genetic algorithm or simulated annealing algorithm.