Hybrid scatter tabu search for unconstrained global optimization
From MaRDI portal
Publication:542001
DOI10.1007/S10479-009-0596-2zbMATH Open1213.90200OpenAlexW2107392348MaRDI QIDQ542001FDOQ542001
Rafael MartΓ, Abraham Duarte, Francisco Gortazar, Fred Glover
Publication date: 8 June 2011
Published in: Annals of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10479-009-0596-2
Approximation methods and heuristics in mathematical programming (90C59) Nonconvex programming, global optimization (90C26)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- A Simplex Method for Function Minimization
- Fundamentals of scatter search and path relinking
- Local optima smoothing for global optimization
- Scatter search. Methodology and implementation in C. With CD-ROM.
- Global optimization by multilevel coordinate search
- Tabu search directed by direct search methods for nonlinear global optimization
- A trust-region algorithm for global optimization
- A hybrid method combining continuous tabu search and Nelder--Mead simplex algorithms for the global optimization of multiminima functions
- Heuristic algorithms for the maximum diversity problem
- Global optimization on funneling landscapes
- Tabu search for nonlinear and parametric optimization (with links to genetic algorithms)
- Experimental testing of advanced scatter search designs for global optimization of multimodal functions
- Heuristic pattern search and its hybridization with simulated annealing for nonlinear global optimization
- Global optimization by continuous grasp
- Metaheuristic optimization via memory and evolution. Tabu search and scatter search.
Cited In (12)
- Memory and Learning in Metaheuristics
- A DE-based scatter search for global optimization problems
- Variable neighborhood search approach with intensified shake for monitor placement
- The continuous reactive tabu search: Blending combinatorial optimization and stochastic search for global optimization
- Optimization procedures for the bipartite unconstrained 0-1 quadratic programming problem
- Multiagent algorithms for optimizing bundles of trajectories of deterministic systems with incomplete instant feedback
- A black-box scatter search for optimization problems with integer variables
- Computational investigation of simple memetic approaches for continuous global optimization
- Cyber swarm algorithms - improving particle swarm optimization using adaptive memory strategies
- Scatter search and local NLP solvers: a multistart framework for global optimization
- Adaptive memory programming for constrained global optimization
- Scatter search for the bandpass problem
Uses Software
Recommendations
- Title not available (Why is that?) π π
- A hybrid simplex search and particle swarm optimization for unconstrained optimization π π
- Tabu search applied to global optimization π π
- A tabu search Hooke and Jeeves algorithm for unconstrained optimization π π
- Hybrid extreme point tabu search π π
- A DE-based scatter search for global optimization problems π π
- TABU search methodology in global optimization π π
- THE SCALING OF HYBRID METHOD IN SOLVING UNCONSTRAINED OPTIMIZATION METHOD π π
- An alternative hybrid search direction for unconstrained optimization π π
This page was built for publication: Hybrid scatter tabu search for unconstrained global optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q542001)