Proceedings of the Thirty-Second International Joint Conference on Artificial Intelligence 2023
DOI: 10.24963/ijcai.2023/613
|View full text |Cite
|
Sign up to set email alerts
|

The First Proven Performance Guarantees for the Non-Dominated Sorting Genetic Algorithm II (NSGA-II) on a Combinatorial Optimization Problem

Sacha Cerf,
Benjamin Doerr,
Benjamin Hebras
et al.

Abstract: The Non-dominated Sorting Genetic Algorithm-II (NSGA-II) is one of the most prominent algorithms to solve multi-objective optimization problems. Recently, the first mathematical runtime guarantees have been obtained for this algorithm, however only for synthetic benchmark problems. In this work, we give the first proven performance guarantees for a classic optimization problem, the NP-complete bi-objective minimum spanning tree problem. More specifically, we show that the NSGA-II with population size N >… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
2
0

Year Published

2023
2023
2024
2024

Publication Types

Select...
5
2

Relationship

0
7

Authors

Journals

citations
Cited by 17 publications
(2 citation statements)
references
References 12 publications
0
2
0
Order By: Relevance
“…The GKS algorithm is a scheduling approach proposed in Cerf et al (2023) that uses knapsack to deploy modules on fog devices. Using knapsack approaches, PEs are allocated to modules.…”
Section: Literature Surveymentioning
confidence: 99%
“…The GKS algorithm is a scheduling approach proposed in Cerf et al (2023) that uses knapsack to deploy modules on fog devices. Using knapsack approaches, PEs are allocated to modules.…”
Section: Literature Surveymentioning
confidence: 99%
“…Two results showing that crossover can give asymptotic performance gains appeared in parallel [37], [38]. The first runtime analysis for a combinatorial optimization problem, the biobjective minimum spanning tree problem previously analyzed for the GSEMO [39], appeared in [40]. A runtime analysis in the presence of noise (together with the independent parallel work [16] the first mathematical runtime analysis of a MOEA in a noisy environment) was conducted in [41].…”
mentioning
confidence: 99%