Combinatorial optimization: algorithms and complexity
Combinatorial optimization: algorithms and complexity
Evolutionary computation: toward a new philosophy of machine intelligence
Evolutionary computation: toward a new philosophy of machine intelligence
Genetic algorithms + data structures = evolution programs (3rd ed.)
Genetic algorithms + data structures = evolution programs (3rd ed.)
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
On the convergence rates of genetic algorithms
Theoretical Computer Science - Special issue on evolutionary computation
Drift analysis and average time complexity of evolutionary algorithms
Artificial Intelligence
The Simple Genetic Algorithm: Foundations and Theory
The Simple Genetic Algorithm: Foundations and Theory
Evolution and Optimum Seeking: The Sixth Generation
Evolution and Optimum Seeking: The Sixth Generation
Genetic Algorithms in Search, Optimization and Machine Learning
Genetic Algorithms in Search, Optimization and Machine Learning
Handbook of Evolutionary Computation
Handbook of Evolutionary 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
A new evolutionary approach to cutting stock problems with and without contiguity
Computers and Operations Research
On the Analysis of Evolutionary Algorithms - A Proof That Crossover Really Can Help
ESA '99 Proceedings of the 7th Annual European Symposium on Algorithms
How mutation and selection solve long-path problems in polynomial expected time
Evolutionary Computation
Rigorous hitting times for binary mutations
Evolutionary Computation
An evolutionary approach to materialized views selection in a datawarehouse environment
IEEE Transactions on Systems, Man, and Cybernetics, Part C: Applications and Reviews
Statistical distribution of the convergence time of evolutionaryalgorithms for long-path problems
IEEE Transactions on Evolutionary Computation
Markov chain models of parallel genetic algorithms
IEEE Transactions on Evolutionary Computation
IEEE Transactions on Evolutionary Computation
A study of drift analysis for estimating computation time of evolutionary algorithms
Natural Computing: an international journal
Journal of Computer Science and Technology
Some theoretical results about the computation time of evolutionary algorithms
GECCO '05 Proceedings of the 7th annual conference on Genetic and evolutionary computation
Backward-chaining evolutionary algorithms
Artificial Intelligence
Editorial: Special Issue on "Nature Inspired Problem-Solving"
Information Sciences: an International Journal
Rigorous analyses of fitness-proportional selection for optimizing linear functions
Proceedings of the 10th annual conference on Genetic and evolutionary computation
Population size versus runtime of a simple evolutionary algorithm
Theoretical Computer Science
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
A comparative runtime analysis of heuristic algorithms for satisfiability problems
Artificial Intelligence
About the Computation Time of Adaptive Evolutionary Algorithms
ISICA '08 Proceedings of the 3rd International Symposium on Advances in Computation and Intelligence
Real options approach to evaluating genetic algorithms
Applied Soft Computing
Convergence analysis of UMDAC with finite populations: a case study on flat landscapes
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
Backward-chaining evolutionary algorithms
Artificial Intelligence
Preserving and exploiting genetic diversity in evolutionary programming algorithms
IEEE Transactions on Evolutionary Computation
Exploring multiple viewshed analysis using terrain features and optimisation techniques
Computers & Geosciences
IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics
Rigorous time complexity analysis of univariate marginal distribution algorithm with margins
CEC'09 Proceedings of the Eleventh conference on Congress on Evolutionary Computation
A robust iterative hypothesis testing design of the repeated genetic algorithm
Image and Vision Computing
Analysis of the (1 + 1)-EA for finding approximate solutions to vertex cover problems
IEEE Transactions on Evolutionary Computation
Adequacy of empirical performance assessment for multiobjective evolutionary optimizer
EMO'07 Proceedings of the 4th international conference on Evolutionary multi-criterion optimization
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
Analysis of computational time of simple estimation of distribution algorithms
IEEE Transactions on Evolutionary Computation
Proceedings of the 12th annual conference on Genetic and evolutionary computation
Theoretical results in genetic programming: the next ten years?
Genetic Programming and Evolvable Machines
Practical performance models of algorithms in evolutionary program induction and other domains
Artificial Intelligence
Towards analyzing recombination operators in evolutionary search
PPSN'10 Proceedings of the 11th international conference on Parallel problem solving from nature: Part I
Free lunches on the discrete Lipschitz class
Theoretical Computer Science
The role of selective pressure when solving symmetric functions in polynomial time
Proceedings of the 11th workshop proceedings on Foundations of genetic algorithms
Analysis of (1+1) evolutionary algorithm and randomized local search with memory
Evolutionary Computation
Fitness-probability cloud and a measure of problem hardness for evolutionary algorithms
EvoCOP'11 Proceedings of the 11th European conference on Evolutionary computation in combinatorial optimization
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
A time complexity analysis of ACO for linear functions
SEAL'06 Proceedings of the 6th international conference on Simulated Evolution And Learning
Convergence analysis and improvements of quantum-behaved particle swarm optimization
Information Sciences: an International Journal
ICONIP'11 Proceedings of the 18th international conference on Neural Information Processing - Volume Part II
The use of tail inequalities on the probable computational time of randomized search heuristics
Theoretical Computer Science
Pure strategy or mixed strategy?
EvoCOP'12 Proceedings of the 12th European conference on Evolutionary Computation in Combinatorial Optimization
| Hi-index | 0.00 |
In spite of many applications of evolutionary algorithms in optimisation, theoretical results on the computation time and time complexity of evolutionary algorithms on different optimisation problems are relatively few. It is still unclear when an evolutionary algorithm is expected to solve an optimisation problem efficiently or otherwise. This paper gives a general analytic framework for analysing first hitting times of evolutionary algorithms. The framework is built on the absorbing Markov chain model of evolutionary algorithms. The first step towards a systematic comparative study among different EAs and their first hitting times has been made in the paper.