An evolutionary approach to combinatorial optimization problems
CSC '94 Proceedings of the 22nd annual ACM computer science conference on Scaling up : meeting the challenge of complexity in real-world computing applications: meeting the challenge of complexity in real-world computing applications
Randomized algorithms
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
Drift analysis and average time complexity of evolutionary algorithms
Artificial Intelligence
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
How to analyse evolutionary algorithms
Theoretical Computer Science - Natural computing
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
PPSN III Proceedings of the International Conference on Evolutionary Computation. The Third Conference on Parallel Problem Solving from Nature: Parallel Problem Solving from Nature
Towards an analytic framework for analysing the computation time of evolutionary algorithms
Artificial Intelligence
A study of drift analysis for estimating computation time of evolutionary algorithms
Natural Computing: an international journal
On the Choice of the Offspring Population Size in Evolutionary Algorithms
Evolutionary Computation
Predictive models for the breeder genetic algorithm i. continuous parameter optimization
Evolutionary Computation
How mutation and selection solve long-path problems in polynomial expected time
Evolutionary Computation
Rigorous hitting times for binary mutations
Evolutionary Computation
Theoretical analysis of diversity mechanisms for global exploration
Proceedings of the 10th annual conference on Genetic and evolutionary computation
A Low-Cost Pedestrian-Detection System With a Single Optical Camera
IEEE Transactions on Intelligent Transportation Systems
Materialized view selection as constrained evolutionary optimization
IEEE Transactions on Systems, Man, and Cybernetics, Part C: Applications and Reviews
Parameter control in evolutionary algorithms
IEEE Transactions on Evolutionary Computation
Statistical distribution of the convergence time of evolutionaryalgorithms for long-path problems
IEEE Transactions on Evolutionary Computation
IEEE Transactions on Evolutionary Computation
IEEE Transactions on Evolutionary Computation
IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics
A Memetic Algorithm for VLSI Floorplanning
IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics
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
When is an estimation of distribution algorithm better than an evolutionary algorithm?
CEC'09 Proceedings of the Eleventh conference on Congress on Evolutionary Computation
Analysis of computational time of simple estimation of distribution algorithms
IEEE Transactions on Evolutionary Computation
Fitness-levels for non-elitist populations
Proceedings of the 13th annual conference on Genetic and evolutionary computation
Convergence of a recombination-based elitist evolutionary algorithm on the royal roads test function
AI'11 Proceedings of the 24th international conference on Advances in Artificial Intelligence
A large population size can be unhelpful in evolutionary algorithms
Theoretical Computer Science
The use of tail inequalities on the probable computational time of randomized search heuristics
Theoretical Computer Science
A network theoretic analysis of evolutionary algorithms
SEMCCO'12 Proceedings of the Third international conference on Swarm, Evolutionary, and Memetic Computing
| Hi-index | 0.00 |
In the past decades, many theoretical results related to the time complexity of evolutionary algorithms (EAs) on different problems are obtained. However, there is not any general and easy-to-apply approach designed particularly for population-based EAs on unimodal problems. In this paper, we first generalize the concept of the takeover time to EAs with mutation, then we utilize the generalized takeover time to obtain the mean first hitting time of EAs and, thus, propose a general approach for analyzing EAs on unimodal problems. As examples, we consider the so-called (N + N) EAs and we show that, on two well-known unimodal problems, LEADINGONES and ONEMAX, the EAs with the bitwise mutation and two commonly used selection schemes both need O(n ln n + n2/N) and O(n ln ln n + n ln n/N) generations to find the global optimum, respectively. Except for the new results above, our approach can also be applied directly for obtaining results for some population-based EAs on some other unimodal problems. Moreover, we also discuss when the general approach is valid to provide us tight bounds of the mean first hitting times and when our approach should be combined with problem-specific knowledge to get the tight bounds. It is the first time a general idea for analyzing population-based EAs on unimodal problems is discussed theoretically.