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

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

D. Massart

Publication date: 14 March 2004

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

zbMATH Keywords

Tabu search; Global optimization; Simulated annealing; Hybrid algorithms

Mathematics Subject Classification ID

90C26: Nonconvex programming, global optimization

90B40: Search theory

Related Items

Efficient hybrid methods for global continuous optimization based on simulated annealing

Uses Software

• Tabu search

Cites Work

• Unnamed Item
• 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
• 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