Copyright © 2003 Elsevier B.V. All rights reserved.
Continuous Optimization
A hybrid method combining continuous tabu search and Nelder–Mead simplex algorithms for the global optimization of multiminima functions
Received 19 October 2001;
References and further reading may be available for this article. To view references and further reading you must purchase this article.
Abstract
Tabu search (TS) is a metaheuristic, which proved efficient to solve various combinatorial optimization problems. However, few works deal with its application to the global minimization of functions depending on continuous variables. To perform this task, we propose an hybrid method combining tabu search and simplex search (SS). TS allows to cover widely the solution space, to stimulate the search towards solutions far from the current solution, and to avoid the risk of trapping into a local minimum. SS is used to accelerate the convergence towards a minimum. The Nelder–Mead simplex algorithm is a classical very powerful local descent algorithm, making no use of the objective function derivatives. A “simplex” is a geometrical figure consisting, in n-dimensions, of (n+1) points. If any point of a simplex is taken as the origin, the n other points define vector directions that span the n-dimension vector space. Through a sequence of elementary geometric transformations (reflection, contraction and extension), the initial simplex moves, expands or contracts. To select the appropriate transformation, the method only uses the values of the function to be optimized at the vertices of the simplex considered. After each transformation, the current worst vertex is replaced by a better one. Our algorithm called continuous tabu simplex search (CTSS) implemented in two different forms (CTSSsingle, CTSSmultiple) is made up of two steps: first, an adaptation of TS to continuous optimization problems, allowing to localize a “promising area”; then, intensification within this promising area, involving SS. The efficiency of CTSS is extensively tested by using analytical test functions of which global and local minima are known. A comparison is proposed with several variants of tabu search, genetic algorithms and simulated annealing. CTSS is applied to the design of a eddy current sensor aimed at non-destructive control.
Author Keywords: Tabu search; Simplex; Global optimization; Continuous variables; Multiminima functions; Eddy current; Non-destructive control
Article Outline
- 1. Introduction
- 2. General description of our optimization method
- 2.1. Sketching features of ECTS and of our CTSS algorithm in its two forms
- 2.2. Nelder–Mead simplex search
- 3. Detailed presentation of the algorithm (CTSS)
- 3.1. Initialization
- 3.2. Exploration
- 3.3. Exploitation
- 3.4. Stopping criteria
- 3.5. Comparison between the two forms of our algorithm CTSS for one example
- 4. Initialization of some parameters and tuning of the control parameters
- 5. Experimental results
- 6. Application to the design of an eddy current sensor for non-destructive control
- 6.1. Principle of control
- 6.2. Calculation of the bobbin impedance in the presence of a material
- 6.3. Presentation of the applications treated within the framework of this work
- 6.4. Normalization of the impedance
- 6.5. Normalization of variables
- 6.6. Results obtained with CTSS to optimize the function ΔZ/Z
- 7. Conclusion
- Appendix A. List of test functions
- References







E-mail Article
Add to my Quick Links

Cited By in Scopus (24)






