Proceedings of the fourth international conference on Genetic algorithms
Proceedings of the fourth international conference on Genetic algorithms
Adaptation in natural and artificial systems
Adaptation in natural and artificial systems
Evolutionary computation: toward a new philosophy of machine intelligence
Evolutionary computation: toward a new philosophy of machine intelligence
Randomized algorithms
A computational view of population genetics
Random Structures & Algorithms
The theory of evolution strategies
The theory of evolution strategies
Modelling genetic algorithm dynamics
Theoretical aspects of evolutionary computing
Statistical mechanics theory of genetic algorithms
Theoretical aspects of evolutionary computing
Evolutionary Computation: The Fossil Record
Evolutionary Computation: The Fossil Record
The Simple Genetic Algorithm: Foundations and Theory
The Simple Genetic Algorithm: Foundations and Theory
Genetic Algorithms in Search, Optimization and Machine Learning
Genetic Algorithms in Search, Optimization and Machine Learning
Numerical Optimization of Computer Models
Numerical Optimization of Computer Models
Handbook of Neural Computation
Handbook of Neural Computation
Evolutionary Algorithms: The Role of Mutation and Recombination
Evolutionary Algorithms: The Role of Mutation and Recombination
On the analysis of the (1+ 1) evolutionary algorithm
Theoretical Computer Science
Evolution strategies –A comprehensive introduction
Natural Computing: an international journal
Optimal Mutation Rates in Genetic Search
Proceedings of the 5th International Conference on Genetic Algorithms
On the Optimization of Unimodal Functions with the (1 + 1) Evolutionary Algorithm
PPSN V Proceedings of the 5th International Conference on Parallel Problem Solving from Nature
Global Convergence of Genetic Algorithms: A Markov Chain Analysis
PPSN I Proceedings of the 1st Workshop on Parallel Problem Solving from Nature
PPSN III Proceedings of the International Conference on Evolutionary Computation. The Third Conference on Parallel Problem Solving from Nature: Parallel Problem Solving from Nature
PPSN III Proceedings of the International Conference on Evolutionary Computation. The Third Conference on Parallel Problem Solving from Nature: Parallel Problem Solving from Nature
Are Long Path Problems Hard for Genetic Algorithms?
PPSN IV Proceedings of the 4th International Conference on Parallel Problem Solving from Nature
On the Analysis of Evolutionary Algorithms - A Proof That Crossover Really Can Help
ESA '99 Proceedings of the 7th Annual European Symposium on Algorithms
The Advantages of Evolutionary Computation
Biocomputing and emergent computation: Proceedings of BCEC97
A Statistical Mechanical Formulation of the Dynamics of Genetic Algorithms
Selected Papers from AISB Workshop on Evolutionary Computing
Direct search for optimal parameters within simulation models
ANSS '79 Proceedings of the 12th annual symposium on Simulation
Completely Derandomized Self-Adaptation in Evolution Strategies
Evolutionary Computation
Analysis of the (μ/μ, λ) - ES on the Parabolic Ridge
Evolutionary Computation
Toward a theory of evolution strategies: The (μ, λ)-theory
Evolutionary Computation
Toward a theory of evolution strategies: Self-adaptation
Evolutionary Computation
Rigorous hitting times for binary mutations
Evolutionary Computation
On the performance of (1, λ)-evolution strategies for theridge function class
IEEE Transactions on Evolutionary Computation
On self-adaptive features in real-parameter evolutionary algorithms
IEEE Transactions on Evolutionary Computation
Running time analysis of evolutionary algorithmson a simplified multiobjective knapsack problem
Natural Computing: an international journal
A study of drift analysis for estimating computation time of evolutionary algorithms
Natural Computing: an international journal
Journal of Computer Science and Technology
Not all linear functions are equally difficult for the compact genetic algorithm
GECCO '05 Proceedings of the 7th annual conference on Genetic and evolutionary computation
GECCO '05 Proceedings of the 7th annual conference on Genetic and evolutionary computation
Analysis of a multiobjective evolutionary algorithm on the 0-1 knapsack problem
Theoretical Computer Science
Optimum tracking with evolution strategies
Evolutionary Computation
Randomized local search, evolutionary algorithms, and the minimum spanning tree problem
Theoretical Computer Science
Analysis of evolutionary algorithms for the longest common subsequence problem
Proceedings of the 9th annual conference on Genetic and evolutionary computation
Convergence analysis of a self-adaptive multi-objective evolutionary algorithm based on grids
Information Processing Letters
Simulated annealing, its parameter settings and the longest common subsequence problem
Proceedings of the 10th annual conference on Genetic and evolutionary computation
Comparing evolutionary algorithms to the (1+1) -EA
Theoretical Computer Science
Population size versus runtime of a simple evolutionary algorithm
Theoretical Computer Science
Genetic algorithms for agent-based infrastructure interdependency modeling and analysis
SpringSim '07 Proceedings of the 2007 spring simulation multiconference - Volume 2
A new approach to estimating the expected first hitting time of evolutionary algorithms
Artificial Intelligence
Convergence Analysis of Evolution Strategies with Random Numbers of Offspring
Proceedings of the 10th international conference on Parallel Problem Solving from Nature: PPSN X
Evolutionary Computation
A new approach to estimating the expected first hitting time of evolutionary algorithms
AAAI'06 Proceedings of the 21st national conference on Artificial intelligence - Volume 1
IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics
Runtime analysis of an ant colony optimization algorithm for TSP instances
IEEE Transactions on Evolutionary Computation
Theory of coevolutionary genetic algorithms
ISPA'03 Proceedings of the 2003 international conference on Parallel and distributed processing and applications
On the running time analysis of the (1+1) evolutionary algorithm for the subset sum problem
LSMS'07 Proceedings of the Life system modeling and simulation 2007 international conference on Bio-Inspired computational intelligence and applications
Can quantum search accelerate evolutionary algorithms?
Proceedings of the 12th annual conference on Genetic and evolutionary computation
Towards analyzing recombination operators in evolutionary search
PPSN'10 Proceedings of the 11th international conference on Parallel problem solving from nature: Part I
A new method for modeling the behavior of finite population evolutionary algorithms
Evolutionary Computation
Information Sciences: an International Journal
Evolutionary algorithms and dynamic programming
Theoretical Computer Science
Evolutionary sets of safe ship trajectories: problem-dedicated operators
ICCCI'11 Proceedings of the Third international conference on Computational collective intelligence: technologies and applications - Volume Part II
ICCCI'11 Proceedings of the Third international conference on Computational collective intelligence: technologies and applications - Volume Part II
The convergence of a multi-objective evolutionary algorithm based on grids
ICNC'05 Proceedings of the First international conference on Advances in Natural Computation - Volume Part II
Running time analysis of a multiobjective evolutionary algorithm on simple and hard problems
FOGA'05 Proceedings of the 8th international conference on Foundations of Genetic Algorithms
The use of tail inequalities on the probable computational time of randomized search heuristics
Theoretical Computer Science
A framework for evolutionary algorithms based on Charles Sanders Peirce's evolutionary semiotics
Information Sciences: an International Journal
Mixed integer evolution strategies for parameter optimization
Evolutionary Computation
An evolutionary algorithm derived from Charles Sanders Peirce's theory of universal evolution
Proceedings of the 15th annual conference companion on Genetic and evolutionary computation
Information Sciences: an International Journal
| Hi-index | 0.01 |
Many variants of evolutionary algorithms have been designed and applied. The experimental knowledge is immense. The rigorous analysis of evolutionary algorithms is difficult, but such a theory can help to understand, design, and teach evolutionary algorithms. In this survey, first the history of attempts to analyse evolutionary algorithms is described and then new methods for continuous as well as discrete search spaces are presented and discussed.