Re: can anybody please point me to a good simulated annealing C/C++ code?

On Jul 23, 10:16 pm, Lionel B <m...@xxxxxxxxxxx> wrote:
spaces. I used to research genetic algorithms and can honestly say [dons
flameproof suit...] that I never encountered a search problem for which
the most lovingly crafted GA could outperform a well-tuned simulated
annealer. But be warned, tuning SA parameters for a particular problem is
(in common with many other "general-purpose" search algorithms such as
GAs) something of a "black art".

I've developed a very simple alternative to SA;
principle advantage being that it largely self-tunes.
The problem with SA you mention makes it difficult
for me to test whether my method is easier/better
than SA. It would be nice to have some standard
test suite to make a comparison....

James Dow Allen

.