bench
08-09-2004, 08:32 PM
Hello there.
I recently hacked up the simulated annealing code in 10.9 to make in n-dimensional. Nifty. It even seems to work. :)
Unfortunately, this being the first annealing code I've used (besides the trivial example), I wasn't prepared for the runtime of the traveling salesman with 80000 cities placed in 42 dimensions. (Yes, I know I'm trying to solve a hard problem, but I was hoping this would be faster at it. :) )
Has anybody made this algorithm distributed/threaded? I can get a lot of procs if I can use them, but none faster than 2.8GHz, and as it stands the algorithm is nicely serialized to use only one. A little web searching lets me know that distributed annealing algortihms exist, but I can't seem to find code for them.
I recently hacked up the simulated annealing code in 10.9 to make in n-dimensional. Nifty. It even seems to work. :)
Unfortunately, this being the first annealing code I've used (besides the trivial example), I wasn't prepared for the runtime of the traveling salesman with 80000 cities placed in 42 dimensions. (Yes, I know I'm trying to solve a hard problem, but I was hoping this would be faster at it. :) )
Has anybody made this algorithm distributed/threaded? I can get a lot of procs if I can use them, but none faster than 2.8GHz, and as it stands the algorithm is nicely serialized to use only one. A little web searching lets me know that distributed annealing algortihms exist, but I can't seem to find code for them.