Hybridizing local search algorithms for global optimization
From MaRDI portal
Recommendations
- Mixed global and local search methods as optimization algorithms
- Global optimization based on local searches
- Global optimization based on local searches
- A hybrid evolutionary algorithm for global optimization
- A combined global \& local search (CGLS) approach to global optimization
- An efficient hybrid algorithm for the optimization of problems with several local minima
- A hybrid optimization technique coupling an evolutionary and a local search algorithm
- Logic Programming
Cites work
- scientific article; zbMATH DE number 1708068 (Why is no real title available?)
- scientific article; zbMATH DE number 3497315 (Why is no real title available?)
- A Memetic-Neural Approach to Discover Resources in P2P Networks
- A Simplex Method for Function Minimization
- A hybrid genetic algorithm for a class of global optimization problems with box constraints
- A hybrid method combining continuous tabu search and Nelder--Mead simplex algorithms for the global optimization of multiminima functions
- A hybrid simplex search and particle swarm optimization for unconstrained optimization
- A multi-start opposition-based particle swarm optimization algorithm with adaptive velocity for bound constrained global optimization
- 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
- A subgradient optimization model for continuous road network design problem
- A user's guide to tabu search
- A very fast TS/SA algorithm for the job shop scheduling problem
- An algorithm for local continuous optimization of traffic signals
- An improved GA and a novel PSO-GA-based hybrid algorithm
- Continuous functions minimization by dynamic random search technique
- Differential evolution -- a simple and efficient heuristic for global optimization over continuous spaces
- Efficient multi-start strategies for local search algorithms
- Genetic and Nelder--Mead algorithms hybridized for a more accurate global optimization of continuous multiminima functions.
- Multi-start methods for combinatorial optimization
- Optimization by simulated annealing
- Particle swarm and ant colony algorithms hybridized for improved continuous optimization
- Performance of EAs for four-bar linkage synthesis
- Random optimization
- Recent advances in memetic algorithms.
- Stopping and restarting strategy for stochastic sequential search in global optimization
Cited in
(10)- scientific article; zbMATH DE number 1728444 (Why is no real title available?)
- Global optimization based on local searches
- Combining the scalability of local search with the pruning techniques of systematic search
- A combined global \& local search (CGLS) approach to global optimization
- Two effective hybrid metaheuristic algorithms for minimization of multimodal functions
- Genetic and Nelder--Mead algorithms hybridized for a more accurate global optimization of continuous multiminima functions.
- scientific article; zbMATH DE number 5763786 (Why is no real title available?)
- Hybridization of adaptive differential evolution with an expensive local search method
- Three new stochastic local search algorithms for continuous optimization problems
- Global optimization based on local searches
This page was built for publication: Hybridizing local search algorithms for global optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q480947)
