An Extended Jump Function Benchmark for the Analysis of Randomized Search Heuristics

[1]  Benjamin Doerr,et al.  Stagnation Detection meets Fast Mutation , 2022, EvoCOP.

[2]  Carsten Witt,et al.  Self-Adjusting Evolutionary Algorithms for Multimodal Optimization , 2020, Algorithmica.

[3]  Benjamin Doerr,et al.  Choosing the right algorithm with hints from complexity theory: (hot-off-the-press track at GECCO 2022) , 2021, IJCAI.

[4]  Benjamin Doerr,et al.  A rigorous runtime analysis of the 2-MMASib on jump functions: ant colony optimizers can cope well with local optima , 2021, GECCO.

[5]  Benjamin Doerr,et al.  Generalized jump functions , 2021, GECCO.

[6]  Lazy parameter tuning and control: choosing all parameters randomly from a power-law distribution , 2021, GECCO.

[7]  C. Witt,et al.  Stagnation detection in highly multimodal fitness landscapes , 2021, GECCO.

[8]  Benjamin Doerr,et al.  Lower bounds from fitness levels made easy , 2021, GECCO.

[9]  C. Witt,et al.  Stagnation Detection with Randomized Local Search* , 2021, Evolutionary Computation.

[10]  Benjamin Doerr,et al.  Theoretical Analyses of Multiobjective Evolutionary Algorithms on Multimodal Objectives. , 2020, Evolutionary computation.

[11]  Benjamin Doerr,et al.  The Univariate Marginal Distribution Algorithm Copes Well with Deception and Epistasis , 2020, Evolutionary Computation.

[12]  Markus Wagner,et al.  Evolutionary algorithms and submodular functions: benefits of heavy-tailed mutations , 2018, Natural Computing.

[13]  Dirk Sudholt,et al.  Memetic algorithms outperform evolutionary algorithms in multimodal optimisation , 2020, Artif. Intell..

[14]  Benjamin Doerr,et al.  First Steps Towards a Runtime Analysis When Starting With a Good Solution , 2020, PPSN.

[15]  Benjamin Doerr,et al.  Runtime Analysis of a Heavy-Tailed (1+(λ, λ)) Genetic Algorithm on Jump Functions , 2020, PPSN.

[16]  Dirk Sudholt,et al.  Runtime Analysis of Crowding Mechanisms for Multimodal Optimization , 2020, IEEE Transactions on Evolutionary Computation.

[17]  Benjamin Doerr,et al.  The (1 + (λ,λ)) GA is even faster on multimodal problems , 2020, GECCO.

[18]  Benjamin Doerr,et al.  Fixed-Target Runtime Analysis , 2020, Algorithmica.

[19]  Benjamin Doerr.  Does Comma Selection Help to Cope with Local Optima? , 2020, GECCO.

[20]  Benjamin Doerr,et al.  The Runtime of the Compact Genetic Algorithm on Jump Functions , 2019, Algorithmica.

[21]  Pietro Simone Oliveto,et al.  On the Benefits of Populations for the Exploitation Speed of Standard Steady-State Genetic Algorithms , 2019, Algorithmica.

[22]  Thomas Bäck,et al.  Theory of Evolutionary Computation: Recent Developments in Discrete Optimization , 2020, Theory of Evolutionary Computation.

[23]  Aishwaryaprajna,et al.  The benefits and limitations of voting mechanisms in evolutionary optimisation , 2019, FOGA '19.

[24]  Per Kristian Lehre,et al.  On the limitations of the univariate marginal distribution algorithm to deception and where bivariate EDAs might help , 2019, FOGA '19.

[25]  Andrei Lissovoi,et al.  On the Time Complexity of Algorithm Selection Hyper-Heuristics for Multimodal Optimisation , 2019, AAAI.

[26]  Benjamin Doerr,et al.  Analyzing randomized search heuristics via stochastic domination , 2019, Theor. Comput. Sci..

[27]  Benjamin Doerr,et al.  A tight runtime analysis for the cGA on jump functions: EDAs can cross fitness valleys at no extra cost , 2019, GECCO.

[28]  Markus Wagner,et al.  Heavy-Tailed Mutation Operators in Single-Objective Combinatorial Optimization , 2018, PPSN.

[29]  Chao Qian,et al.  Dynamic Mutation Based Pareto Optimization for Subset Selection , 2018, ICIC.

[30]  Benjamin Doerr,et al.  Solving Problems with Unknown Solution Length at Almost No Extra Cost , 2018, Algorithmica.

[31]  Markus Wagner,et al.  Escaping large deceptive basins of attraction with heavy-tailed mutation operators , 2018, GECCO.

[32]  Andrew M. Sutton,et al.  On the runtime dynamics of the compact genetic algorithm on jump functions , 2018, GECCO.

[33]  Pietro Simone Oliveto,et al.  Fast Artificial Immune Systems , 2018, PPSN.

[34]  Per Kristian Lehre,et al.  Escaping Local Optima Using Crossover With Emergent Diversity , 2018, IEEE Transactions on Evolutionary Computation.

[35]  Per Kristian Lehre,et al.  Theoretical Analysis of Stochastic Search Algorithms , 2017, Handbook of Heuristics.

[36]  Dogan Corus,et al.  Standard Steady State Genetic Algorithms Can Hillclimb Faster Than Mutation-Only Evolutionary Algorithms , 2017, IEEE Transactions on Evolutionary Computation.

[37]  Benjamin Doerr,et al.  Static and Self-Adjusting Mutation Strengths for Multi-valued Decision Variables , 2018, Algorithmica.

[38]  Pietro Simone Oliveto,et al.  How to Escape Local Optima in Black Box Optimisation: When Non-elitism Outperforms Elitism , 2017, Algorithmica.

[39]  Maxim Buzdalov,et al.  Evaluation of heavy-tailed mutation operator on maximum flow test generation problem , 2017, GECCO.

[40]  Pietro Simone Oliveto,et al.  On the runtime analysis of the opt-IA artificial immune system , 2017, GECCO.

[41]  Benjamin Doerr,et al.  Fast genetic algorithms , 2017, GECCO.

[42]  Dirk Sudholt,et al.  How Crossover Speeds up Building Block Assembly in Genetic Algorithms , 2014, Evolutionary Computation.

[43]  Carsten Witt,et al.  The Interplay of Population Size and Mutation Probability in the (1+λ) EA on OneMax , 2017, Algorithmica.

[44]  Carsten Witt,et al.  The Interplay of Population Size and Mutation Probability in the ($$1+\lambda $$1+λ) EA on OneMax , 2016, Algorithmica.

[45]  Frank Neumann,et al.  Fast Building Block Assembly by Majority Vote Crossover , 2016, GECCO.

[46]  Duc-Cuong Dang,et al.  Escaping Local Optima with Diversity Mechanisms and Crossover , 2016, GECCO.

[47]  Dirk Sudholt,et al.  Towards a Runtime Comparison of Natural and Artificial Evolution , 2015, Algorithmica.

[48]  Benjamin Doerr,et al.  From black-box complexity to designing new genetic algorithms , 2015, Theor. Comput. Sci..

[49]  Thomas Jansen,et al.  On the Black-Box Complexity of Example Functions: The Real Jump Function , 2015, FOGA.

[50]  Thomas Jansen,et al.  Analyzing Evolutionary Algorithms , 2015, Natural Computing Series.

[51]  Carsten Witt,et al.  Tight Bounds on the Optimization Time of a Randomized Search Heuristic on Linear Functions† , 2013, Combinatorics, Probability and Computing.

[52]  Dirk Sudholt,et al.  A New Method for Lower Bounds on the Running Time of Evolutionary Algorithms , 2011, IEEE Transactions on Evolutionary Computation.

[53]  Frank Neumann,et al.  Bioinspired computation in combinatorial optimization: algorithms and their computational complexity , 2010, GECCO '12.

[54]  Thomas Jansen,et al.  Analyzing Evolutionary Algorithms: The Computer Science Perspective , 2012 .

[55]  Frank Neumann,et al.  Bioinspired computation in combinatorial optimization: algorithms and their computational complexity , 2012, GECCO '12.

[56]  Per Kristian Lehre,et al.  Crossover can be constructive when computing unique input–output sequences , 2011, Soft Comput..

[57]  Anne Auger,et al.  Theory of Randomized Search Heuristics: Foundations and Recent Developments , 2011, Theory of Randomized Search Heuristics.

[58]  Per Kristian Lehre,et al.  Faster black-box algorithms through higher arity operators , 2010, FOGA '11.

[59]  Benjamin Doerr,et al.  Optimal Fixed and Adaptive Mutation Rates for the LeadingOnes Problem , 2010, PPSN.

[60]  Per Kristian Lehre,et al.  Negative Drift in Populations , 2010, PPSN.

[61]  Frank Neumann,et al.  More Effective Crossover Operators for the All-Pairs Shortest Path Problem , 2010, PPSN.

[62]  Carsten Witt,et al.  Bioinspired Computation in Combinatorial Optimization , 2010, Bioinspired Computation in Combinatorial Optimization.

[63]  Pietro Simone Oliveto,et al.  Analysis of Diversity-Preserving Mechanisms for Global Exploration , 2009, Evolutionary Computation.

[64]  Benjamin Doerr,et al.  Crossover can provably be useful in evolutionary computation , 2008, GECCO '08.

[65]  Jens Jägersküpper,et al.  When the Plus Strategy Outperforms the Comma Strategyand When Not , 2007, 2007 IEEE Symposium on Foundations of Computational Intelligence.

[66]  Dirk Sudholt,et al.  Crossover is provably essential for the Ising model on trees , 2005, GECCO '05.

[67]  Ingo Wegener,et al.  The Ising Model on the Ring: Mutation Versus Recombination , 2004, GECCO.

[68]  Adam Prügel-Bennett,et al.  When a genetic algorithm outperforms hill-climbing , 2004, Theor. Comput. Sci..

[69]  Thomas Jansen,et al.  The Analysis of Evolutionary Algorithms—A Proof That Crossover Really Can Help , 2002, Algorithmica.

[70]  Thomas Jansen,et al.  On the analysis of the (1+1) evolutionary algorithm , 2002, Theor. Comput. Sci..

[71]  Ingo Wegener,et al.  Theoretical Aspects of Evolutionary Algorithms , 2001, ICALP.

[72]  Marc Schoenauer,et al.  Rigorous Hitting Times for Binary Mutations , 1999, Evolutionary Computation.