The DOI matches its Crossref record; 45 of the 45 references it cites were found in a registry or an index.
Simulated Annealing
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
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
Reducibility among Combinatorial Problems
Karp, R. M. (1972) · Complexity of Computer Computations · doi:10.1007/978-1-4684-2001-2_9 · Cited by 11,511
The complexity of theorem-proving procedures
Cook, S. A. (1971) · Proceedings of the third annual ACM symposium on Theory of computing - STOC '71 · doi:10.1145/800157.805047 · Cited by 6,385
Glover, F. (1989) · ORSA Journal on Computing · doi:10.1287/ijoc.1.3.190 · Cited by 5,106
Thermodynamical approach to the traveling salesman problem: An efficient simulation algorithm
Černý, V. (1985) · Journal of Optimization Theory and Applications · doi:10.1007/bf00940812 · Cited by 3,436
Ropke, S., & Pisinger, D. (2006) · Transportation Science · doi:10.1287/trsc.1050.0135 · Cited by 2,580
Edmonds, J. (1965) · Canadian Journal of Mathematics · doi:10.4153/cjm-1965-045-4 · Cited by 2,428
Simulated Annealing: Theory and Applications
van Laarhoven, P. J. M., & Aarts, E. H. L. (1987) · Springer eBooks · doi:10.1007/978-94-015-7744-1 · Cited by 2,385
Optimization by Simulated Annealing: An Experimental Evaluation; Part I, Graph Partitioning
Johnson, D. S., Aragon, C. R., McGeoch, L. A., & Schevon, C. (1989) · Operations Research · doi:10.1287/opre.37.6.865 · Cited by 1,457
Cooling Schedules for Optimal Annealing
Hajek, B. (1988) · Mathematics of Operations Research · doi:10.1287/moor.13.2.311 · Cited by 1,246
Dueck, G., & Scheuer, T. (1990) · Journal of Computational Physics · doi:10.1016/0021-9991(90)90201-b · Cited by 1,232
Global Optimization of Clusters, Crystals, and Biomolecules
Wales, D. J., & Scheraga, H. A. (1999) · Science · doi:10.1126/science.285.5432.1368 · Cited by 1,114
Szu, H., & Hartley, R. (1987) · Physics Letters A · doi:10.1016/0375-9601(87)90796-1 · Cited by 1,089
Metastrategy simulated annealing and tabu search algorithms for the vehicle routing problem
Osman, I. H. (1993) · Annals of Operations Research · doi:10.1007/bf02023004 · Cited by 1,046
Johnson, D. S., Aragon, C. R., McGeoch, L. A., & Schevon, C. (1991) · Operations Research · doi:10.1287/opre.39.3.378 · Cited by 845
Simulated annealing: A tool for operational research
Eglese, R. W. (1990) · European Journal of Operational Research · doi:10.1016/0377-2217(90)90001-r · Cited by 801
Heuristic Methods for Estimating the Generalized Vertex Median of a Weighted Graph
Teitz, M. B., & Bart, P. (1968) · Operations Research · doi:10.1287/opre.16.5.955 · Cited by 787
Convergence of an annealing algorithm
Lundy, M., & Mees, A. (1986) · Mathematical Programming · doi:10.1007/bf01582166 · Cited by 693
Generalized simulated annealing
Tsallis, C., & Stariolo, D. A. (1996) · Physica A: Statistical Mechanics and its Applications · doi:10.1016/s0378-4371(96)00271-3 · Cited by 503
An improved annealing scheme for the QAP
Connolly, D. T. (1990) · European Journal of Operational Research · doi:10.1016/0377-2217(90)90301-q · Cited by 400
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
Ogbu, F. A., & Smith, D. K. (1990) · Computers & Operations Research · doi:10.1016/0305-0548(90)90001-n · Cited by 310
Chen, S.-H., & Yeh, C.-H. (2001) · Journal of Economic Dynamics and Control · doi:10.1016/s0165-1889(00)00030-0 · Cited by 268
Facts, Conjectures, and Improvements for Simulated Annealing
Salamon, P., Sibani, P., & Frost, R. L. (2002) · Society for Industrial and Applied Mathematics eBooks · doi:10.1137/1.9780898718300 · Cited by 262
The N-City Travelling Salesman Problem: Statistical Mechanics and the Metropolis Algorithm
Bonomi, E., & Lutton, J.-L. (1984) · SIAM Review · doi:10.1137/1026105 · Cited by 251
New approaches for heuristic search: A bilateral linkage with artificial intelligence
Glover, F., & Greenberg, H. J. (1989) · European Journal of Operational Research · doi:10.1016/0377-2217(89)90185-9 · Cited by 244
Aarts, E., Korst, J., & Michiels, W. (2006) · Search Methodologies · doi:10.1007/0-387-28356-0_7 · Cited by 212
Multiobjective Optimization of Concrete Frames by Simulated Annealing
Payá-Zaforteza, I., Yepes, V., & González‐Vidosa, F. (2008) · Computer-Aided Civil and Infrastructure Engineering · doi:10.1111/j.1467-8667.2008.00561.x · Cited by 172
A simulated annealing approach to the traveling tournament problem
Anagnostopoulos, A., Michel, L. D., Hentenryck, P. V., & Vergados, Y. (2006) · Journal of Scheduling · doi:10.1007/s10951-006-7187-8 · Cited by 172
An overview of computational complexity
Cook, S. A. (1983) · Communications of the ACM · doi:10.1145/358141.358144 · Cited by 171
Dowsland, K. A., Soubeiga, E., & Burke, E. K. (2005) · European Journal of Operational Research · doi:10.1016/j.ejor.2005.03.058 · Cited by 169
Self-citationSome experiments with simulated annealing techniques for packing problems
Dowsland, K. A. (1993) · European Journal of Operational Research · doi:10.1016/0377-2217(93)90195-s · Cited by 158
Self-citationTraveling salesman problem and Tsallis statistics
Penna, T. J. P. (1995) · Physical review. E, Statistical physics, plasmas, fluids, and related interdisciplinary topics · doi:10.1103/physreve.51.r1 · Cited by 150
Simulated Annealing Without Rejected Moves
Greene, J. W., & Supowit, K. J. (1986) · IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems · doi:10.1109/tcad.1986.1270190 · Cited by 137
Simulated annealing with noisy or imprecise energy measurements
Gelfand, S. B., & Mitter, S. K. (1989) · Journal of Optimization Theory and Applications · doi:10.1007/bf00939629 · Cited by 123
A Simulated Annealing Enhancement of the Best-Fit Heuristic for the Orthogonal Stock-Cutting Problem
Burke, E. K., Kendall, G., & Whitwell, G. (2009) · INFORMS journal on computing · doi:10.1287/ijoc.1080.0306 · Cited by 115
Hansen, P., & Mladenović, N. (2006) · Springer eBooks · doi:10.1007/0-387-28356-0_8 · Cited by 112
Design of reinforced concrete bridge frames by heuristic optimization
Perea, C., Alcalà, J., Yepes, V., & González‐Vidosa, F. (2008) · Advances in Engineering Software · doi:10.1016/j.advengsoft.2007.07.007 · Cited by 109
A parameter optimized model of a Proton Exchange Membrane fuel cell including temperature effects
Outeiro, M. T., Chibante, R., Carvalho, A., & de Almeida, A. T. (2008) · Journal of Power Sources · doi:10.1016/j.jpowsour.2008.08.019 · Cited by 100
Optimization using variations of simulated annealing
Kalivas, J. H. (1992) · Chemometrics and Intelligent Laboratory Systems · doi:10.1016/0169-7439(92)80022-v · Cited by 46
Scaling behavior of stochastic minimization algorithms in a perfect funnel landscape
Hamacher, K., & Wenzel, W. (1999) · Physical review. E, Statistical physics, plasmas, fluids, and related interdisciplinary topics · doi:10.1103/physreve.59.938 · Cited by 42
An adaptive tabu-simulated annealing for concave cost transportation problems
Altıparmak, F., & Karaoğlan, İ. (2006) · Journal of the Operational Research Society · doi:10.1057/palgrave.jors.2602301 · Cited by 17
de Andrade, M., Nascimento, M. A. C., Mundim, K. C., Sobrinho, A. M. C., & Malbouisson, L. A. C. (2008) · International Journal of Quantum Chemistry · doi:10.1002/qua.21666 · Cited by 15
Applying a Hybrid Ant Colony System to the Vehicle Routing Problem
Chen, C.-H., Ting, C., & Chang, P. (2005) · Lecture notes in computer science · doi:10.1007/11424925_45 · Cited by 13
Cited by
Metaheuristics in Combinatorial Optimization
Gendreau, M., & Potvin, J.-Y. (2005) · Annals of Operations Research · doi:10.1007/s10479-005-3971-7 · Cited by 2,338
The General Utility Lattice Program ( GULP )
Gale, J. D., & Rohl, A. L. (2003) · Molecular Simulation · doi:10.1080/0892702031000104887 · Cited by 2,265
Introduction to multi-layer feed-forward neural networks
Svozil, D., Kvasnicka, V., & Pospichal, J. (1997) · Chemometrics and Intelligent Laboratory Systems · doi:10.1016/s0169-7439(97)00061-0 · Cited by 1,600
In Situ Observation of the Electrochemical Lithiation of a Single SnO 2 Nanowire Electrode
Huang, J. Y., Zhong, L., Wang, C. M., Sullivan, J. P., Xu, W., Zhang, L. Q., Mao, S. X., Hudak, N. S., Liu, X. H., Subramanian, A., et al. (2010) · Science · doi:10.1126/science.1195628 · Cited by 1,563
Handbook of Constraint Programming
(2006) · Foundations of Artificial Intelligence · doi:10.1016/s1574-6526(06)x8001-x · Cited by 1,483
Metadata
- Authors
- Dowsland, K. A., & Thompson, J. M.
- Venue
- Handbook of Natural Computing
- Publisher
- Springer Berlin Heidelberg
- Published
- 2012
- Pages
- 1623-1655
- OpenAlex
- W2914275007
- Cited by
- 2,432
- References
- 45
- FWCI
- 329.19
- Type
- book chapter
- 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.