Abstract:

Traveling Salesman Problem aims to find the shortest route among n cities nodes customers branches etc with known distances between each city where the salesman leaves a city visits each of the cities exactly once and returns back to the starting point The traveling salesman problem one of the very important NP hard problems in optimization has wide application areas including distribution planning logistics and it has been studied by researchers and academicians for decades In this paper a genetic algorithm has been applied to solve the traveling salesman problem and a real world application of the study has been implemented on a food delivery firm in Adana The routes that the firm already uses and the routes that are found using genetic algorithms are compared to illustrate the efficiency of the algorithm Keywords: Traveling salesman problem genetic algorithms metaheuristic methods

Keywords: