Analysis of evolutionary algorithms: from computational complexity analysis to algorithm engineering
Proceedings of the 11th workshop proceedings on Foundations of genetic algorithms
Runtime analysis of the (1+1) evolutionary algorithm on strings over finite alphabets
Proceedings of the 11th workshop proceedings on Foundations of genetic algorithms
Too fast unbiased black-box algorithms
Proceedings of the 13th annual conference on Genetic and evolutionary computation
Sharp bounds by probability-generating functions and variable drift
Proceedings of the 13th annual conference on Genetic and evolutionary computation
Theory of randomized search heuristics in combinatorial optimization
Proceedings of the 13th annual conference companion on Genetic and evolutionary computation
Metaheuristic optimization: algorithm analysis and open problems
SEA'11 Proceedings of the 10th international conference on Experimental algorithms
Variation in artificial immune systems: hypermutations with mutation potential
ICARIS'11 Proceedings of the 10th international conference on Artificial immune systems
Evolutionary algorithms and dynamic programming
Theoretical Computer Science
Memory-restricted black-box complexity of OneMax
Information Processing Letters
Tight analysis of the (1+1)-ea for the single source shortest path problem
Evolutionary Computation
Revisiting the restricted growth function genetic algorithm for grouping problems
Evolutionary Computation
On the approximation ability of evolutionary optimization with application to minimum set cover
Artificial Intelligence
Non-existence of linear universal drift functions
Theoretical Computer Science
The use of tail inequalities on the probable computational time of randomized search heuristics
Theoretical Computer Science
A parameterized runtime analysis of evolutionary algorithms for MAX-2-SAT
Proceedings of the 14th annual conference on Genetic and evolutionary computation
Runtime analysis of convex evolutionary search
Proceedings of the 14th annual conference on Genetic and evolutionary computation
Computational complexity analysis of multi-objective genetic programming
Proceedings of the 14th annual conference on Genetic and evolutionary computation
Proceedings of the 14th annual conference on Genetic and evolutionary computation
Fixed budget computations: a different perspective on run time analysis
Proceedings of the 14th annual conference on Genetic and evolutionary computation
The max problem revisited: the importance of mutation in genetic programming
Proceedings of the 14th annual conference on Genetic and evolutionary computation
On the analysis of the simple genetic algorithm
Proceedings of the 14th annual conference on Genetic and evolutionary computation
Bioinspired computation in combinatorial optimization: algorithms and their computational complexity
Proceedings of the 14th annual conference companion on Genetic and evolutionary computation
Unpacking and understanding evolutionary algorithms
WCCI'12 Proceedings of the 2012 World Congress conference on Advances in Computational Intelligence
Convergence of set-based multi-objective optimization, indicators and deteriorative cycles
Theoretical Computer Science
Computing longest common subsequences with the B-cell algorithm
ICARIS'12 Proceedings of the 11th international conference on Artificial Immune Systems
A parameterized runtime analysis of simple evolutionary algorithms for makespan scheduling
PPSN'12 Proceedings of the 12th international conference on Parallel Problem Solving from Nature - Volume Part I
On algorithm-dependent boundary case identification for problem classes
PPSN'12 Proceedings of the 12th international conference on Parallel Problem Solving from Nature - Volume Part I
Parsimony pressure versus multi-objective optimization for variable length representations
PPSN'12 Proceedings of the 12th international conference on Parallel Problem Solving from Nature - Volume Part I
More effective crossover operators for the all-pairs shortest path problem
Theoretical Computer Science
Black-Box complexity: breaking the O(n logn) barrier of leadingones
EA'11 Proceedings of the 10th international conference on Artificial Evolution
When do evolutionary algorithms optimize separable functions in parallel?
Proceedings of the twelfth workshop on Foundations of genetic algorithms XII
A runtime analysis of simple hyper-heuristics: to mix or not to mix operators
Proceedings of the twelfth workshop on Foundations of genetic algorithms XII
Runtime analysis of mutation-based geometric semantic genetic programming on boolean functions
Proceedings of the twelfth workshop on Foundations of genetic algorithms XII
Proceedings of the 15th annual conference on Genetic and evolutionary computation
Proceedings of the 15th annual conference on Genetic and evolutionary computation
Proceedings of the 15th annual conference on Genetic and evolutionary computation
Proceedings of the 15th annual conference on Genetic and evolutionary computation
A method to derive fixed budget results from expected optimisation times
Proceedings of the 15th annual conference on Genetic and evolutionary computation
Runtime analysis of ant colony optimization on dynamic shortest path problems
Proceedings of the 15th annual conference on Genetic and evolutionary computation
Bioinspired computation in combinatorial optimization: algorithms and their computational complexity
Proceedings of the 15th annual conference companion on Genetic and evolutionary computation
IJCAI'13 Proceedings of the Twenty-Third international joint conference on Artificial Intelligence
A modification of the DIRECT method for Lipschitz global optimization for a symmetric function
Journal of Global Optimization
Fitness levels with tail bounds for the analysis of randomized search heuristics
Information Processing Letters
Natural Computing: an international journal
Hi-index | 0.01 |
Randomized search heuristics such as evolutionary algorithms, genetic algorithms, evolution strategies, ant colony and particle swarm optimization turn out to be highly successful for optimization in practice. The theory of randomized search heuristics, which has been growing rapidly in the last five years, also attempts to explain the success of the methods in practical applications. This book covers both classical results and the most recent theoretical developments in the field of randomized search heuristics such as runtime analysis, drift analysis and convergence. Each chapter provides an overview of a particular domain and gives insights into the proofs and proof techniques of more specialized areas. Open problems still remain widely in randomized search heuristics -- being a relatively young and vast field. These problems and directions for future research are addressed and discussed in this book. The book will be an essential source of reference for experts in the domain of randomized search heuristics and also for researchers who are involved or ready to embark in this field. As an advanced textbook, graduate students will benefit from the comprehensive coverage of topics.