Brute force Travelling Salesman Problem in Python I did not make it into work today. A blanket of snow - dubbed the Pest from the West - hit the North of England causing gridlock in many areas. Instead I got to stay at home and write a Travelling Salesman simulation in Python. The Travelling Salesman Problem (TSP) is a problem in Computer Science used to demonstrate intractabilityand optimisation. In short imagine a salesman who wishes to visit every one of N cities exactly once each. The…

Travelling salesman problem - Wikipedia, the free encyclopedia Put 100 flags in a field and time people picking them up, give bonuses for shortest distance. (Part of academic-athletics)

Traveling Salesman Problem - The 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? It is an NP-hard problem in combinatorial optimization, important in operations research and theoretical computer science. TSP is a special case of the travelling purchaser problem.

Visually compares Greedy, Local Search, and Simulated Annealing strategies for addressing the Traveling Salesman problem. Thanks to the Discrete Optimization.