Mathematica 9 is now available
Student Support Forum
Student Support Forum: 'Improvement Algorithms for FindShortestTour' topicStudent Support Forum > General > Archives > "Improvement Algorithms for FindShortestTour"

Help | Reply To Topic
Author Comment/Response
11/28/11 12:52pm

Dear readers,
at mathematika there are several options to calculate a ShortestTour.
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!

URL: ,
Help | Reply To Topic