Akademik Veri Yönetim Sistemi
1st International Conference on Engineering, Natural and Social Sciences, Konya, Türkiye, 20 - 23 Aralık 2022, ss.150
The traveling salesman problem is one of the NP-hard and complex problems in optimization, which is also used to test the performance of new algorithms. In the traveling salesman problem, the salesman starts from one city and must pass through all the other cities in the shortest route. In this paper, we investigate the traveling salesman problem using the mutation approach in the meta-heuristic algorithm of the Grasshopper Optimization Algorithm (GOA). First, we run the traveling salesman problem (for 20 cities) using the grasshopper optimization algorithm without using the mutation operator, which results in a cost value of 385.5662. Then we use the grasshopper optimization algorithm with the mutation approach to three different methods of swap, reversion, and insertion, as a result of which the cost value obtained is 370.8141, 342.155, and 338.9917 respectively. By examining the obtained results, the grasshopper optimization method with the insertion-mutation approach for solving the traveling salesman problem has the best results compared to other methods.