Design and Simulation of Simulated Annealing Algorithm with Harmony Search

Harmony search is a new heuristic optimization algorithm. Comparing with other algorithms, this algorithm has very strong robustness and can be easily operated. Combining with the features of harmony search, an improved simulated annealing algorithm is proposed in this paper. It can improve the speed of annealing. The initial state of simulated annealing and new solutions are generated by harmony search. So it has the advantage of high quality and efficiency. The simulation results show that this new algorithm has faster convergence speed and better optimization quality than the traditional simulated annealing algorithm and other algorithms.