The time complexity of maximum matching by simulated annealing
Journal of the ACM (JACM)
Finite Markov chain results in evolutionary computation: a tour d'horizon
Fundamenta Informaticae
Theory of evolutionary algorithms: a bird's eye view
Theoretical Computer Science - Special issue on evolutionary computation
The theory of evolution strategies
The theory of evolution strategies
On the analysis of the (1+ 1) evolutionary algorithm
Theoretical Computer Science
How to analyse evolutionary algorithms
Theoretical Computer Science - Natural computing
Towards an analytic framework for analysing the computation time of evolutionary algorithms
Artificial Intelligence
IEEE Transactions on Evolutionary Computation
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
Some theoretical results about the computation time of evolutionary algorithms
GECCO '05 Proceedings of the 7th annual conference on Genetic and evolutionary computation
Theoretical Computer Science
Editorial: Special Issue on "Nature Inspired Problem-Solving"
Information Sciences: an International Journal
Comparing global and local mutations on bit strings
Proceedings of the 10th annual conference on Genetic and evolutionary computation
A new approach to estimating the expected first hitting time of evolutionary algorithms
Artificial Intelligence
About the Time Complexity of Evolutionary Algorithms Based on Finite Search Space
Computational Intelligence and Security
Self-stabilizing Cuts in Synchronous Networks
SIROCCO '08 Proceedings of the 15th international colloquium on Structural Information and Communication Complexity
Simplified Drift Analysis for Proving Lower Bounds in Evolutionary Computation
Proceedings of the 10th international conference on Parallel Problem Solving from Nature: PPSN X
Crossover Can Be Constructive When Computing Unique Input Output Sequences
SEAL '08 Proceedings of the 7th International Conference on Simulated Evolution and Learning
About the Computation Time of Adaptive Evolutionary Algorithms
ISICA '08 Proceedings of the 3rd International Symposium on Advances in Computation and Intelligence
On the impact of the mutation-selection balance on the runtime of evolutionary algorithms
Proceedings of the tenth ACM SIGEVO workshop on Foundations of genetic algorithms
On average time complexity of evolutionary negative selection algorithms for anomaly detection
Proceedings of the first ACM/SIGEVO Summit on Genetic and Evolutionary Computation
Dynamic evolutionary optimisation: an analysis of frequency and magnitude of change
Proceedings of the 11th Annual conference on Genetic and 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
ICARIS '09 Proceedings of the 8th International Conference on Artificial Immune Systems
A pheromone-rate-based analysis on the convergence time of ACO algorithm
IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics - Special issue on cybernetics and cognitive informatics
IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics
Analysis of diversity-preserving mechanisms for global exploration*
Evolutionary Computation
When is an estimation of distribution algorithm better than an evolutionary algorithm?
CEC'09 Proceedings of the Eleventh conference on Congress on Evolutionary Computation
Evolutionary automata as foundation of evolutionary computation: Larry Fogel was right
CEC'09 Proceedings of the Eleventh conference on Congress on Evolutionary Computation
Analysis of the (1 + 1)-EA for finding approximate solutions to vertex cover problems
IEEE Transactions on Evolutionary Computation
Analysis of an asymmetric mutation operator
Evolutionary Computation
A self-stabilizing algorithm for cut problems in synchronous networks
Theoretical Computer Science
On the brittleness of evolutionary algorithms
FOGA'07 Proceedings of the 9th international conference on Foundations of genetic algorithms
Theoretical analysis of local search in software testing
SAGA'09 Proceedings of the 5th international conference on Stochastic algorithms: foundations and applications
Analysis of computational time of simple estimation of distribution algorithms
IEEE Transactions on Evolutionary Computation
A few ants are enough: ACO with iteration-best update
Proceedings of the 12th annual conference on Genetic and evolutionary computation
Black-box search by unbiased variation
Proceedings of the 12th annual conference on Genetic and evolutionary computation
Proceedings of the 12th annual conference on Genetic and evolutionary computation
PPSN'10 Proceedings of the 11th international conference on Parallel problem solving from nature: Part I
General lower bounds for the running time of evolutionary algorithms
PPSN'10 Proceedings of the 11th international conference on Parallel problem solving from nature: Part I
Drift analysis with tail bounds
PPSN'10 Proceedings of the 11th international conference on Parallel problem solving from nature: Part I
General scheme for analyzing running times of parallel evolutionary algorithms
PPSN'10 Proceedings of the 11th international conference on Parallel problem solving from nature: Part I
PPSN'10 Proceedings of the 11th international conference on Parallel problem solving from nature: Part I
Analyzing different variants of immune inspired somatic contiguous hypermutations
Theoretical Computer Science
Runtime analysis of the (1+1) evolutionary algorithm on strings over finite alphabets
Proceedings of the 11th workshop proceedings on Foundations of genetic algorithms
Simple max-min ant systems and the optimization of linear pseudo-boolean functions
Proceedings of the 11th workshop proceedings on Foundations of genetic algorithms
Information Sciences: an International Journal
How crossover helps in pseudo-boolean optimization
Proceedings of the 13th annual conference on Genetic and evolutionary computation
Proceedings of the 13th annual conference companion on Genetic and evolutionary computation
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
A time complexity analysis of ACO for linear functions
SEAL'06 Proceedings of the 6th international conference on Simulated Evolution And Learning
A large population size can be unhelpful in evolutionary algorithms
Theoretical Computer Science
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
Ants easily solve stochastic shortest path problems
Proceedings of the 14th annual conference on Genetic and evolutionary computation
Proceedings of the 14th annual conference on Genetic and evolutionary computation
The choice of the offspring population size in the (1,λ) EA
Proceedings of the 14th annual conference on Genetic and evolutionary computation
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
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
Black-box complexities of combinatorial problems
Theoretical Computer Science
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
Can quantitative and population genetics help us understand evolutionary computation?
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
Runtime analysis of evolutionary algorithms: basic introduction
Proceedings of the 15th annual conference companion on Genetic and evolutionary computation
Runtime analysis of the (1+1) EA on computing unique input output sequences
Information Sciences: an International Journal
| Hi-index | 0.01 |
This paper introduces drift analysis and its applications in estimating average computation time of evolutionary algorithms. Firstly, drift conditions for estimating upper and lower bounds of the mean first hitting times of evolutionary algorithms are presented. Then drift analysis is applied to two specific evolutionary algorithms and problems. Finally, a general classification of easy and hard problems for evolutionary algorithmsis given based on the analysis.