Hybrid Algorithm Based on Discrete Harmony Search and Simulated Annealing
Junqing Li · Jisuanji gongcheng · 2009
Harmony Search(HS) is a heuristic optimization method.To make HS algorithm be able to apply to the combinatorial optimization problem, a Discrete Harmony Search(DHS) algorithm is proposed.Two improvements of the DHS algorithm are described.The pure DHS algorithm may produce premature and poor results.In order to avoid premature convergence and poor results in DHS, based on the complementary strengths of DHS and Simulated Annealing(SA) algorithm, a hybrid strategy of HS and SA is put forward.Experimental results show that within the framework of the newly designed hybrid algorithm, the NP-hard classic Traveling Salesman Problem(TSP) can be efficiently solved with higher quality.