Simulated Annealing is a stochastic optimization algorithm that belongs to the class of Monte Carlo methods, distinguished by its use of a temperature-controlled probabilistic acceptance criterion to escape local optima and converge toward a global optimum in combinatorial search problems.
6.8K
Publications
519.6K
Citations
16K
Authors
3.6K
Institutions
Publications per year
2017–2026
1.4K
Publications
6.8K
Optimization by Simulated Annealing
Scott Kirkpatrick, C. D. Gelatt, M.P. Vecchi · Science · 1983 · 44.6K citations
1–5 of 6.8K
Authors
16K
- MK
21
h-index
- MD
18
h-index
- BL
17
h-index
- SL
17
h-index
- PL
17
h-index
1–5 of 16K
Institutions
3.6K
Centre National de la Recherche Scientifique
Paris, France
36 h-index
218 publications
8.6K citations
The University of Texas at Austin
Austin, United States
36 h-index
149 publications
10.5K citations
University of Illinois Urbana-Champaign
Urbana, United States
34 h-index
92 publications
10.5K citations
Stanford University
Stanford, United States
31 h-index
81 publications
16.8K citations
Carnegie Mellon University
Pittsburgh, United States
31 h-index
95 publications
6.5K citations
University of Michigan
Ann Arbor, United States
29 h-index
78 publications
5.6K citations
University of California, Berkeley
Berkeley, United States
29 h-index
76 publications
10.5K citations
Massachusetts Institute of Technology
Cambridge, United States
29 h-index
87 publications
7.5K citations
1–8 of 3.6K
Venues
- European Journal of Operational Research
78 publications · 8.7K citations
52
h-index
- International Journal of Production Research
136 publications · 7.3K citations
49
h-index
- The Journal of Chemical Physics
66 publications · 3.7K citations
36
h-index
- Computers & Operations Research
54 publications · 3.9K citations
34
h-index
- Applied Soft Computing
45 publications · 3.6K citations
33
h-index
1–5