Solving The Travelling Salesman Problem by Using Hybrid Simulated Annealing with Tabu Technique

This paper presents a hybrid approach which mainly based on concepts of the simulated annealing algorithm for solving the travelling salesman problem (TSP). This article intends to improve the performance of the original of the simulated annealing algorithm (SA). To enhance the performance of the SA, two new features have been used. 1) The Tabu search is embedded in the simulated annealing algorithm. 2) The two swap techniques are present. The proposed algorithm was evaluated and compared to the other two state-of-the-art algorithms in the literature. The experimental results on 5 sets of well-known standard benchmarks shown that the proposed algorithm is very effective than the comparison methods in term of the average percentage deviation from the lower bound criteria.