Using Genetic Algorithms with Small Populations

@inproceedings{Reeves1993UsingGA,
  title={Using Genetic Algorithms with Small Populations},
  author={Colin R. Reeves},
  booktitle={ICGA},
  year={1993}
}
Most reported (serial) implementations of genetic algorithms have assumed population sizes of at least 30, and often very much larger. The general question of population sizing has been considered from several aspects, with somewhat connicting conclusions , and then only for populations of binary strings. In this paper we consider applications where it is important to use as small a population as possible, where the number of tness evaluations is limited, and where non-binary representations… CONTINUE READING

From This Paper

Topics from this paper.

Citations

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

References

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

Genetic design and Taguchi methods: an experimental comparison

  • Wright Reeves, C R Reeves, C C Wright
  • Genetic design and Taguchi methods: an…
  • 1993

Modern Heuristic Techniques for Combinatorial Problems

  • C R Reeves
  • Modern Heuristic Techniques for Combinatorial…
  • 1993
1 Excerpt

Proceedings of an International Conference on Artiicial Neural Networks and Genetic Algorithms

  • R F Albrecht, C R Reeves, N C Steele
  • Proceedings of an International Conference on…
  • 1993

Structural design for enhanced noise performance using genetic algorithm and other optimization techniques

  • A J Keane
  • Structural design for enhanced noise performance…
  • 1993
1 Excerpt

A study of control parameters affecting online performance of genetic algorithms for function optimization

  • D Schaaer, R A Caruana, L J Eshelman, R Das
  • Schaaer
  • 1989
2 Excerpts

Similar Papers

Loading similar papers…