TSP_GA
Solving Traveling Salesman Problem (TSP) using Genetic Algorithm with python
Travelling Salesman Problem (TSP): Given a set of cities and distance between every pair of cities, the problem is to find the shortest possible route that visits every city exactly once and returns to the starting point.
Eight cities in Turkey, are considered, and Istanbul is the start sity. Distances between every city pair are taken from google maps.
Feel free to ask me any related questions.