The DOI matches its Crossref record; 19 of the 19 references it cites were found in a registry or an index.
Optimization Using Simulated Annealing
Abstract
Much work has been published on the theoretical aspects of simulated annealing. This paper provides a brief overview of this theory and provides an introduction to the practical aspects of function optimization using this approach. Different implementations of the general simulated annealing algorithm are discussed, and two examples are used to illustrate the behaviour of the algorithm in low dimensions. A third example illustrates a hybrid approach, combining simulated annealing with traditional techniques.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Optimization by Simulated Annealing
Kirkpatrick, S., Gelatt, C. D., & Vecchi, M. P. (1983) · Science · doi:10.1126/science.220.4598.671 · Cited by 45,134
Equation of State Calculations by Fast Computing Machines
Metropolis, N., Rosenbluth, A. W., Rosenbluth, M. N., Teller, A. H., & Teller, E. (1953) · The Journal of Chemical Physics · doi:10.1063/1.1699114 · Cited by 37,192
Stochastic relaxation, gibbs distributions, and the bayesian restoration of images.
Geman, S., & Geman, D. (1984) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.1984.4767596 · Cited by 17,949
(1973) · CERN Document Server (European Organization for Nuclear Research) · Cited by 12,895
Savitzky-Golay Smoothing Filters
Press, W. H., & Teukolsky, S. A. (1990) · Computers in Physics · doi:10.1063/1.4822961 · Cited by 11,670
Dowsland, K. A., & Thompson, J. M. (2012) · Handbook of Natural Computing · doi:10.1007/978-3-540-92910-9_49 · Cited by 2,432
Corana, A., Marchesi, M., Martini, C., & Ridella, S. (1987) · ACM Transactions on Mathematical Software · doi:10.1145/29380.29864 · Cited by 1,531
Everitt, B. S. (2005) · Encyclopedia of Statistics in Behavioral Science · doi:10.1002/0470013192.bsa231 · Cited by 1,263
Szu, H., & Hartley, R. (1987) · Physics Letters A · doi:10.1016/0375-9601(87)90796-1 · Cited by 1,089
Estimating the components of a mixture of normal distributions
DAY, N. E. (1969) · Biometrika · doi:10.1093/biomet/56.3.463 · Cited by 824
McLachlan, G. J. (1987) · Applied Statistics · doi:10.2307/2347790 · Cited by 708
Convergence of an annealing algorithm
Lundy, M., & Mees, A. (1986) · Mathematical Programming · doi:10.1007/bf01582166 · Cited by 693
Generalized Simulated Annealing for Function Optimization
Bohachevsky, I. O., Johnson, M. E., & Stein, M. L. (1986) · Technometrics · doi:10.1080/00401706.1986.10488128 · Cited by 573
Genetic Algorithms and Very Fast Simulated Reannealing: A comparison
Ingber, L., & Rosen, B. (1992) · Mathematical and Computer Modelling · doi:10.1016/0895-7177(92)90108-w · Cited by 424
Convergence and finite-time behavior of simulated annealing
Mitra, D., Romeo, F., & Sangiovanni-Vincentelli, A. (1986) · Advances in Applied Probability · doi:10.2307/1427186 · Cited by 358
Capacitated clustering problems by hybrid simulated annealing and tabu search
Osman, I. (1994) · International Transactions in Operational Research · doi:10.1016/0969-6016(94)90032-9 · Cited by 274
Hosmer, D. W. (1973) · Biometrics · doi:10.2307/2529141 · Cited by 185
Everitt, B. S. (1984) · Journal of the Royal Statistical Society Series D (The Statistician) · doi:10.2307/2987851 · Cited by 48
Feng, Z., & McCulloch, C. E. (1994) · Biometrics · doi:10.2307/2533453 · Cited by 36
Cited by
Hand, D. J. (2007) · Drug Safety · doi:10.2165/00002018-200730070-00010 · Cited by 1,044
VTEAM: A General Model for Voltage-Controlled Memristors
Kvatinsky, S., Ramadan, M., Friedman, E. G., & Kolodny, A. (2015) · IEEE Transactions on Circuits and Systems II: Express Briefs · doi:10.1109/tcsii.2015.2433536 · Cited by 838
Metaheuristics: A bibliography
Osman, I. H., & Laporte, G. (1996) · Annals of Operations Research · doi:10.1007/bf02125421 · Cited by 672
Metaheuristics in large-scale global continues optimization: A survey
Mahdavi, S., Shiri, M. E., & Rahnamayan, S. (2015) · Information Sciences · doi:10.1016/j.ins.2014.10.042 · Cited by 465
Modelling Nonlinear Economic Time Series
Teräsvirta, T., Tjøstheim, D., & Granger, C. W. J. (2010) · doi:10.1093/acprof:oso/9780199587148.001.0001 · Cited by 352
Metadata
- Authors
- Brooks, S. P., & Morgan, B. J. T.
- Venue
- The Statistician
- Publisher
- JSTOR
- Published
- 1995
- Volume
- 44
- Issue
- 2
- Pages
- 241
- ISSN
- 0039-0526 (ISSN-L)
- OpenAlex
- W1485540258
- Cited by
- 348
- References
- 19
- FWCI
- 3.35
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.