Normally, Simulated Annealing (SA) is used in TSP problem to find the near-to-optimal solution, and the graph structure in TSP is a complete graph. Therefore, I want to know whether or not I can use SA for finding the shortest path/optimal solution in a non-complete(connected undirected) weighted graph in the 2 dimentional Euclidean space.
If I cannot use SA in this case, could you recommend me a good algorithm for this? *** Note: the weight here is referred to the weight on each node, not edge weight.
Thanks in advanced!