Runtime Analysis of a Compact Genetic Algorithm with High Selection Pressure
Year: 2025
Type: conference-paper
Abstract: The Compact Genetic Algorithm (cGA) is an estimation-of-distribution algorithm that has been receiving much attention especially in the runtime analysis community in recent years. It comes with a single parameter K determining its strength of updates. Contrary to other estimation-of-distribution algorithms like the UMDA, the standard cGA does not have a parameter controlling its selection pressure.
Authors: Sumit Adak, Carsten Witt
Institution: Technical University of Denmark
Language: English
Subfield: Artificial Intelligence
Field: Computer Science
Domain: Physical Sciences
Open Access status: gold
Funder: Universitas Brawijaya
Award: G1282054180
OpenAlex ID: W4413311589