Mathematical runtime analysis for the non-dominated sorting genetic algorithm II (NSGA-II)
Artificial Intelligence · 2023-12 · 325 · 104016
DOI: 10.1016/j.artint.2023.104016 ↗Kurz gefasst
Fachartikel in der Zeitschrift Artificial Intelligence, 2023-12. Verfasst von Weijie Zheng und 1 weiteren Autor:innen. Die Arbeit wurde bisher 84-mal zitiert (Crossref) und nennt 56 Literaturangaben. Der Volltext ist frei zugänglich (Open Access, CC BY-NC-ND 4.0). Gefördert von: Agence nationale de la recherche, National Natural Science Foundation of China, Department of Science and Technology of Guangdong Province.
Abstract (Originalsprache)
The non-dominated sorting genetic algorithm II (NSGA-II) is the most intensively used multi-objective evolutionary algorithm (MOEA) in real-world applications. However, in contrast to several simple MOEAs analyzed also via mathematical means, no such study exists for the NSGA-II so far. In this work, we show that mathematical runtime analyses are feasible also for the NSGA-II. As particular results, we prove that with a population size four times larger than the size of the Pareto front, the NSGA-II with two classic mutation operators and four different ways to select the parents satisfies the same asymptotic runtime guarantees as the SEMO and GSEMO algorithms on the basic OneMinMax and LeadingOnesTrailingZeros benchmarks. However, if the population size is only equal to the size of the Pareto front, then the NSGA-II cannot efficiently compute the full Pareto front: for an exponential number of iterations, the population will always miss a constant fraction of the Pareto front. Our experiments confirm the above findings.
Förderung
- Agence nationale de la recherche
- National Natural Science Foundation of China
- Department of Science and Technology of Guangdong Province
- Science, Technology and Innovation Commission of Shenzhen Municipality
- Basic and Applied Basic Research Foundation of Guangdong Province
Zitieren
APA
Zheng, W., & Doerr, B. (2023). Mathematical runtime analysis for the non-dominated sorting genetic algorithm II (NSGA-II). Artificial Intelligence, 325, 104016. https://doi.org/10.1016/j.artint.2023.104016
Vancouver
Zheng W, Doerr B. Mathematical runtime analysis for the non-dominated sorting genetic algorithm II (NSGA-II). Artificial Intelligence. 2023;325:104016. doi:10.1016/j.artint.2023.104016
BibTeX
@article{Zheng2023,
author = {Zheng, Weijie and Doerr, Benjamin},
title = {Mathematical runtime analysis for the non-dominated sorting genetic algorithm II (NSGA-II)},
journal = {Artificial Intelligence},
year = {2023},
volume = {325},
pages = {104016},
doi = {10.1016/j.artint.2023.104016}
}
EUVIMED