Hybridizing local search algorithms for global optimization

DOI10.1007/s10589-014-9652-1zbMath1310.90087OpenAlexW2072180213MaRDI QIDQ480947

Morteza Alinia Ahandani, Mohammad-Taghi Vakil-Baghmisheh, Mohammad Talebi

Publication date: 12 December 2014

Published in: Computational Optimization and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10589-014-9652-1

zbMATH Keywords

global optimizationlocal searchbidirectional random optimizationhybrid strategyNelder-Mead simplex

Mathematics Subject Classification ID

Nonconvex programming, global optimization (90C26) Approximation methods and heuristics in mathematical programming (90C59)

Uses Software

• Tabu search
• EvLib
• CEC 05

Cites Work

• Unnamed Item
• Unnamed Item
• Optimization by Simulated Annealing
• A hybrid method combining continuous tabu search and Nelder--Mead simplex algorithms for the global optimization of multiminima functions
• An improved GA and a novel PSO-GA-based hybrid algorithm
• A subgradient optimization model for continuous road network design problem
• A hybrid simplex search and particle swarm optimization for unconstrained optimization
• An algorithm for local continuous optimization of traffic signals
• Performance of EAs for four-bar linkage synthesis
• A study on the use of non-parametric tests for analyzing the evolutionary algorithms' behaviour: a case study on the CEC'2005 special session on real parameter optimization
• Differential evolution -- a simple and efficient heuristic for global optimization over continuous spaces
• Recent advances in memetic algorithms.
• Genetic and Nelder--Mead algorithms hybridized for a more accurate global optimization of continuous multiminima functions.
• A multi-start opposition-based particle swarm optimization algorithm with adaptive velocity for bound constrained global optimization
• Multi-start methods for combinatorial optimization
• Stopping and restarting strategy for stochastic sequential search in global optimization
• A user's guide to tabu search
• Particle swarm and ant colony algorithms hybridized for improved continuous optimization
• A very fast TS/SA algorithm for the job shop scheduling problem
• Continuous functions minimization by dynamic random search technique
• A hybrid genetic algorithm for a class of global optimization problems with box constraints
• Random optimization
• Efficient Multi-Start Strategies for Local Search Algorithms
• A Memetic-Neural Approach to Discover Resources in P2P Networks
• A Simplex Method for Function Minimization

This page was built for publication: Hybridizing local search algorithms for global optimization