Ordinal Representation Coding Hybrid Heuristics Based on Harmony Search and Simulated Annealing Algorithm for 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.