Title: Simulated annealing methods with general acceptance probabilities
Abstract: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 de...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.Read More
Publication Year: 1987
Publication Date: 1987-09-01
Language: en
Type: article
Indexed In: ['crossref']
Access and Citation
Cited By Count: 149
AI Researcher Chatbot
Get quick answers to your questions about the article from our AI researcher chatbot