| Author |
Comment/Response |
Christina
|
 11/28/11 12:52pm
Dear readers,
at mathematika there are several options to calculate a ShortestTour. http://reference.wolfram.com/mathematica/ref/FindShortestTour.html
Normally one has to calculate first a Constructive heuristics(Greedy or CCA) and than an improvement heuristic (Or-Opt,Two-Opt...)
Like it can be seen in the examples one can give in directly an improvement Algorithms and Mathematika will give the result.
Example:{len, tour} = FindShortestTour[pts[10], Method -> "OrOpt"]
My question is now: on what Constructive heuristic does the improvement algorithms base on? I guess first mathematika has to calculate a first solution and than it uses a improvement one. What is the name of the constructive heuristic. I could not find any information about this.
Thank u in advance!
Chrissi
URL: , |
|
