Image de couverture de livre

Speeding Up the NSGA-II With a Simple Tie-Breaking Rule

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Doerr, Benjamin, Ivan, Tudor, Krejca, Martin S.
Format:	Preprint
Publié:	2024
Sujets:	Neural and Evolutionary Computing
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

Speeding Up the NSGA-II via Dynamic Population Sizes
par: Doerr, Benjamin, et autres
Publié: (2025)

Difficulties of the NSGA-II with the Many-Objective LeadingOnes Problem
par: Doerr, Benjamin, et autres
Publié: (2024)

Proven Approximation Guarantees in Multi-Objective Optimization: SPEA2 Beats NSGA-II
par: Alghouass, Yasser, et autres
Publié: (2025)

Superior Genetic Algorithms for the Target Set Selection Problem Based on Power-Law Parameter Choices and Simple Greedy Heuristics
par: Doerr, Benjamin, et autres
Publié: (2024)

Runtime Analysis for Multi-Objective Evolutionary Algorithms in Unbounded Integer Spaces
par: Doerr, Benjamin, et autres
Publié: (2024)

Proven Runtime Guarantees for How the MOEA/D Computes the Pareto Front From the Subproblem Solutions
par: Doerr, Benjamin, et autres
Publié: (2024)

Improved Runtime Guarantees for the SPEA2 Multi-Objective Optimizer
par: Doerr, Benjamin, et autres
Publié: (2025)

Runtime Analysis of the Compact Genetic Algorithm on the LeadingOnes Benchmark
par: Chwiałkowski, Marcel, et autres
Publié: (2025)

Runtime Analysis for the NSGA-II: Provable Speed-Ups From Crossover
par: Doerr, Benjamin, et autres
Publié: (2022)

Estimation-of-Distribution Algorithms for Multi-Valued Decision Variables
par: Jedidia, Firas Ben, et autres
Publié: (2023)

Approximation Guarantees for the Non-Dominated Sorting Genetic Algorithm II (NSGA-II)
par: Zheng, Weijie, et autres
Publié: (2022)

Runtime Analysis for the NSGA-II: Proving, Quantifying, and Explaining the Inefficiency For Many Objectives
par: Zheng, Weijie, et autres
Publié: (2022)

The First Theoretical Approximation Guarantees for the Non-Dominated Sorting Genetic Algorithm III (NSGA-III)
par: Deng, Renzhong, et autres
Publié: (2025)

A Crowding Distance That Provably Solves the Difficulties of the NSGA-II in Many-Objective Optimization
par: Zheng, Weijie, et autres
Publié: (2024)

Scalable Speed-ups for the SMS-EMOA from a Simple Aging Strategy
par: Li, Mingfeng, et autres
Publié: (2025)

A First Runtime Analysis of the NSGA-II on a Multimodal Problem
par: Doerr, Benjamin, et autres
Publié: (2022)

Runtime Analysis of a Compact Genetic Algorithm on a Truly Multi-valued OneMax Function
par: Krejca, Martin S., et autres
Publié: (2026)

A Flexible Evolutionary Algorithm With Dynamic Mutation Rate Archive
par: Krejca, Martin S., et autres
Publié: (2024)

Near-Tight Runtime Guarantees for Many-Objective Evolutionary Algorithms
par: Wietheger, Simon, et autres
Publié: (2024)

Evolutionary Algorithms Are Significantly More Robust to Noise When They Ignore It
par: Antipov, Denis, et autres
Publié: (2024)

Runtime Analysis of the SMS-EMOA for Many-Objective Optimization
par: Zheng, Weijie, et autres
Publié: (2023)

Speeding Up Hyper-Heuristics With Markov-Chain Operator Selection and the Only-Worsening Acceptance Operator
par: Bendahi, Abderrahim, et autres
Publié: (2025)

First Mathematical Runtime Analyses of Multi-Objective Evolutionary Algorithms for Multi-Valued Decision Variables
par: Li, Mingfeng, et autres
Publié: (2026)

Theoretical Analyses of Multiobjective Evolutionary Algorithms on Multimodal Objectives
par: Zheng, Weijie, et autres
Publié: (2020)

Lower Bounds from Fitness Levels Made Easy
par: Doerr, Benjamin, et autres
Publié: (2021)

Finding Low Star Discrepancy 3D Kronecker Point Sets Using Algorithm Configuration Techniques
par: Abderrahim, Imène Ait, et autres
Publié: (2026)

GPU-accelerated Evolutionary Many-objective Optimization Using Tensorized NSGA-III
par: Li, Hao, et autres
Publié: (2025)

On the Impact of Crossover in Many-Objective Optimization: A Runtime Analysis of NSGA-III
par: Opris, Andre
Publié: (2026)

Tight Runtime Guarantees From Understanding the Population Dynamics of the GSEMO Multi-Objective Evolutionary Algorithm
par: Doerr, Benjamin, et autres
Publié: (2025)

Lazy Parameter Tuning and Control: Choosing All Parameters Randomly From a Power-Law Distribution
par: Antipov, Denis, et autres
Publié: (2021)

A Memetic NSGA-III for Green Flexible Production with Real-Time Energy Costs & Emissions
par: Burmeister, Sascha C
Publié: (2024)

Enhancing Parameter Control Policies with State Information
par: Covini, Gianluca, et autres
Publié: (2025)

Already Moderate Population Sizes Provably Yield Strong Robustness to Noise
par: Antipov, Denis, et autres
Publié: (2024)

An Extended Jump Functions Benchmark for the Analysis of Randomized Search Heuristics
par: Bambury, Henry, et autres
Publié: (2021)

Similarity-based Portfolio Construction for Black-box Optimization
par: Dinu, Catalin-Viorel, et autres
Publié: (2026)

How Sequential Algorithm Portfolios can benefit Black Box Optimization
par: Dinu, Catalin-Viorel, et autres
Publié: (2026)

Tight Runtime Bounds for Static Unary Unbiased Evolutionary Algorithms on Linear Functions
par: Doerr, Carola, et autres
Publié: (2023)

First Steps Towards a Runtime Analysis When Starting With a Good Solution
par: Antipov, Denis, et autres
Publié: (2020)

Runtime Analysis for Permutation-based Evolutionary Algorithms
par: Doerr, Benjamin, et autres
Publié: (2022)

Impact of Training Instance Selection on Automated Algorithm Selection Models for Numerical Black-box Optimization
par: Dietrich, Konstantin, et autres
Publié: (2024)