Hybridizing evolutionary algorithms with variable-depth search to overcome local optima
DOI10.1007/S00453-009-9384-2zbMATH Open1211.90200OpenAlexW2025746323MaRDI QIDQ633833FDOQ633833
Authors: Dirk Sudholt 
Publication date: 30 March 2011
Published in: Algorithmica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00453-009-9384-2
Recommendations
- On gradient-based local search to hybridize multi-objective evolutionary algorithms
- A hybrid optimization technique coupling an evolutionary and a local search algorithm
- A hybrid multiobjective evolutionary algorithm: Striking a balance with local search
- A hybrid evolutionary algorithm for global optimization
- Hybridization of adaptive differential evolution with an expensive local search method
- scientific article; zbMATH DE number 1941955
- Hybrid evolutionary algorithm for solving optimization problems
- A new hybrid of evolutionary and conventional optimization algorithms
simulated annealingcombinatorial optimizationhybridizationevolutionary algorithmsiterated local searchruntime analysismemetic algorithms
Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Introduction to algorithms
- An Efficient Heuristic Procedure for Partitioning Graphs
- Ant colony optimization.
- Title not available (Why is that?)
- Variable neighborhood search
- STACS 2005
- The Metropolis algorithm for graph bisection
- Probability and Computing
- An Effective Heuristic Algorithm for the Traveling-Salesman Problem
- Title not available (Why is that?)
- Computing minimum cuts by randomized search heuristics
- Simplified drift analysis for proving lower bounds in evolutionary computation
- Recent advances in memetic algorithms.
- Ant colony optimization and local search for bin packing and cutting stock problems
- An estimation of distribution algorithm with intelligent local search for rule-based nurse rostering
- A simple min-cut algorithm
- Local Search in Evolutionary Algorithms: The Impact of the Local Search Frequency
- Real royal road functions -- where crossover provably is essential
- Analysis of a multiobjective evolutionary algorithm on the 0-1 knapsack problem
- On the analysis of the \((1+1)\) evolutionary algorithm
- Automata, Languages and Programming
- Randomized local search, evolutionary algorithms, and the minimum spanning tree problem
- Optimization with randomized search heuristics -- the (A)NFL theorem, realistic scenarios, and difficult functions.
- A study on the use of ``self-generation in memetic algorithms
- The impact of parametrization in memetic evolutionary algorithms
- A comparison of simulated annealing with a simple evolutionary algorithm on pseudo-Boolean functions of unitation
Cited In (10)
- On the analysis of trajectory-based search algorithms: when is it beneficial to reject improvements?
- How to escape local optima in black box optimisation: when non-elitism outperforms elitism
- Memetic algorithms outperform evolutionary algorithms in multimodal optimisation
- Designing Efficient Evolutionary Algorithms for Cluster Optimization: A Study on Locality
- Analysis of an iterated local search algorithm for vertex cover in sparse random graphs
- On easiest functions for mutation operators in bio-inspired optimisation
- Learning board evaluation function for Othello by hybridizing coevolution with temporal difference learning
- Title not available (Why is that?)
- A hybrid multiobjective evolutionary algorithm: Striking a balance with local search
- Hyper-Heuristic Based on Iterated Local Search Driven by Evolutionary Algorithm
Uses Software
This page was built for publication: Hybridizing evolutionary algorithms with variable-depth search to overcome local optima
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q633833)
