This is the authors' abstract. We don't add key points for this paper.
Heuristic solution methods for combinatorial optimization problems are often based on local neighborhood searches. These tend to get trapped in a local optimum and the final result is often heavily dependent on the starting solution. Simulated annealing methods attempt to avoid these problems by randomizing the procedure so as to allow for occasional changes that worsen the solution. In this paper we provide probabilistic analyses of different designs of these methods.
Answers are grounded in this paper and cite their sources.
No takes yet. Share an insight, caveat, or question.
Anily et al. (1987) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: