Article ID: | iaor20053319 |
Country: | Netherlands |
Volume: | 161 |
Issue: | 3 |
Start Page Number: | 636 |
End Page Number: | 654 |
Publication Date: | Mar 2005 |
Journal: | European Journal of Operational Research |
Authors: | Chelouah Rachid, Siarry Patrick |
Keywords: | heuristics, optimization |
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