The new technique based on the galaxy based search algorithm for solving the symmetric travelling salesman problem

This paper aims to solve a specific real-world problem, the symmetric travelling salesman problem. The proposed algorithm is based on the concept of the galaxy based search algorithm with the new technique called the clockwise search process. In the first step, introduce new rules to generate the initial solutions. The hill climbing local search is employed to search the new solution in surrounding areas of the initial solutions in the second step. The proposed algorithm use of the clockwise search process to generate more diversity of the new solution. Then, the final step, the hill climbing local search is applied again to increase the local search capabilities. The experiments on the benchmark test sets show that the proposed algorithm can be found the number of best answers more than other comparison.