摘要：Background and Objective: The Travelling Salesman Problem (TSP) is a challenging problem in combinatorial optimization whose main purpose is to find the shortest path reaching all interconnected cities by straight lines. In spite of many available heuristic methods for solving TSPs, no attempts have been made to evaluate and compare their performances. The purpose of this study is to carry out a comparative evaluation study on Simulated Annealing (SA) and several variation of Tabu Search (TS). Materials and Method: This study considers four heuristic methods, i.e., Simulated Annealing (SA), conventional Tabu Search (TS), Improved Tabu Search (ITS) and modified Reactive Tabu Search (RTS) to solve symmetric TSPs. The algorithms were tested on five chosen benchmark problems. Their performances were compared and the appropriate algorithm for solving TSPs was then identified. The solution quality was evaluated using empirical testing, benchmark solutions and probabilistic analyses. Results: The analysis of computational results showed that the modified RTS algorithm provided a better solution quality in terms of minimizing the objective function of TSPs, while the SA algorithm was useful for obtaining instant solutions for TSPs with a large number of cities. The modified RTS algorithm also performed better compared to the existing heuristic methods. Conclusion: This study has explored the most effective heuristic method for solving TSPs based on the intended solution quality. The algorithms proposed in this study should be considered in solving symmetric travelling salesman problems.
