Abstract: To improve the convergence speed and accuracy of harmony search (HS) algorithm, a dynamic harmony search algorithm (DHSA) by dynamic adjustment probability mechanism is presented in this paper to settle traveling salesman problem (TSP). In simulation, three classic algorithms, which are genetic algorithm (GA), Harmony Search Algorithm (HSA), and DHSA are selected to verify the feasibility by implementing two TSP data-sets bayg29 and ch150, respectively. The results reveal that the DHSA could obtain the shortest path among these algorithms.

Key words: traveling salesman problem, dynamic regulation probability, harmony search algorithm