Analysis of (1+1) EA on LeadingOnes with Constraints
Analysis of (1+1) EA on LeadingOnes with Constraints
Understanding how evolutionary algorithms perform on constrained problems has gained increasing attention in recent years. In this paper, we study how evolutionary algorithms optimize constrained versions of the classical LeadingOnes problem. We first provide a run time analysis for the classical (1+1) EA on the LeadingOnes problem with a deterministic …