Analysis of evolutionary algorithms: from computational complexity analysis to algorithm engineering
Proceedings of the 11th workshop proceedings on Foundations of genetic algorithms
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
Black-box complexities of combinatorial problems
Proceedings of the 13th annual conference on Genetic and evolutionary computation
How crossover helps in pseudo-boolean optimization
Proceedings of the 13th annual conference on Genetic and evolutionary computation
On the effectiveness of crossover for migration in parallel evolutionary algorithms
Proceedings of the 13th annual conference on Genetic and evolutionary computation
PAC learning and genetic programming
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
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
Analysis of speedups in parallel evolutionary algorithms for combinatorial optimization
ISAAC'11 Proceedings of the 22nd international conference on Algorithms and Computation
The use of tail inequalities on the probable computational time of randomized search heuristics
Theoretical Computer Science
On the efficiency of an order-based representation in the clique covering problem
Proceedings of the 14th annual conference on Genetic and evolutionary computation
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
Evolutionary algorithms for the project scheduling problem: runtime analysis and improved design
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
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 complexities of combinatorial problems
Theoretical Computer Science
Approximating vertex cover using edge-based representations
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 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
Population size matters: rigorous runtime results for maximizing the hypervolume indicator
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
Improved runtime analysis of the simple genetic algorithm
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
How the (1+λ) evolutionary algorithm optimizes linear functions
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
Artificial immune systems for optimisation
Proceedings of the 15th annual conference companion on Genetic and evolutionary computation
An analysis on recombination in multi-objective evolutionary optimization
Artificial Intelligence
IJCAI'13 Proceedings of the Twenty-Third international joint conference on Artificial Intelligence
Fitness levels with tail bounds for the analysis of randomized search heuristics
Information Processing Letters
Annals of Mathematics and Artificial Intelligence
Hi-index | 0.00 |
Bioinspired computation methods such as evolutionary algorithms and ant colony optimization are being applied successfully to complex engineering problems and to problems from combinatorial optimization, and with this comes the requirement to more fully understand the computational complexity of these search heuristics. This is the first textbook covering the most important results achieved in this area. The authors study the computational complexity of bioinspired computation and show how runtime behavior can be analyzed in a rigorous way using some of the best-known combinatorial optimization problems -- minimum spanning trees, shortest paths, maximum matching, covering and scheduling problems. A feature of the book is the separate treatment of single- and multiobjective problems, the latter a domain where the development of the underlying theory seems to be lagging practical successes.This book will be very valuable for teaching courses on bioinspired computation and combinatorial optimization. Researchers will also benefit as the presentation of the theory covers the most important developments in the field over the last 10 years. Finally, with a focus on well-studied combinatorial optimization problems rather than toy problems, the book will also be very valuable for practitioners in this field.