A hybrid algorithm for identifying global and local minima when optimizing functions with many minima.

DOI10.1016/S0377-2217(02)00871-8zbMath1053.90058OpenAlexW2013202370MaRDI QIDQ1428045

D. Massart

Publication date: 14 March 2004

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

Full work available at URL: https://doi.org/10.1016/s0377-2217(02)00871-8

zbMATH Keywords

Tabu searchGlobal optimizationSimulated annealingHybrid algorithms

Mathematics Subject Classification ID

Nonconvex programming, global optimization (90C26) Search theory (90B40)

Related Items (8)

CGRS -- an advanced hybrid method for global optimization of continuous functions closely coupling extended random search and conjugate gradient method ⋮ MinFinder: locating all the local minima of a function ⋮ Interval oriented multi-section techniques for global optimization ⋮ GEM: A novel evolutionary optimization method with improved neighborhood search ⋮ An efficient algorithm for range computation of polynomials using the Bernstein form ⋮ A memetic particle swarm optimisation algorithm for dynamic multi-modal optimisation problems ⋮ Efficient hybrid methods for global continuous optimization based on simulated annealing ⋮ Real-coded genetic algorithm with variable rates of cross-over and mutation: a basis of global optimization for multi-modal functions via interval technique

Uses Software

• Tabu search

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Optimization by Simulated Annealing
• Global optimization and stochastic differential equations
• Global optimization and simulated annealing
• A tabu search approach for the resource constrained project scheduling problem
• A tabu search Hooke and Jeeves algorithm for unconstrained optimization
• Tabu search applied to global optimization
• The continuous reactive tabu search: Blending combinatorial optimization and stochastic search for global optimization
• Taboo Search: An Approach to the Multiple Minima Problem
• Using simulated annealing to solve routing and location problems
• Stochastic global optimization methods part II: Multi level methods
• General Purpose Simulated Annealing
• FITTING OF TABU SEARCH TO OPTIMIZE FUNCTIONS OF CONTINUOUS VARIABLES
• Enhanced simulated annealing for globally minimizing functions of many-continuous variables
• Capacitated clustering problems by hybrid simulated annealing and tabu search
• 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 algorithm for identifying global and local minima when optimizing functions with many minima.