Hybridizing evolutionary algorithms with variable-depth search to overcome local optima
From MaRDI portal
(Redirected from Publication:633833)
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
Cites work
- scientific article; zbMATH DE number 610968 (Why is no real title available?)
- scientific article; zbMATH DE number 1062113 (Why is no real title available?)
- scientific article; zbMATH DE number 1962832 (Why is no real title available?)
- scientific article; zbMATH DE number 2050711 (Why is no real title available?)
- scientific article; zbMATH DE number 3249395 (Why is no real title available?)
- A comparison of simulated annealing with a simple evolutionary algorithm on pseudo-Boolean functions of unitation
- A simple min-cut algorithm
- A study on the use of ``self-generation in memetic algorithms
- An Effective Heuristic Algorithm for the Traveling-Salesman Problem
- An Efficient Heuristic Procedure for Partitioning Graphs
- An estimation of distribution algorithm with intelligent local search for rule-based nurse rostering
- Analysis of a multiobjective evolutionary algorithm on the 0-1 knapsack problem
- Ant colony optimization and local search for bin packing and cutting stock problems
- Ant colony optimization.
- Automata, Languages and Programming
- Computing minimum cuts by randomized search heuristics
- Introduction to algorithms
- Local Search in Evolutionary Algorithms: The Impact of the Local Search Frequency
- On the analysis of the \((1+1)\) evolutionary algorithm
- Optimization with randomized search heuristics -- the (A)NFL theorem, realistic scenarios, and difficult functions.
- Probability and Computing
- Randomized local search, evolutionary algorithms, and the minimum spanning tree problem
- Real royal road functions -- where crossover provably is essential
- Recent advances in memetic algorithms.
- STACS 2005
- Simplified drift analysis for proving lower bounds in evolutionary computation
- The Metropolis algorithm for graph bisection
- The impact of parametrization in memetic evolutionary algorithms
- Variable neighborhood search
Cited in
(10)- Hyper-Heuristic Based on Iterated Local Search Driven by Evolutionary Algorithm
- 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
- scientific article; zbMATH DE number 1941955 (Why is no real title available?)
- A hybrid multiobjective evolutionary algorithm: Striking a balance with local search
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)
