Simulated annealing, random search, MultiStart or SAD?
The convergence properties of simulated annealing are compared to those of other general purpose global optimization algorithms on some simple examples. It appears that simulated annealing is frequently outperformed by the other procedures. Tentative analytical justifications are proposed and some implementation issues are discussed.
scientific article; zbMATH DE number 3987066