implementing several searches on my code (Brute force, random and heuristic)

[9966]

Well previously I've asked a lot of question regarding Travelling Salesman Problem and I got a lot of helpful feedback from here. Thanks again for helping me.

Now I've completed the full code. Basically I'm implementing several searches on my code (Brute force, random search and heuristic search). So now I've to do some literature review on other searches that can also be implemented to solve this problem. Well, I'm not experienced in other searches so I would like to ask is there other types of searches that can be implemented to solve this problem too? I don't need a full code, neither I'm asking you all to help me completely in my assignments. I just need some suggestions that you think it's suitable to solve TSP problem. The rest of the info I'll try to look from internet regarding the details of the suggested search.

Thank you for any advice given.

[Ganon11]

This website has a lot of helpful links and some basic explanations of search algorithms:

http://en.wikipedia.org/wiki/Search_algorithm

[JosAH]

For the TSP problem quite a bit of 'local search' heuristics have been developed.
The simplest of those are the n-opt algorithms, typically 2-opt and 3-opt. A more
sophisticated local search n-opt algorithm is the Lin Kernighan heuristic. I'm sure
Google can tell you all about them.

kind regards,

Jos

[pbmods]

Changed thread title to better describe the problem (did you know that threads whose titles do not follow the Posting Guidelines actually get FEWER responses?).