Cover Image

Superior Genetic Algorithms for the Target Set Selection Problem Based on Power-Law Parameter Choices and Simple Greedy Heuristics

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Doerr, Benjamin, Krejca, Martin S., Vu, Nguyen
Format:	Preprint
Published:	2024
Subjects:	Neural and Evolutionary Computing
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

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

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

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

Runtime Analysis for Multi-Objective Evolutionary Algorithms in Unbounded Integer Spaces
by: Doerr, Benjamin, et al.
Published: (2024)

Estimation-of-Distribution Algorithms for Multi-Valued Decision Variables
by: Jedidia, Firas Ben, et al.
Published: (2023)

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

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

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

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

Runtime Analysis of a Compact Genetic Algorithm on a Truly Multi-valued OneMax Function
by: Krejca, Martin S., et al.
Published: (2026)

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

A Flexible Evolutionary Algorithm With Dynamic Mutation Rate Archive
by: Krejca, Martin S., et al.
Published: (2024)

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

Approximation Guarantees for the Non-Dominated Sorting Genetic Algorithm II (NSGA-II)
by: Zheng, Weijie, et al.
Published: (2022)

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

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

A Census-Based Genetic Algorithm for Target Set Selection Problem in Social Networks
by: Rahman, Md. Samiur, et al.
Published: (2024)

Finding Low Star Discrepancy 3D Kronecker Point Sets Using Algorithm Configuration Techniques
by: Abderrahim, Imène Ait, et al.
Published: (2026)

Hybridizing Target- and SHAP-encoded Features for Algorithm Selection in Mixed-variable Black-box Optimization
by: Dietrich, Konstantin, et al.
Published: (2024)

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

Improved Genetic Algorithm Based on Greedy and Simulated Annealing Ideas for Vascular Robot Ordering Strategy
by: Wang, Zixi, et al.
Published: (2024)

Impact of Training Instance Selection on Automated Algorithm Selection Models for Numerical Black-box Optimization
by: Dietrich, Konstantin, et al.
Published: (2024)

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

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

Large-scale Benchmarking of Metaphor-based Optimization Heuristics
by: Vermetten, Diederick, et al.
Published: (2024)

Enhancing Parameter Control Policies with State Information
by: Covini, Gianluca, et al.
Published: (2025)

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

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

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

HSEvo: Elevating Automatic Heuristic Design with Diversity-Driven Harmony Search and Genetic Algorithm Using LLMs
by: Dat, Pham Vu Tuan, et al.
Published: (2024)

Algorithm Instance Footprint: Separating Easily Solvable and Challenging Problem Instances
by: Nikolikj, Ana, et al.
Published: (2023)

Tight Runtime Guarantees From Understanding the Population Dynamics of the GSEMO Multi-Objective Evolutionary Algorithm
by: Doerr, Benjamin, et al.
Published: (2025)

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

How Sequential Algorithm Portfolios can benefit Black Box Optimization
by: Dinu, Catalin-Viorel, et al.
Published: (2026)

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

Rethinking Selection in Generational Genetic Algorithms to Solve Combinatorial Optimization Problems: An Upper Bound-based Parent Selection Strategy for Recombination
by: Sankaran, Prashant, et al.
Published: (2024)

Tight Runtime Bounds for Static Unary Unbiased Evolutionary Algorithms on Linear Functions
by: Doerr, Carola, et al.
Published: (2023)

Speeding Up Hyper-Heuristics With Markov-Chain Operator Selection and the Only-Worsening Acceptance Operator
by: Bendahi, Abderrahim, et al.
Published: (2025)

Evolutionary Greedy Algorithm for Optimal Sensor Placement Problem in Urban Sewage Surveillance
by: Wang, Sunyu, et al.
Published: (2024)

CSRX: A novel Crossover Operator for a Genetic Algorithm applied to the Traveling Salesperson Problem
by: Uray, Martin, et al.
Published: (2023)