Runtime Analysis of a Co-Evolutionary Algorithm

DOI10.1145/3594805.3607132OpenAlexW4385439033MaRDI QIDQ6120969

Per Kristian Lehre, Mario Alejandro Hevia Fajardo, Unnamed Author

Publication date: 23 February 2024

Published in: Proceedings of the 17th ACM/SIGEVO Conference on Foundations of Genetic Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/3594805.3607132

zbMATH Keywords

runtime analysiscompetitive coevolutionmaximin optimisation

Mathematics Subject Classification ID

Evolutionary algorithms, genetic algorithms (computational aspects) (68W50) Approximation methods and heuristics in mathematical programming (90C59) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Cites Work

• Unnamed Item
• Concentration of first hitting times under additive drift
• Min-max and min-max regret versions of combinatorial optimization problems: A survey
• Multiplicative up-drift
• First-hitting times under drift
• Upper and lower bounds for randomized search heuristics in black-box optimization
• (1+1) EA on Generalized Dynamic OneMax
• Hitting-time and occupation-time bounds implied by drift analysis with applications
• Sampling biased monotonic surfaces using exponential metrics
• Theory of Evolutionary Computation
• Probability and Computing
• Tail bounds on hitting times of randomized search heuristics using variable drift analysis
• Drift analysis and average time complexity of evolutionary algorithms

This page was built for publication: Runtime Analysis of a Co-Evolutionary Algorithm