From the viewpoint of intensifying convergence and reducing dependency of parameters,a genetic annealing evolutionary algorithm that can be applied for solving knapsack problem is proposed.The algorithm combines the advantages and avoids the disadvantages of genetic algorithm and simulated annealing algorithm.It has superiority in performance,efficiency and reliability.The detailed realization of the algorithm is illustrated.By series of numerical computation and comparison of the results,it can be found that the algorithm is better than the other two algorithms.