Destructiveness of lexicographic parsimony pressure and alleviation by a concatenation crossover in genetic programming

DOI10.1016/j.tcs.2019.11.036zbMath1432.68623arXiv1805.10169OpenAlexW2991868307WikidataQ126633153 ScholiaQ126633153MaRDI QIDQ2306017

Timo Kötzing, Johannes Lengler, Anna Melnichenko, J. A. Gregor Lagodzinski

Publication date: 20 March 2020

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

Full work available at URL: https://arxiv.org/abs/1805.10169

zbMATH Keywords

genetic programmingmutationruntime analysis

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Evolutionary algorithms, genetic algorithms (computational aspects) (68W50) Approximation methods and heuristics in mathematical programming (90C59)

Related Items (3)

Fixed-parameter tractability of crossover: steady-state GAs on the closest string problem ⋮ Exponential slowdown for larger populations: the \(( \mu + 1)\)-EA on monotone functions ⋮ The impact of lexicographic parsimony pressure for ORDER/MAJORITY on the run time

Cites Work

• Unnamed Item
• Concentration of first hitting times under additive drift
• Simplified drift analysis for proving lower bounds in evolutionary computation
• A study of drift analysis for estimating computation time of evolutionary algorithms
• Adaptive drift analysis
• On the Time and Space Complexity of Genetic Programming for Evolving Boolean Conjunctions
• Computational complexity analysis of simple genetic programming on two problems modeling isolated program semantics
• Runtime analysis of mutation-based geometric semantic genetic programming on boolean functions
• Single- and multi-objective genetic programming
• Brief Announcement
• Probability and Computing
• Concentration of Measure for the Analysis of Randomized Algorithms

This page was built for publication: Destructiveness of lexicographic parsimony pressure and alleviation by a concatenation crossover in genetic programming