Hybridizing evolutionary algorithms with variable-depth search to overcome local optima

DOI10.1007/s00453-009-9384-2zbMath1211.90200OpenAlexW2025746323MaRDI QIDQ633833

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

zbMATH Keywords

combinatorial optimizationsimulated annealingevolutionary algorithmshybridizationiterated local searchruntime analysismemetic algorithms

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)

Related Items (5)

On easiest functions for mutation operators in bio-inspired optimisation ⋮ Analysis of an iterated local search algorithm for vertex cover in sparse random graphs ⋮ Memetic algorithms outperform evolutionary algorithms in multimodal optimisation ⋮ 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

Uses Software

• Tabu search

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Computing minimum cuts by randomized search heuristics
• Simplified drift analysis for proving lower bounds in evolutionary computation
• Randomized local search, evolutionary algorithms, and the minimum spanning tree problem
• The impact of parametrization in memetic evolutionary algorithms
• Variable neighborhood search
• The Metropolis algorithm for graph bisection
• On the analysis of the \((1+1)\) evolutionary algorithm
• Recent advances in memetic algorithms.
• A study on the use of ``self-generation in memetic algorithms
• Optimization with randomized search heuristics -- the (A)NFL theorem, realistic scenarios, and difficult functions.
• Real royal road functions -- where crossover provably is essential
• A comparison of simulated annealing with a simple evolutionary algorithm on pseudo-Boolean functions of unitation
• Analysis of a multiobjective evolutionary algorithm on the 0-1 knapsack problem
• An estimation of distribution algorithm with intelligent local search for rule-based nurse rostering
• An Efficient Heuristic Procedure for Partitioning Graphs
• A simple min-cut algorithm
• Ant colony optimization and local search for bin packing and cutting stock problems
• Local Search in Evolutionary Algorithms: The Impact of the Local Search Frequency
• Probability and Computing
• An Effective Heuristic Algorithm for the Traveling-Salesman Problem
• STACS 2005
• Automata, Languages and Programming

This page was built for publication: Hybridizing evolutionary algorithms with variable-depth search to overcome local optima