The impact of parametrization in memetic evolutionary algorithms

DOI10.1016/J.TCS.2009.03.003MaRDI QIDQ1029357zbMATH OpenOpenAlexFDO

Authors Dirk Sudholt

Publication date 10 July 2009

Published in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.tcs.2009.03.003

zbMATH Keywords

hybridizationparametrizationevolutionary algorithmsruntime analysismemetic algorithms

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Nonnumerical algorithms (68W05)

Recommendations

• Memetic evolutionary algorithms
• Local Search in Evolutionary Algorithms: The Impact of the Local Search Frequency
• Performance comparison of memetic algorithms
• Memetic algorithms: The polynomial local search complexity theory perspective
• Memetic algorithms outperform evolutionary algorithms in multimodal optimisation

Cites work

• scientific article; zbMATH DE number 2050711 (Why is no real title available?)
• A no-free-lunch theorem for non-uniform distributions of target functions
• A study on the use of ``self-generation in memetic algorithms
• 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.
• Experimental and Efficient Algorithms
• Local Search in Evolutionary Algorithms: The Impact of the Local Search Frequency
• Memetic algorithms: The polynomial local search complexity theory perspective
• 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
• Recent advances in memetic algorithms.
• STACS 2005
• Theoretical aspects of local search.
• Variable neighborhood search
• Worst case and probabilistic analysis of the 2-Opt algorithm for the TSP (extended abstract)

Cited in

(14)

• Does comma selection help to cope with local optima?
• Lower bounds from fitness levels made easy
• Exponential slowdown for larger populations: the \(( \mu + 1)\)-EA on monotone functions
• Region based memetic algorithm for real-parameter optimisation
• How to escape local optima in black box optimisation: when non-elitism outperforms elitism
• Lower bounds on the runtime of crossover-based algorithms via decoupling and family graphs
• Performance comparison of memetic algorithms
• A tight runtime analysis for the \((\mu + \lambda)\) EA
• Hybridizing evolutionary algorithms with variable-depth search to overcome local optima
• Memetic algorithms outperform evolutionary algorithms in multimodal optimisation
• Do additional target points speed up evolutionary algorithms?
• Memetic algorithms: The polynomial local search complexity theory perspective
• On easiest functions for mutation operators in bio-inspired optimisation
• Memetic evolutionary algorithms

This page was built for publication: The impact of parametrization in memetic evolutionary algorithms

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1029357)