The DOI matches its Crossref record; 31 of the 31 references it cites were found in a registry or an index.
Nature's way of optimizing
Open accessAbstract
We propose a general-purpose method for finding high-quality solutions to hard optimization problems, inspired by self-organizing processes often found in nature. The method, called Extremal Optimization, successively eliminates extremely undesirable components of sub-optimal solutions. Drawing upon models used to simulate far-from-equilibrium dynamics, it complements approximation methods inspired by equilibrium statistical physics, such as Simulated Annealing. With only one adjustable parameter, its performance proves competitive with, and often superior to, more elaborate stochastic optimization procedures. We demonstrate it here on two classic hard optimization problems: graph partitioning and the traveling salesman problem. © 2000 Elsevier Science B.V. All rights reserved.
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
Holland, J. H. (1992) · The MIT Press eBooks · doi:10.7551/mitpress/1090.001.0001 · Cited by 47,002
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
Self-organized criticality: An explanation of the 1/f noise
Bak, P., Tang, C., & Wiesenfeld, K. (1987) · Physical Review Letters · doi:10.1103/physrevlett.59.381 · Cited by 7,591
On the Origin of Species by Means of Natural Selection
Livezey, R. L., & Darwin, C. (1953) · American Midland Naturalist · doi:10.2307/2485224 · Cited by 5,405
Future paths for integer programming and links to artificial intelligence
Glover, F. (1986) · Computers & Operations Research · doi:10.1016/0305-0548(86)90048-1 · Cited by 4,181
Spin Glass Theory and Beyond: An Introduction to the Replica Method and Its Applications
Mezard, M., Parisi, G., & Virasoro, M. (1986) · World Scientific Lecture Notes in Physics · doi:10.1142/0271 · Cited by 3,653
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
Bak, P. (1996) · Springer eBooks · doi:10.1007/978-1-4757-5426-1 · Cited by 2,809
Cited by
Community detection in complex networks using extremal optimization
Duch, J., & Arenas, A. (2005) · Physical Review E · doi:10.1103/physreve.72.027104 · Cited by 1,549
Dall, J., & Christensen, M. (2002) · Physical Review E · doi:10.1103/physreve.66.016121 · Cited by 480
Chen, J., Zeng, G.-Q., Zhou, W., Du, W., & Lu, K.-D. (2018) · Energy Conversion and Management · doi:10.1016/j.enconman.2018.03.098 · Cited by 419
A Survey on ensemble learning under the era of deep learning
Yang, Y., Lv, H., & Chen, N. (2023) · Artificial Intelligence Review · doi:10.1007/s10462-022-10283-5 · Cited by 369
Optimization with Extremal Dynamics
Boettcher, S., & Percus, A. G. (2001) · Physical Review Letters · doi:10.1103/physrevlett.86.5211 · Cited by 342
Self-citation
Metadata
- Authors
- Boettcher, S., & Percus, A.
- Venue
- Artificial Intelligence
- Publisher
- Elsevier BV
- Published
- 2000-05
- Volume
- 119
- Issue
- 1-2
- Pages
- 275-286
- ISSN
- 0004-3702 (ISSN-L)
- OpenAlex
- W2170123469
- Cited by
- 278
- References
- 31
- FWCI
- 11.66
- Type
- journal article
- Language
- en
- Open access
- bronze
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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Nature's way of optimizing. https://app.cochat.ai/papers/10.1016/s0004-3702(00)00007-2
- The paper
- Boettcher, S., & Percus, A. (2000). Nature's way of optimizing. Artificial Intelligence. https://doi.org/10.1016/s0004-3702(00)00007-2
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.