Scalability Problems of Simple Genetic Algorithms

@article{Thierens1999ScalabilityPO,
  title={Scalability Problems of Simple Genetic Algorithms},
  author={Dirk Thierens},
  journal={Evolutionary Computation},
  year={1999},
  volume={7},
  pages={331-352}
}
Scalable evolutionary computation has. become an intensively studied research topic in recent years. The issue of scalability is predominant in any field of algorithmic design, but it became particularly relevant for the design of competent genetic algorithms once the scalability problems of simple genetic algorithms were understood. Here we present some of the work that has aided in getting a clear insight in the scalability problems of simple genetic algorithms. Particularly, we discuss the… CONTINUE READING
Highly Influential
This paper has highly influenced 15 other papers. REVIEW HIGHLY INFLUENTIAL CITATIONS
Highly Cited
This paper has 135 citations. REVIEW CITATIONS

Citations

Publications citing this paper.
Showing 1-10 of 83 extracted citations

Analyzing Probabilistic Models in Hierarchical BOA

IEEE Transactions on Evolutionary Computation • 2009
View 5 Excerpts
Highly Influenced

Detecting the epistatic structure of generalized embedded landscape

Genetic Programming and Evolvable Machines • 2007
View 4 Excerpts
Highly Influenced

136 Citations

051015'01'04'08'12'16
Citations per Year
Semantic Scholar estimates that this publication has 136 citations based on the available data.

See our FAQ for additional information.

References

Publications referenced by this paper.
Showing 1-10 of 34 references

Adaptation in natzrral and artificial systems

J. H. Holland
1975
View 3 Excerpts
Highly Influenced

O n the design of genetic algorithms for geographical applications

I S.ran, D. Thierens, de Berg, hl
In Ranzhaf, \A'., • 1999

T h e race, the hurdle, and the sweet spot: lessons from genetic algorithns for the automation of design innovation and creativity. IIliGAL

D. E. Goldberg
Technical Report 98007, • 1998
View 1 Excerpt

Learning linkage to efficiently solve problems of bounded difficulty using genetic algorithms

G. Harik
1997
View 1 Excerpt

ML,.IIC: Finding optima by estimating probability densities. Alva?zces h Xerrwl hlfoinintioii PToressivg System

J. S. Ue Bonet, C. L. Isbell, P. lola
Volume 9, • 1997
View 1 Excerpt

Similar Papers

Loading similar papers…