Improved Runtime Bound for the $(μ+ 1)$ EA on BinVal
Two new research papers explore the performance of evolutionary algorithms (EAs) in dynamic environments. The first paper analyzes the (1+1)-EA on dynamic linear environments, proving a sharp threshold in mutation rate that dictates whether optimization time is polynomial or exponential. The second paper focuses on the (μ+1) EA for the Binary Value (BinVal) function, establishing a significantly improved runtime bound that shows it is only logarithmically slower than on the OneMax function. AI