Analyzing randomized search heuristics via stochastic domination

Theoretical Computer Science ◽

10.1016/j.tcs.2018.09.024 ◽

2019 ◽

Vol 773 ◽

pp. 115-137 ◽

Author(s):

Benjamin Doerr

Keyword(s):

Stochastic Domination ◽

Randomized Search Heuristics ◽

Search Heuristics ◽

Randomized Search

Download Full-text

Exponential upper bounds for the runtime of randomized search heuristics

Theoretical Computer Science ◽

10.1016/j.tcs.2020.09.032 ◽

2021 ◽

Vol 851 ◽

pp. 24-38

Author(s):

Benjamin Doerr

Keyword(s):

Upper Bounds ◽

Randomized Search Heuristics ◽

Search Heuristics ◽

Randomized Search

Download Full-text

On benefits and drawbacks of aging strategies for randomized search heuristics

Theoretical Computer Science ◽

10.1016/j.tcs.2010.03.032 ◽

2011 ◽

Vol 412 (6) ◽

pp. 543-559 ◽

Author(s):

Thomas Jansen ◽

Christine Zarges

Keyword(s):

Randomized Search Heuristics ◽

Search Heuristics ◽

Randomized Search

Download Full-text

Towards a Complexity Theory of Randomized Search Heuristics: Ranking-Based Black-Box Complexity

Computer Science – Theory and Applications - Lecture Notes in Computer Science ◽

10.1007/978-3-642-20712-9_2 ◽

2011 ◽

pp. 15-28 ◽

Author(s):

Benjamin Doerr ◽

Carola Winzen

Keyword(s):

Complexity Theory ◽

Black Box ◽

Randomized Search Heuristics ◽

Search Heuristics ◽

Randomized Search

Download Full-text

A fixed budget analysis of randomized search heuristics for the traveling salesperson problem

Proceedings of the 2014 conference on Genetic and evolutionary computation - GECCO '14 ◽

10.1145/2576768.2598302 ◽

2014 ◽

Author(s):

Samadhi Nallaperuma ◽

Frank Neumann ◽

Dirk Sudholt

Keyword(s):

Traveling Salesperson Problem ◽

Randomized Search Heuristics ◽

Budget Analysis ◽

Fixed Budget ◽

Search Heuristics ◽

Randomized Search

Download Full-text

Anne Auger and Benjamin Doerr (eds): Theory of randomized search heuristics: foundations and recent developments

Genetic Programming and Evolvable Machines ◽

10.1007/s10710-013-9208-7 ◽

2013 ◽

Vol 15 (1) ◽

pp. 111-112 ◽

Author(s):

Elena Popovici

Keyword(s):

Randomized Search Heuristics ◽

Search Heuristics ◽

Recent Developments ◽

Randomized Search

Download Full-text

The Impact of Random Initialization on the Runtime of Randomized Search Heuristics

Algorithmica ◽

10.1007/s00453-015-0019-5 ◽

2015 ◽

Vol 75 (3) ◽

pp. 529-553 ◽

Author(s):

Benjamin Doerr ◽

Carola Doerr

Keyword(s):

Randomized Search Heuristics ◽

Search Heuristics ◽

Random Initialization ◽

Randomized Search ◽

Download Full-text

How randomized search heuristics find maximum cliques in planar graphs

Proceedings of the 8th annual conference on Genetic and evolutionary computation - GECCO '06 ◽

10.1145/1143997.1144099 ◽

2006 ◽

Author(s):

Tobias Storch

Keyword(s):

Planar Graphs ◽

Randomized Search Heuristics ◽

Maximum Cliques ◽

Search Heuristics ◽

Randomized Search

Download Full-text

On the size of weights in randomized search heuristics

Proceedings of the tenth ACM SIGEVO workshop on Foundations of genetic algorithms - FOGA '09 ◽

10.1145/1527125.1527130 ◽

2009 ◽

Author(s):

Joachim Reichel ◽

Martin Skutella

Keyword(s):

Randomized Search Heuristics ◽

Search Heuristics ◽

Randomized Search

Download Full-text

Concentrated Hitting Times of Randomized Search Heuristics with Variable Drift

Algorithms and Computation - Lecture Notes in Computer Science ◽

10.1007/978-3-319-13075-0_54 ◽

2014 ◽

pp. 686-697 ◽

Author(s):

Per Kristian Lehre ◽

Carsten Witt

Keyword(s):

Hitting Times ◽

Randomized Search Heuristics ◽

Search Heuristics ◽

Randomized Search

Download Full-text

Approximating covering problems by randomized search heuristics using multi-objective models

Proceedings of the 9th annual conference on Genetic and evolutionary computation - GECCO '07 ◽

10.1145/1276958.1277118 ◽

2007 ◽

Author(s):

Tobias Friedrich ◽

Nils Hebbinghaus ◽

Frank Neumann ◽

Jun He ◽

Carsten Witt

Keyword(s):

Covering Problems ◽

Randomized Search Heuristics ◽

Multi Objective ◽

Search Heuristics ◽

Randomized Search

Download Full-text