Level-Based Theorems for Runtime Analysis of Multi-objective Evolutionary Algorithms

Download PDF
Open Webpage

Duc-Cuong Dang, Andre Opris, Dirk Sudholt

Published: 2024, Last Modified: 07 May 2026PPSN (3) 2024EveryoneRevisionsBibTeXCC BY-SA 4.0
Abstract: Runtime analysis of multi-objective evolutionary algorithms (MOEAs) is a rapidly emerging field in which recent breakthroughs studied state-of-the-art MOEAs like NSGA-II and NSGA-III. These analyses typically bound the expected time to cover the Pareto front by analysing (1) the expected time to find a first Pareto-optimal search point and (2) the expected time to cover the whole Pareto front from there.