Traveling-Salesman-Problem Algorithm Based on Simulated Annealing and Gene-Expression Programming

• Main Authors: Ai-Hua Zhou, Li-Peng Zhu, Bin Hu, Song Deng, Yan Song, Hongbin Qiu, Sen Pan
• Format: Article
• Language: English
• Published: MDPI AG 2018-12-01
• Series: Information
• Subjects: graph traversal optimization; gene-expression programming; simulated annealing algorithm; traveling-salesman problem
• Online Access: http://www.mdpi.com/2078-2489/10/1/7

The traveling-salesman problem can be regarded as an NP-hard problem. To better solve the best solution, many heuristic algorithms, such as simulated annealing, ant-colony optimization, tabu search, and genetic algorithm, were used. However, these algorithms either are easy to fall into local optimization or have low or poor convergence performance. This paper proposes a new algorithm based on simulated annealing and gene-expression programming to better solve the problem. In the algorithm, we use simulated annealing to increase the diversity of the Gene Expression Programming (GEP) population and improve the ability of global search. The comparative experiments results, using six benchmark instances, show that the proposed algorithm outperforms other well-known heuristic algorithms in terms of the best solution, the worst solution, the running time of the algorithm, the rate of difference between the best solution and the known optimal solution, and the convergent speed of algorithms.