The DOI matches its Crossref record; 20 of the 20 references it cites were found in a registry or an index.
Optimization by Simulated Annealing: An Experimental Evaluation; Part I, Graph Partitioning
Abstract
In this and two companion papers, we report on an extended empirical study of the simulated annealing approach to combinatorial optimization proposed by S. Kirkpatrick et al. That study investigated how best to adapt simulated annealing to particular problems and compared its performance to that of more traditional algorithms. This paper (Part I) discusses annealing and our parameterized generic implementation of it, describes how we adapted this generic algorithm to the graph partitioning problem, and reports how well it compared to standard algorithms like the Kernighan-Lin algorithm. (For sparse random graphs, it tended to outperform Kernighan-Lin as the number of vertices become large, even when its much greater running time was taken into account. It did not perform nearly so well, however, on graphs generated with a built-in geometric structure.) We also discuss how we went about optimizing our implementation, and describe the effects of changing the various annealing parameters or varying the basic annealing algorithm itself.
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
(1979) · Cited by 43,841
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 · cited 2×
“…as diverse as VLSI design (Jepsen and Gelatt 1983, Kirkpatrick, Gelatt and Vecchi 1983, Vecchi and Kirkpatrick 1983, Rowan and Hennessy 1985), pattern recognition (Geman and Geman 1984, Hinton, Sejnowski and Ackley 1984) and code generation (El Gamal et al. 1987), often with substantial success.”
BackgroundMethodAn Efficient Heuristic Procedure for Partitioning Graphs
Kernighan, B. W., & Lin, S. (1970) · Bell System Technical Journal · doi:10.1002/j.1538-7305.1970.tb01770.x · Cited by 5,305
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
Simulated annealing: theory and applications.
(1988) · Mathematics and Computers in Simulation · doi:10.1016/0378-4754(88)90023-7 · Cited by 2,966
Some simplified NP-complete graph problems
Garey, M. R., Johnson, D. S., & Stockmeyer, L. (1976) · Theoretical Computer Science · doi:10.1016/0304-3975(76)90059-1 · Cited by 2,059
Self-citationOptimization by simulated annealing: Quantitative studies
Kirkpatrick, S. (1984) · Journal of Statistical Physics · doi:10.1007/bf01009452 · Cited by 1,805
Convergence of an annealing algorithm
Lundy, M., & Mees, A. (1986) · Mathematical Programming · doi:10.1007/bf01582166 · Cited by 693
A Procedure for Placement of Standard-Cell VLSI Circuits
Dunlop, A. E., & Kernighan, B. W. (1985) · IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems · doi:10.1109/tcad.1985.1270101 · Cited by 505
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
Graph bisection algorithms with good average case behavior
Bui, T. N., Chaudhuri, S., Leighton, F. T., & Sipser, M. (1987) · Combinatorica · doi:10.1007/bf02579448 · Cited by 323
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
Nonstationary Markov chains and convergence of the annealing algorithm
Gidas, B. (1985) · Journal of Statistical Physics · doi:10.1007/bf01007975 · Cited by 248
Global Wiring by Simulated Annealing
Vecchi, M. P., & Kirkpatrick, S. (1983) · IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems · doi:10.1109/tcad.1983.1270039 · Cited by 240
Concepts of scale in simulated annealing
White, S. R. (1984) · AIP Conference Proceedings · doi:10.1063/1.34823 · Cited by 228
Using simulated annealing to design good codes
Gamal, A. E., Hemachandra, L., Shperling, I., & Wei, V. (1987) · IEEE Transactions on Information Theory · doi:10.1109/tit.1987.1057277 · Cited by 213
Simulated annealing methods with general acceptance probabilities
Anily, S., & Federgruen, A. (1987) · Journal of Applied Probability · doi:10.1017/s0021900200031387 · Cited by 146
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
Cited by
Dowsland, K. A., & Thompson, J. M. (2012) · Handbook of Natural Computing · doi:10.1007/978-3-540-92910-9_49 · Cited by 2,432
Schaeffer, S. E. (2007) · Computer Science Review · doi:10.1016/j.cosrev.2007.05.001 · Cited by 1,639
Black hole: A new heuristic optimization approach for data clustering
Hatamlou, A. (2013) · Information Sciences · doi:10.1016/j.ins.2012.08.023 · Cited by 1,370
Job Shop Scheduling by Simulated Annealing
van Laarhoven, P. J. M., Aarts, E. H. L., & Lenstra, J. K. (1992) · Operations Research · doi:10.1287/opre.40.1.113 · Cited by 1,123
Simulated annealing: Practice versus theory
Ingber, L. (1993) · Mathematical and Computer Modelling · doi:10.1016/0895-7177(93)90204-c · Cited by 1,008
Metadata
- Authors
- Johnson, D. S., Aragon, C. R., McGeoch, L. A., & Schevon, C.
- Venue
- Operations Research
- Published
- 1989-12
- Volume
- 37
- Issue
- 6
- Pages
- 865-892
- ISSN
- 0030-364X (ISSN-L)
- 1526-5463
- OpenAlex
- W2128193809
- Cited by
- 1,457
- References
- 20
- FWCI
- 27.66
- 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.