This article will show a (rare!) practical problem I worked on, namely automating the discovery of the order in which to visit a list of addresses, all in the same city, Milan, and moving by car, in order to reduce the travel time.

This problem is called Traveling Salesman Problem and is a famous one in computer science because of its exponential complexity. In reality, I do not need the best solution, just a good one, and the complexity truly comes from the practicality of extracting the graph and finding the addresses.