COMPARING THE SOLUTION PERFORMANCES OF THE HEURISTIC AND METAHEURISTIC ALGORITHMS IN TRAVELLING SALESMAN PROBLEM

45327

The aim of this study is to evaluate the solution performances of Traveling Salesman Problem solutions in terms of solution value and duration of heuristic and metaheuristic methods. Within the scope of the study, the integrated nearest neighbor and 2-Opt methods were used as heuristic method, and the Ant Colony Optimization, Tabu Search, Simulated Annealing and Genetic Algorithm methods were used as the metaheuristic methods. The experiments conducted with 16 datasets showed that integrated EYK + 2-Opt method provides the best solutions in terms of average solution values and times. As a result, EYK+2-Opt method is found to be a useful method that can produce fast and efficient solutions in the solution of the Travelling Salesman Problem.

911

Travelling Salesman Problem , Heuristic , Metaheuristic

Abant Sosyal Bilimler Dergisi

932

Abant Sosyal Bilimler Dergisi