Note to users. If you're seeing this message, it means that your browser cannot find this page's style/presentation instructions -- or possibly that you are using a browser that does not support current Web standards. Find out more about why this message is appearing, and what you can do to make your experience of our site the best it can be.

Science 3 February 1995:
Vol. 267. no. 5198, pp. 664 - 666
DOI: 10.1126/science.267.5198.664
Prev | Table of Contents | Next

Articles

Taboo Search: An Approach to the Multiple Minima Problem

Djurdje Cvijovicacute 1 and Jacek Klinowski 1

1 Department of Chemistry, University of Cambridge, Lensfield Road, Cambridge CB2 1EW, UK.

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.

Submitted on July 13, 1994
Accepted on November 23, 1994


THIS ARTICLE HAS BEEN CITED BY OTHER ARTICLES:
Local coherence in genetic interaction patterns reveals prevalent functional versatility.
S. Pu, K. Ronen, J. Vlasblom, J. Greenblatt, and S. J. Wodak (2008)
Bioinformatics 24, 2376-2383
   Abstract »    Full Text »    PDF »
Taboo evolutionary programming: a new method of global optimization.
M. Ji and J. Klinowski (2006)
Proc R Soc A 462, 3613-3627
   Abstract »    Full Text »    PDF »
Convergence of taboo search in continuous global optimization.
M. Ji and J. Klinowski (2006)
Proc R Soc A 462, 2077-2084
   Abstract »    Full Text »    PDF »
Global Optimization of Clusters, Crystals, and Biomolecules.
D. J. Wales and H. A. Scheraga (1999)
Science 285, 1368-1372
   Abstract »    Full Text »


To Advertise     Find Products

Science. ISSN 0036-8075 (print), 1095-9203 (online)