Improved Simulated Annealing Algorithm Solving for 0/1 Knapsack Problem

0/1 knapsack problem belongs to combination optimization problem. Its optimal solution exists in the problem space including substantially large useless solutions besides optimal solutions. Differing with other SA (simulated annealing) algorithms that getting the approximate optimization solution from the whole problem space often need much computation time, this improved SA algorithm proposed in this paper avoided this disadvantage by extracting two kinds of solution spaces, i.e. all optimal solutions space and the most possible part optimal solutions space, from the whole space. Then to improve approximate solution quality some variables were introduced to record the maximum solution, which produced during annealing process but was possibly deserted because of Metropolis rule in SA. We applied this SA algorithm, general SA and greedy-based SA algorithm to knapsack problem. And experimental results showed that this algorithm only searching the two optimal spaces obtained better approximate results and largely decreased the time overhead compared with the other two algorithms searching whole space