Corpus ID: 14148469

Time Complexity of genetic algorithms on exponentially scaled problems

  title={Time Complexity of genetic algorithms on exponentially scaled problems},
  author={F. Lobo and D. Goldberg and M. Pelikan},
This paper gives a theoretical and empirical analysis of the time complexity of genetic algorithms (GAs) on problems with exponentially scaled building blocks. It is important to study GA performance on this type of problems because one of the difficulties that GAs are generally faced with is due to the low scaling or low salience of some building blocks. The paper is an extension of the model introduced by Thierens, Goldberg, and Pereira (1998) for the case of building blocks rather than… Expand
77 Citations
Domino convergence: why one should hill-climb on linear functions
  • C. Witt
  • Mathematics, Computer Science
  • 2018
  • 16
  • PDF
Representations for evolutionary algorithms
  • 7
Design of Representations and Search Operators
  • Franz Rothlauf
  • Computer Science
  • Handbook of Computational Intelligence
  • 2015
  • 1
Efficient Genetic Algorithms Using Discretization Scheduling
  • 12
Improving the K-means algorithm using improved downhill simplex search
  • 2
  • PDF
On the effectiveness of distributions estimated by probabilistic model building
  • 5
  • Highly Influenced
  • PDF


Genetic Algorithms, Noise, and the Sizing of Populations
  • 747
  • PDF
Learning gene linkage to efficiently solve problems of bounded difficulty using genetic algorithms
  • 223
  • Highly Influential
The compact genetic algorithm
  • 963
  • PDF
How Genetic Algorithms Really Work I.mutation and Hillclimbing
  • 308
  • PDF
On the Mean Convergence Time of Evolutionary Algorithms without Selection and Mutation
  • 95
  • PDF
The gambler's ruin problem, genetic algorithms, and the sizing of populations
  • 249
Domino convergence, drift, and the temporal-salience structure of problems
  • D. Thierens, D. Goldberg, A. G. Pereira
  • Mathematics
  • 1998 IEEE International Conference on Evolutionary Computation Proceedings. IEEE World Congress on Computational Intelligence (Cat. No.98TH8360)
  • 1998
  • 151
  • PDF
Predictive Models for the Breeder Genetic Algorithm I. Continuous Parameter Optimization
  • 1,276
  • PDF
From Recombination of Genes to the Estimation of Distributions I. Binary Parameters
  • 1,250
  • PDF