I want to solve a TSP problem on a set of points from a road network (given N points, find the shortest possible route to visit them all). It seems that pgrouting pgr_tsp function doesn't take into account roads existence - it simply estimates Euclidian distance between the points, so it's like walking by a straight line.
Is there a way to achive what I want with pgrouting? I saw something like tsp_dijkstra function in the old release, but, it's now removed and I cannot find a documentation for it.
Or maybe there're other tools (not pgrouting)?