Hi all,
maybe someone of you can point me in the right direction.
I have an incomplete Graph for which I want a TSP solution.
What I did so far:
1. Convert the graph to be complete
For this I calculate the distance between nodes not having an edge jet, using dijkstra.
Than I add a new edge with this length.
For this I calculate the distance between nodes not having an edge jet, using dijkstra.
Than I add a new edge with this length.
2. Set the distance between start end end node to be zero
3. Run the TSP algorithm
Issue: The TSP is solved but start and end point are never visited one directly after another.
Is this possible at all? I even tried to add a negative distance to the edge between start and end point.
Interestingly here I get a negative length of the route even this edge is not used.
Regards,
Thomas
_______________________________________________ Lemon-user mailing list [email protected] http://lemon.cs.elte.hu/mailman/listinfo/lemon-user
