基于和声搜索和模拟退火的混合算法解决TSP问题

HYBRID HEURISTICS BASED ON HARMONY SEARCH AND SIMULATED ANNEALING ALGORITHM FOR TRAVELLING SALESMAN PROBLEM

和声搜索是一种新的启发式优化算法,算法模拟了音乐创作中乐师们凭借自己的记忆,通过反复地调整乐队中各乐器的音调,最终能达到一个美妙的和声状态的过程。针对和声搜索算法容易陷入局部最优的缺陷,将其与模拟退火算法结合,得到了两种混合算法。实验表明混合算法针对TSP问题具有较高的求解质量。

Harmony search （HS） is a new heuristic optimization method imitating the music improvisation process where musicians adjust repeatedly their instruments＇ pitches on their memory searching for a final perfect state of harmony. But pure HS may fall into local optimum. To overcome this defect, based on the complementary strengths of HS and simulated annealing （SA） algorithm, two hybrid procedures are put forward by combining the HS and the SA. The experiments show that with the hybrid algorithm, the travelling salesmen problem can be efficiently solved with higher quality.