Copertina

Approximation Guarantees for the Non-Dominated Sorting Genetic Algorithm II (NSGA-II)

Fuente: arXiv

Salvato in:

Dettagli Bibliografici
Autori principali:	Zheng, Weijie, Doerr, Benjamin
Natura:	Preprint
Pubblicazione:	2022
Soggetti:	Neural and Evolutionary Computing Artificial Intelligence
Accesso online:	Acceder al recurso
Tags:	Aggiungi Tag Nessun Tag, puoi essere il primo ad aggiungerne!!

Documenti analoghi

The First Theoretical Approximation Guarantees for the Non-Dominated Sorting Genetic Algorithm III (NSGA-III)
di: Deng, Renzhong, et al.
Pubblicazione: (2025)

Runtime Analysis for the NSGA-II: Proving, Quantifying, and Explaining the Inefficiency For Many Objectives
di: Zheng, Weijie, et al.
Pubblicazione: (2022)

A Crowding Distance That Provably Solves the Difficulties of the NSGA-II in Many-Objective Optimization
di: Zheng, Weijie, et al.
Pubblicazione: (2024)

Theoretical Analyses of Multiobjective Evolutionary Algorithms on Multimodal Objectives
di: Zheng, Weijie, et al.
Pubblicazione: (2020)

Proven Approximation Guarantees in Multi-Objective Optimization: SPEA2 Beats NSGA-II
di: Alghouass, Yasser, et al.
Pubblicazione: (2025)

Runtime Analysis for the NSGA-II: Provable Speed-Ups From Crossover
di: Doerr, Benjamin, et al.
Pubblicazione: (2022)

A First Runtime Analysis of the NSGA-II on a Multimodal Problem
di: Doerr, Benjamin, et al.
Pubblicazione: (2022)

Scalable Speed-ups for the SMS-EMOA from a Simple Aging Strategy
di: Li, Mingfeng, et al.
Pubblicazione: (2025)

Speeding Up the NSGA-II via Dynamic Population Sizes
di: Doerr, Benjamin, et al.
Pubblicazione: (2025)

Difficulties of the NSGA-II with the Many-Objective LeadingOnes Problem
di: Doerr, Benjamin, et al.
Pubblicazione: (2024)

Speeding Up the NSGA-II With a Simple Tie-Breaking Rule
di: Doerr, Benjamin, et al.
Pubblicazione: (2024)

Runtime Analysis for Permutation-based Evolutionary Algorithms
di: Doerr, Benjamin, et al.
Pubblicazione: (2022)

When Switching Algorithms Helps: A Theoretical Study of Online Algorithm Selection
di: Antipov, Denis, et al.
Pubblicazione: (2026)

A Block-Coordinate Descent EMO Algorithm: Theoretical and Empirical Analysis
di: Doerr, Benjamin, et al.
Pubblicazione: (2024)

Lower Bounds from Fitness Levels Made Easy
di: Doerr, Benjamin, et al.
Pubblicazione: (2021)

Near-Tight Runtime Guarantees for Many-Objective Evolutionary Algorithms
di: Wietheger, Simon, et al.
Pubblicazione: (2024)

Runtime Analysis of the SMS-EMOA for Many-Objective Optimization
di: Zheng, Weijie, et al.
Pubblicazione: (2023)

First Mathematical Runtime Analyses of Multi-Objective Evolutionary Algorithms for Multi-Valued Decision Variables
di: Li, Mingfeng, et al.
Pubblicazione: (2026)

Already Moderate Population Sizes Provably Yield Strong Robustness to Noise
di: Antipov, Denis, et al.
Pubblicazione: (2024)

An Extended Jump Functions Benchmark for the Analysis of Randomized Search Heuristics
di: Bambury, Henry, et al.
Pubblicazione: (2021)

Lazy Parameter Tuning and Control: Choosing All Parameters Randomly From a Power-Law Distribution
di: Antipov, Denis, et al.
Pubblicazione: (2021)

Runtime Analysis of the Compact Genetic Algorithm on the LeadingOnes Benchmark
di: Chwiałkowski, Marcel, et al.
Pubblicazione: (2025)

A Non-Dominated Sorting Evolutionary Algorithm Updating When Required
di: Farias, Lucas R. C., et al.
Pubblicazione: (2025)

Superior Genetic Algorithms for the Target Set Selection Problem Based on Power-Law Parameter Choices and Simple Greedy Heuristics
di: Doerr, Benjamin, et al.
Pubblicazione: (2024)

Improved Runtime Guarantees for the SPEA2 Multi-Objective Optimizer
di: Doerr, Benjamin, et al.
Pubblicazione: (2025)

Improved Compact Genetic Algorithms with Efficient Caching
di: Dutta, Prasanta, et al.
Pubblicazione: (2025)

Non-Dominated Sorting Bidirectional Differential Coevolution
di: Mendes, Cicero S. R., et al.
Pubblicazione: (2024)

The Runtime of Random Local Search on the Generalized Needle Problem
di: Doerr, Benjamin, et al.
Pubblicazione: (2024)

Fourier Analysis Meets Runtime Analysis: Precise Runtimes on Plateaus
di: Doerr, Benjamin, et al.
Pubblicazione: (2023)

Hyper-Heuristics Can Profit From Global Variation Operators
di: Doerr, Benjamin, et al.
Pubblicazione: (2024)

MultiGA: Leveraging Multi-Source Seeding in Genetic Algorithms
di: Ng, Isabelle Diana May-Xin, et al.
Pubblicazione: (2025)

Proven Runtime Guarantees for How the MOEA/D Computes the Pareto Front From the Subproblem Solutions
di: Doerr, Benjamin, et al.
Pubblicazione: (2024)

Evolutionary Algorithms Are Significantly More Robust to Noise When They Ignore It
di: Antipov, Denis, et al.
Pubblicazione: (2024)

Efficient Disruption of Criminal Networks through Multi-Objective Genetic Algorithms
di: Darmadi, Yehezkiel, et al.
Pubblicazione: (2026)

Strategies for Resource Allocation of Two Competing Companies using Genetic Algorithm
di: Cheung, Wing Keung, et al.
Pubblicazione: (2025)

Evolving Benchmark Functions to Compare Evolutionary Algorithms via Genetic Programming
di: He, Yifan, et al.
Pubblicazione: (2024)

Tuning Synaptic Connections instead of Weights by Genetic Algorithm in Spiking Policy Network
di: Zhang, Duzhen, et al.
Pubblicazione: (2022)

A Genetic Algorithm for Multi-Capacity Fixed-Charge Flow Network Design
di: Eardley, Caleb, et al.
Pubblicazione: (2024)

Improving Air Mobility for Pre-Disaster Planning with Neural Network Accelerated Genetic Algorithm
di: Acharya, Kamal, et al.
Pubblicazione: (2024)

Hybrid Firefly-Genetic Algorithm for Single and Multi-dimensional 0-1 Knapsack Problems
di: Malanthara, Aswathi, et al.
Pubblicazione: (2024)