Can Heuristic repair algorithm (or it's modification) be applied to Traveling Sales Person problem ? My gut feeling is that it can. But I have no idea - what cost(s)/conflicts should be minimized. Maybe we should try to re-connect edge so that number of intersections with other edges is minimal ? Still, this only one constraint will not guarantee shortest path - it can be seen that we can construct a path without edge intersections at all, albeit it will be sub-optimal (like a zig-zag). So, what is "number of conflicts" in Heuristic repair of TSP problem ?