顺序表示编码的和声退火混合算法求解TSP

Ordinal Representation Coding Hybrid Heuristics Based on Harmony Search and Simulated Annealing Algorithm for TSP

和声搜索是一种新的启发式优化算法,针对和声搜索算法容易陷入局部最优的缺陷,将其与模拟退火算法结合,得到了一种混合算法,为了保证和声的产生过程中不出现非法解,算法采用了基于顺序表示的编码方法.实验表明,混合算法针对TSP问题具有较高的求解质量.

Harmony search（HS）is a new heuristic optimization method.But pure HS may produce premature and poor results.Based on the complementary strengths of HS and simulated annealing（SA）algorithm,a hybrid procedures are put forward by combining the HS and SA.In order to ensure there is no illegal solution in the process of generation of harmony,the newly designed hybrid algorithm use ordinal representation coding one harmony.The experiments show that within the framework of the newly designed hybrid algorithm,the NP-hard classic Traveling salesman problem can be efficiently solved with higher quality.