TSP with simulated annealing

Using simulated annealing you can “almost” solve hard problems like the traveling salesman problem quite fast. Some sample code/data at my github repository. Also a graphic representation here and here. Both are using driving distances, the USA dataset was generated from Google Maps API, and is not symmetric, that is the distance between A and B is not always the same as between B and A, funny detail that uncover a bug (by design) of the original code.