I've spent years working with pgRouting and so far he had solved the problems I had needed. With the change to version 2.0, things improved, everything was much more organized and new algorithms that, which gives solution to dissimilar problems were incorporated. My question is related to the new TSP algorithm implementation, and not how to use it. I wish someone would put me an example of how on a network of 200,000 or more lines calculate a route with TSP of 5 0 6 waypoints.
Check the source code in the repository:
* Simulated annealing and a non symetric * Euclidian Traveling Salesman Problem. * Solution based on local search heuristics for * non-crossing paths and nearest neighbors
So it seems there is a simulated annealing algorithm in place: