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.
CITATION STYLE
Cvijović, D., & Klinowski, J. (2002). Taboo Search: An Approach to the Multiple-Minima Problem for Continuous Functions (pp. 387–406). https://doi.org/10.1007/978-1-4757-5362-2_11
Mendeley helps you to discover research relevant for your work.