emrekumas / travelling_salesman_problem_2opt_solution Goto Github PK
View Code? Open in Web Editor NEWThe travelling salesman problem (TSP) asks the following question: Given a list of cities and the distances between each pair of cities, what is the shortest possible route that visits each city exactly once and returns to the origin city?