The DOI matches its Crossref record; 12 of the 12 references it cites were found in a registry or an index.
Taboo Search: An Approach to the Multiple Minima Problem
Abstract
Described here is a method, based on Glover's taboo search for discrete functions, of solving the multiple minima problem for continuous functions. As demonstrated by model calculations, the algorithm avoids entrapment in local minima and continues the search to give a near-optimal final solution. Unlike other methods of global optimization, this procedure is generally applicable, easy to implement, derivative-free, and conceptually simple.
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
Practical Methods of Optimization
Fletcher, R. (2000) · Wiley eBooks · doi:10.1002/9781118723203 · Cited by 7,605
Glover, F. (1990) · ORSA Journal on Computing · doi:10.1287/ijoc.2.1.4 · Cited by 5,647
Glover, F. (1989) · ORSA Journal on Computing · doi:10.1287/ijoc.1.3.190 · Cited by 5,106
Dowsland, K. A., & Thompson, J. M. (2012) · Handbook of Natural Computing · doi:10.1007/978-3-540-92910-9_49 · Cited by 2,432
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
Törn, A., & Žilinskas, A. (1989) · Cited by 1,673
(1989) · Lecture Notes in Computer Science · doi:10.1007/3-540-50871-6 · Cited by 717
Using tabu search techniques for graph coloring
Hertz, A., & de Werra, D. (1987) · Computing · doi:10.1007/bf02239976 · Cited by 657
Constrained Global Optimization: Algorithms and Applications
(1987) · Lecture Notes in Computer Science · doi:10.1007/bfb0000035 · Cited by 519
Cited by
Wales, D. J., & Doye, J. P. K. (1997) · The Journal of Physical Chemistry A · doi:10.1021/jp970984n · Cited by 3,020
PLUMED: A portable plugin for free-energy calculations with molecular dynamics
Bonomi, M., Branduardi, D., Bussi, G., Camilloni, C., Provasi, D., Raiteri, P., Donadio, D., Marinelli, F., Pietrucci, F., Broglia, R. A., et al. (2009) · Computer Physics Communications · doi:10.1016/j.cpc.2009.05.011 · Cited by 1,875
A survey on optimization metaheuristics
Boussaïd, I., Lepagnot, J., & Siarry, P. (2013) · Information Sciences · doi:10.1016/j.ins.2013.02.041 · Cited by 1,655
Laio, A., & Gervasio, F. L. (2008) · Reports on Progress in Physics · doi:10.1088/0034-4885/71/12/126601 · Cited by 1,619
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
Improved particle swarm optimization combined with chaos
Liu, B., Wang, L., Jin, Y.-H., Tang, F., & Huang, D.-X. (2005) · Chaos, Solitons & Fractals · doi:10.1016/j.chaos.2004.11.095 · Cited by 947
MONTE CARLO METHODS IN GEOPHYSICAL INVERSE PROBLEMS
Sambridge, M., & Mosegaard, K. (2002) · Reviews of Geophysics · doi:10.1029/2000rg000089 · Cited by 829
Using metadynamics to explore complex free-energy landscapes
Bussi, G., & Laio, A. (2020) · Nature Reviews Physics · doi:10.1038/s42254-020-0153-0 · Cited by 718
Efficient Reconstruction of Complex Free Energy Landscapes by Multiple Walkers Metadynamics
Raiteri, P., Laio, A., Gervasio, F. L., Micheletti, C., & Parrinello, M. (2006) · The Journal of Physical Chemistry B · doi:10.1021/jp054359r · Cited by 615
From A to B in free energy space
Branduardi, D., Gervasio, F. L., & Parrinello, M. (2007) · The Journal of Chemical Physics · doi:10.1063/1.2432340 · Cited by 605
A hybrid genetic algorithm and particle swarm optimization for multimodal functions
Kao, Y.-T., & Zahara, E. (2008) · Applied Soft Computing · doi:10.1016/j.asoc.2007.07.002 · Cited by 555
A review of optimization techniques in metal cutting processes
Mukherjee, I., & Ray, P. K. (2006) · Computers & Industrial Engineering · doi:10.1016/j.cie.2005.10.001 · Cited by 549
JOHANSEN, A., LEDOIT, O., & SORNETTE, D. (2000) · International Journal of Theoretical and Applied Finance · doi:10.1142/s0219024900000115 · Cited by 524
Zheng, W., & Tropsha, A. (2000) · Journal of Chemical Information and Computer Sciences · doi:10.1021/ci980033m · Cited by 450
White, C., Halpern, B. S., & Kappel, C. V. (2012) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.1114215109 · Cited by 405
The effect of the range of the potential on the structures of clusters
Doye, J. P. K., Wales, D. J., & Berry, R. S. (1995) · The Journal of Chemical Physics · doi:10.1063/1.470729 · Cited by 395
Generalized Simulated Annealing for Global Optimization: The GenSA Package
Xiang, Y., Gubian, S., Suomela, B., & Hoeng, J. (2013) · The R Journal · doi:10.32614/rj-2013-002 · Cited by 372
Chelouah, R., & Siarry, P. (2003) · European Journal of Operational Research · doi:10.1016/s0377-2217(02)00401-0 · Cited by 315
A Continuous Genetic Algorithm Designed for the Global Optimization of Multimodal Functions
Chelouah, R., & Siarry, P. (2000) · Journal of Heuristics · doi:10.1023/a:1009626110229 · Cited by 299
New Monte Carlo algorithms for protein folding
Hansmann, U. H. E., & Okamoto, Y. (1999) · Current Opinion in Structural Biology · doi:10.1016/s0959-440x(99)80025-6 · Cited by 291
Flexible Docking in Solution Using Metadynamics
Gervasio, F. L., Laio, A., & Parrinello, M. (2005) · Journal of the American Chemical Society · doi:10.1021/ja0445950 · Cited by 287
Sornette, D., & Johansen, A. (1997) · Physica A: Statistical Mechanics and its Applications · doi:10.1016/s0378-4371(97)00318-x · Cited by 276
Using fast weights to improve persistent contrastive divergence
Tieleman, T., & Hinton, G. (2009) · Proceedings of the 26th Annual International Conference on Machine Learning · doi:10.1145/1553374.1553506 · Cited by 274
“Fantasy particles develop an aversion to wherever they are and unless this aversion is balanced by the energy-lowering presence of training data, they continually seek out places they 4 This has some resemblance to “taboo search” ( Cvijovi & Klinowski, 1995 ), but it is more effective in highdimensional spaces because…”
Background
Metadata
- Authors
- Cvijović, D., & Klinowski, J.
- Venue
- Science
- Published
- 1995-02-03
- Volume
- 267
- Issue
- 5198
- Pages
- 664-666
- ISSN
- 0036-8075 (ISSN-L)
- 1095-9203
- OpenAlex
- W2069514727
- Cited by
- 416
- References
- 12
- FWCI
- 21.54
- 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.