A hybrid method combining continuous tabu search and Nelder--Mead simplex algorithms for the global optimization of multiminima functions

DOI10.1016/j.ejor.2003.08.053zbMath1071.90035OpenAlexW2042647239MaRDI QIDQ706948

Rachid Chelouah, Patrick Siarry

Publication date: 9 February 2005

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejor.2003.08.053

zbMATH Keywords

Tabu searchGlobal optimizationSimplexContinuous variablesEddy currentMultiminima functionsNon-destructive control

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Combinatorial optimization (90C27)

Related Items (30)

A restarted and modified simplex search for unconstrained optimization ⋮ A dynamic clustering based differential evolution algorithm for global optimization ⋮ Particle swarm and ant colony algorithms hybridized for improved continuous optimization ⋮ Finding local optima of high-dimensional functions using direct search methods ⋮ Global optimization using \(q\)-gradients ⋮ Low complexity metaheuristics for joint ML estimation problems ⋮ Study of multiscale global optimization based on parameter space partition ⋮ Multi-constrained optimal reinsurance model from the duality perspectives ⋮ Integrated crossover rules in real coded genetic algorithms ⋮ Rosenbrock artificial bee colony algorithm for accurate global optimization of numerical functions ⋮ A hybrid method combining genetic algorithm and Hooke-Jeeves method for constrained global optimization ⋮ Combining metaheuristics with mathematical programming, constraint programming and machine learning ⋮ Hybridizing local search algorithms for global optimization ⋮ A new hybrid algorithm of scatter search and Nelder-Mead algorithms to optimize joint economic lot sizing problem ⋮ Evolutionary techniques applied to the optimal short-term scheduling of the electrical energy production ⋮ The gradient evolution algorithm: a new metaheuristic ⋮ Combining metaheuristics with mathematical programming, constraint programming and machine learning ⋮ Hybrid scatter tabu search for unconstrained global optimization ⋮ Hybrid simulated annealing and direct search method for nonlinear unconstrained global optimization ⋮ An intelligent genetic algorithm designed for global optimization of multi-minima functions ⋮ Hybrid real-code ant colony optimisation for constrained mechanical design ⋮ Quadratic approximation based hybrid genetic algorithm for function optimization ⋮ Extended ant colony optimization for non-convex mixed integer nonlinear programming ⋮ A novel hybrid differential evolution and particle swarm optimization algorithm for unconstrained optimization ⋮ A tabu search approach for the minimum sum-of-squares clustering problem ⋮ Parameter estimation for partial differential equations by collage-based numerical approximation ⋮ A hybrid algorithm for optimizing multi-modal functions ⋮ Hybridizing exact methods and metaheuristics: a taxonomy ⋮ Efficient hybrid methods for global continuous optimization based on simulated annealing ⋮ An improved central force optimization algorithm for multimodal optimization

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Test examples for nonlinear programming codes
• Test example for nonlinear programming codes
• Genetic and Nelder--Mead algorithms hybridized for a more accurate global optimization of continuous multiminima functions.
• The continuous reactive tabu search: Blending combinatorial optimization and stochastic search for global optimization
• Taboo Search: An Approach to the Multiple Minima Problem
• Tabu Search—Part I
• Tabu Search—Part II
• Nonlinear optimization of constrained functions using tabu search
• FITTING OF TABU SEARCH TO OPTIMIZE FUNCTIONS OF CONTINUOUS VARIABLES
• Enhanced simulated annealing for globally minimizing functions of many-continuous variables
• A Simplex Method for Function Minimization
• A continuous genetic algorithm designed for the global optimization of multimodal functions

This page was built for publication: A hybrid method combining continuous tabu search and Nelder--Mead simplex algorithms for the global optimization of multiminima functions