Traveling Salesman Problem

Post by **TheCatt** » Thu Feb 01, 2007 4:41 pm

I vaguely remember Malcolm attacking this one recently and was wondering if anyone had any basic thoughts on it.

I took a genetic algorithm approach, but haven't been able to find good info on how "good" the final answer is, effects of population size/mutation rates, etc.

It's only a 100-point problem, so I was kinda hoping to find "the" answer or something close.

Post by **thibodeaux** » Thu Feb 01, 2007 5:02 pm

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

Post by **TheCatt** » Thu Feb 01, 2007 5:08 pm

Yeah, read that.

I'm not so smart.

Malcolm · Post by **Malcolm** » Mon Feb 26, 2007 11:56 am

TheCatt wrote:I vaguely remember Malcolm attacking this one recently and was wondering if anyone had any basic thoughts on it.

I took a genetic algorithm approach, but haven't been able to find good info on how "good" the final answer is, effects of population size/mutation rates, etc.

It's only a 100-point problem, so I was kinda hoping to find "the" answer or something close.

I'm using simmulated annealing. I can talk this problem to death. What do you want to know?

Post by **TheCatt** » Mon Feb 26, 2007 1:13 pm

How to get the exact right answer.

Post by **thibodeaux** » Mon Feb 26, 2007 1:23 pm

I assume you mean "the" answer for this particular instance of the problem, and not something like a closed for solution or something.

Post by **TheCatt** » Mon Feb 26, 2007 3:25 pm

Right.

Like all this stuff on linear programming that's supposed to be able to do small ones really easily. How? I couldn't even find a good example to start with.