Optimization by Simulated Annealing: An Experimental Evaluation; Part I, Graph Partitioning
The DOI matches its Crossref record; 20 of the 20 references it cites were found in a registry or an index.
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
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
Handbook of Knowledge Representation
(2008) · Foundations of Artificial Intelligence · doi:10.1016/s1574-6526(07)x0300-6 · Cited by 883
Johnson, D. S., Aragon, C. R., McGeoch, L. A., & Schevon, C. (1991) · Operations Research · doi:10.1287/opre.39.3.378 · Cited by 845
Self-citationSimulated 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
Deterministic job-shop scheduling: Past, present and future
Jain, A. S., & Meeran, S. (1999) · European Journal of Operational Research · doi:10.1016/s0377-2217(98)00113-1 · Cited by 782
Metaheuristics: A bibliography
Osman, I. H., & Laporte, G. (1996) · Annals of Operations Research · doi:10.1007/bf02125421 · Cited by 672
Chaotic simulated annealing by a neural network model with transient chaos
Chen, L., & Aihara, K. (1995) · Neural Networks · doi:10.1016/0893-6080(95)00033-v · Cited by 661
A survey of simulated annealing as a tool for single and multiobjective optimization
Suman, B., & Kumar, P. (2006) · Journal of the Operational Research Society · doi:10.1057/palgrave.jors.2602068 · Cited by 611
A survey of graph layout problems
Díaz, J., Petit, J., & Serna, M. (2002) · ACM Computing Surveys · doi:10.1145/568522.568523 · Cited by 599
The Theory and Practice of Simulated Annealing
Henderson, D., Jacobson, S. H., & Johnson, A. W. (2006) · International Series in Operations Research & Management Science · doi:10.1007/0-306-48056-5_10 · Cited by 514
Drawing graphs nicely using simulated annealing
Davidson, R., & Harel, D. (1996) · ACM Transactions on Graphics · doi:10.1145/234535.234538 · Cited by 483
Dall, J., & Christensen, M. (2002) · Physical Review E · doi:10.1103/physreve.66.016121 · Cited by 480
Algorithms for graph partitioning on the planted partition model
Condon, A., & Karp, R. M. (2001) · Random Structures and Algorithms · doi:10.1002/1098-2418(200103)18:2<116::aid-rsa1001>3.0.co;2-2 · Cited by 429
Water Distribution Network Design Optimization: Simulated Annealing Approach
Cunha, M. D. C., & Sousa, J. (1999) · Journal of Water Resources Planning and Management · doi:10.1061/(asce)0733-9496(1999)125:4(215 · Cited by 416
Guided local search and its application to the traveling salesman problem
Voudouris, C., & Tsang, E. (1999) · European Journal of Operational Research · doi:10.1016/s0377-2217(98)00099-x · Cited by 409
An Economics Approach to Hard Computational Problems
Huberman, B. A., Lukose, R. M., & Hogg, T. (1997) · Science · doi:10.1126/science.275.5296.51 · Cited by 390
Local search in combinatorial optimization
Crama, Y., Kolen, A. W. J., & Pesch, E. J. (1995) · Lecture Notes in Computer Science · doi:10.1007/bfb0027029 · Cited by 361
Simulated annealing metaheuristics for the vehicle routing problem with time windows
Chiang, W.-C., & Russell, R. A. (1996) · Annals of Operations Research · doi:10.1007/bf02601637 · Cited by 354
Simulated annealing for complex portfolio selection problems
Crama, Y., & Schyns, M. (2003) · European Journal of Operational Research · doi:10.1016/s0377-2217(02)00784-1 · Cited by 352
Kuo, Y. (2010) · Computers & Industrial Engineering · doi:10.1016/j.cie.2010.03.012 · Cited by 343
Genetic algorithm and graph partitioning
Bui, T. N., & Moon, B. R. (1996) · IEEE Transactions on Computers · doi:10.1109/12.508322 · Cited by 341
Water Distribution Network Design Optimization: Simulated Annealing Approach
Zoppou, C., & Reed, M. (2001) · Journal of Water Resources Planning and Management · doi:10.1061/(asce)0733-9496(2001)127:1(69 · Cited by 333
Systems biology: parameter estimation for biochemical models
Ashyraliyev, M., Fomekong‐Nanfack, Y., Kaandorp, J. A., & Blom, J. G. (2009) · The FEBS Journal · doi:10.1111/j.1742-4658.2008.06844.x · Cited by 323
A Review of Methodological Approaches for the Design and Optimization of Wind Farms
Herbert-Acero, J., Probst, O., Réthoré, P.-E., Larsen, G., & Castillo-Villar, K. (2014) · Energies · doi:10.3390/en7116930 · Cited by 311
Device Placement Optimization with Reinforcement Learning
Mirhoseini, A., Pham, H., Le, Q. V., Steiner, B., Larsen, R., Zhou, Y., Kumar, N., Norouzi, M., Bengio, S., & Dean, J. (2017) · arXiv (Cornell University) · doi:10.48550/arxiv.1706.04972 · Cited by 299
Social group optimization (SGO): a new population evolutionary optimization technique
Satapathy, S., & Naik, A. (2016) · Complex & Intelligent Systems · doi:10.1007/s40747-016-0022-8 · Cited by 297
Boettcher, S., & Percus, A. (2000) · Artificial Intelligence · doi:10.1016/s0004-3702(00)00007-2 · Cited by 278
Scheduling and rescheduling with iterative repair
Zweben, M., Davis, E., Daun, B., & Deale, M. J. (1993) · IEEE Transactions on Systems, Man, and Cybernetics · doi:10.1109/21.257756 · Cited by 275
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
Scheduling jobs on parallel machines with sequence-dependent setup times
Lee, Y. H., & Pinedo, M. (1997) · European Journal of Operational Research · doi:10.1016/s0377-2217(95)00376-2 · Cited by 273
Simulation optimization: A comprehensive review on theory and applications
TEKIN, E., & SABUNCUOGLU, I. (2004) · IIE Transactions · doi:10.1080/07408170490500654 · Cited by 265
Solving Max-Cut to optimality by intersecting semidefinite and polyhedral relaxations
Rendl, F., Rinaldi, G., & Wiegele, A. (2010) · Mathematical Programming · doi:10.1007/s10107-008-0235-8 · Cited by 264
Chapter 4 The traveling salesman problem
Jünger, M., Reinelt, G., & Rinaldi, G. (1995) · Handbooks in Operations Research and Management Science · doi:10.1016/s0927-0507(05)80121-5 · Cited by 230
A memetic algorithm for graph coloring
Lü, Z., & Hao, J.-K. (2010) · European Journal of Operational Research · doi:10.1016/j.ejor.2009.07.016 · Cited by 217
Benchmarking in Optimization: Best Practice and Open Issues
Bartz-Beielstein, T., Doerr, C., Berg, D. V. D., Bossek, J., Chandrasekaran, S., Eftimov, T., Fischbach, A., Kerschke, P., La Cava, W., Lopez-Ibanez, M., et al. (2020) · arXiv · doi:10.48550/arxiv.2007.03488 · Cited by 214
“Hooker and Johnson are only two authors that published papers still worth reading today [Hooker, 1994, 1996, Johnson et al., 1989, 1991, Johnson, 2002b].”
BackgroundUsing 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
Introduction to Computational Optimization Models for Production Planning in a Supply Chain
Voß, S., & Woodruff, D. L. (2003) · Springer eBooks · doi:10.1007/978-3-540-24764-7 · Cited by 159
Optimization by Self-Organized Criticality
Hoffmann, H., & Payton, D. W. (2018) · Scientific Reports · doi:10.1038/s41598-018-20275-7 · Cited by 65
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.