Travelling Salesman (TSP) Art in Python
There is already a lot of existing work on this topic 1, but especially the book from Robert Bosch 2 inspired me to embark on my own journey.
It became an rewarding and entertaining melange of “Mathematical Optimization” and playful programming while exploring new concepts and building a basic theoretical foundation for one of the most famous problems in mathematical optimization.
The Travelling Salesman Problem (TSP)
Starting from his home, a salesman wishes to visit each of \((n − 1)\) cities and return home at minimal cost. He must visit each city exactly once and it costs \(c_{ij}\) to travel from city \(i\) to city \(j\). What route should he select?
Comments
Nothing yet. Say the first thing.
Sign in to join the conversation.