Results 11 to 20 of about 2,708 (158)
On the size of weights in randomized search heuristics [PDF]
Proceedings of the tenth ACM SIGEVO workshop on Foundations of genetic algorithms, 2008 Runtime analyses of randomized search heuristics for combinatorial optimization problems often depend on the size of the largest weight. We consider replacing the given set of weights with smaller weights such that the behavior of the randomized search ...
Skutella, Martin, Reichel, Joachim
core +4 more sources
Parameterized Complexity Analysis of Randomized Search Heuristics [PDF]
, 2019 This chapter compiles a number of results that apply the theory of parameterized algorithmics to the running-time analysis of randomized search heuristics such as evolutionary algorithms.
Andrew M. Sutton +3 more
core +4 more sources
On the Optimization of Monotone Polynomials by Simple Randomized Search Heuristics [PDF]
Combinatorics, Probability and Computing, 2003 Randomized search heuristics like evolutionary algorithms and simulated annealing find many applications, especially in situations where no full information on the problem instance is available.
Ingo Wegener +3 more
core +4 more sources
Random combinatorial structures and randomized search heuristics [PDF]
, 2010 This thesis is concerned with the probabilistic analysis of random combinatorial structures and the runtime analysis of randomized search heuristics. On the subject of random structures, we investigate two classes of combinatorial objects.
Johannsen, Daniel, Johannsen, D.
core +4 more sources
Theory of Randomized Search Heuristics in Combinatorial Optimization [PDF]
Proceedings of the 13th annual conference companion on Genetic and evolutionary computation, 2011 The rigorous mathematical analysis of randomized search heuristics(RSHs) with respect to their expected runtime is a growing research area where many results have been obtained in recent years. This class of heuristics includes well-known approaches such
Witt, Carsten, Carsten Witt
core +3 more sources
Combinatorial optimization and the analysis of randomized search heuristics [PDF]
, 2007 Randomized search heuristics have widely been applied to complex engineering problems as well as to problems from combinatorial optimization. We investigate the runtime behavior of randomized search heuristics and present runtime bounds for these ...
Neumann, Frank
core +3 more sources
Runtime analysis of randomized search heuristics for dynamic graph coloring [PDF]
Proceedings of the Genetic and Evolutionary Computation Conference, 2019 We contribute to the theoretical understanding of randomized search heuristics for dynamic problems. We consider the classical graph coloring problem and investigate the dynamic setting where edges are added to the current graph.
Jakob Bossek +7 more
core +4 more sources
Expected Fitness Gains of Randomized Search Heuristics for the Traveling Salesperson Problem. [PDF]
Evolutionary Computation, 2016 Randomized search heuristics are frequently applied to NP-hard combinatorial optimization problems. The runtime analysis of randomized search heuristics has contributed tremendously to their theoretical understanding.
Nallaperuma, S. +2 more
core +6 more sources
how randomized search heuristics find maximum cliques in planar graphs [PDF]
Proceedings of the 8th annual conference on Genetic and evolutionary computation, 2006 Surprisingly, general search heuristics often solve combinatorial problems quite sufficiently, although they do not outperform specialized algorithms. Here, the behavior of simple randomized optimizers on the maximum clique problem on planar graphs is ...
Tobias Storch, Storch, Tobias
core +3 more sources
An Extended Jump Functions Benchmark for the Analysis of Randomized Search Heuristics
Algorithmica, 2022 Jump functions are the {most-studied} non-unimodal benchmark in the theory of randomized search heuristics, in particular, evolutionary algorithms (EAs). They have significantly improved our understanding of how EAs escape from local optima.
Bultel, Antoine +2 more
core +6 more sources