Do additional target points speed up evolutionary algorithms?

Theoretical Computer Science, vol. 950, pp. 113757

DOI: 10.1016/j.tcs.2023.113757 OpenAlex

Authors 2

Jakob Bossek corresponding Aachen Department of Computer Science

RWTH Aachen University

Affiliation as printed

Department of Computer Science, RWTH Aachen University, Germany
Dirk Sudholt corresponding

University of Passau

Affiliation as printed

Faculty of Computer Science and Mathematics, University of Passau, Germany

Cited by 4 stored of 4

4 results

No patents citing this paper on Lens.org (checked 2026-10-06).

References 60

Randomized Algorithms
1995 Cambridge University Press eBooks book Computer Science Complexity and Algorithms in Graphs Open access

5,191

citations
Proceedings of the Genetic and Evolutionary Computation Conference, GECCO 2019
2019 Dépôt institutionnel de l'Université libre de Bruxelles (Université Libre de Bruxelles) book Computer Science Evolutionary Algorithms and Applications

1,726

citations
On the analysis of the (1+1) evolutionary algorithm
2002 Theoretical Computer Science article Computer Science Metaheuristic Optimization Algorithms Research Open access

913

citations
Parallel Problem Solving from Nature — PPSN V
1998 Lecture notes in computer science conference-paper Computer Science Metaheuristic Optimization Algorithms Research

533

citations
Proceedings of the Genetic and Evolutionary Computation Conference - GECCO - 2006
2006 Data Archiving and Networked Services (DANS) book Computer Science Evolutionary Algorithms and Applications

431

citations
Bioinspired Computation in Combinatorial Optimization : Algorithms and Their Computational Complexity
2010 article Computer Science Metaheuristic Optimization Algorithms Research Open access

328

citations
Upper and Lower Bounds for Randomized Search Heuristics in Black-Box Optimization
2004 Theory of Computing Systems article Computer Science Metaheuristic Optimization Algorithms Research Open access

293

citations
On the Choice of the Offspring Population Size in Evolutionary Algorithms
2005 Evolutionary Computation article Computer Science Metaheuristic Optimization Algorithms Research Open access

239

citations
Black-Box Search by Unbiased Variation
2012 Algorithmica article Computer Science Metaheuristic Optimization Algorithms Research

204

citations
A New Method for Lower Bounds on the Running Time of Evolutionary Algorithms
2012 IEEE Transactions on Evolutionary Computation article Computer Science Metaheuristic Optimization Algorithms Research

190

citations
Analyzing Evolutionary Algorithms: The Computer Science Perspective
2013 article Computer Science Metaheuristic Optimization Algorithms Research Open access

182

citations
Evolutionary algorithms - how to cope with plateaus of constant fitness and when to reject strings of the same fitness
2001 IEEE Transactions on Evolutionary Computation article Computer Science Metaheuristic Optimization Algorithms Research Open access

141

citations
Real Royal Road Functions - Where Crossover Provably is Essential
2001 Technische Universität Dortmund Eldorado (Technische Universität Dortmund) report Computer Science Metaheuristic Optimization Algorithms Research Open access

140

citations
Optimization with randomized search heuristics—the (A)NFL theorem, realistic scenarios, and difficult functions
2002 Theoretical Computer Science article Computer Science Metaheuristic Optimization Algorithms Research Open access

134

citations
Theory of evolutionary computation : recent developments in discrete optimization
2020 article Computer Science Metaheuristic Optimization Algorithms Research

125

citations
The choice of the offspring population size in the ( 1,λ ) evolutionary algorithm
2013 Theoretical Computer Science article Computer Science Metaheuristic Optimization Algorithms Research Open access

118

citations
When the Plus Strategy Outperforms the Comma Strategyand When Not
2007 IEEE Symposium on Foundations of Computational Intelligence (FOCI) conference-paper Computer Science Metaheuristic Optimization Algorithms Research

97

citations
How Mutation and Selection Solve Long-Path Problems in Polynomial Expected Time
1996 Evolutionary Computation article Computer Science Metaheuristic Optimization Algorithms Research

96

citations
Analysis of different MMAS ACO algorithms on unimodal functions and plateaus
2008 Swarm Intelligence article Computer Science Metaheuristic Optimization Algorithms Research Open access

91

citations
Random combinatorial structures and randomized search heuristics
2010 Max Planck Institute for Plasma Physics dissertation Computer Science Metaheuristic Optimization Algorithms Research Open access

89

citations