Genetic Algorithms , and Hardness

@inproceedings{Rylander2002GeneticA,
  title={Genetic Algorithms , and Hardness},
  author={Bart Rylander and James F. Foster},
  year={2002}
}
Genetic algorithm (GA) researchers have long desired to describe the key characteristics of GAhardness. Unfortunately this goal has remained largely unmet. In this paper, we describe a new way for evaluating GA-hardness that is based on the foundations of formal complexity theory. In particular, a GAreduction is introduced. Using this reduction, we show that a reasonable definition of "GA-hardness" is essentially the same as the definition of "hardness" in complexity theory. We then provide a… CONTINUE READING

From This Paper

Figures, tables, and topics from this paper.

References

Publications referenced by this paper.
Showing 1-8 of 8 references

Finding Cliques in Keller Graphs with Genetic Algorithms

  • J. Marconi, J. Foster
  • Proc. Int. Conf. on Evolutionary Computing
  • 1998
1 Excerpt

Using genetic programming to approximate maximum cliques

  • Soule, Terence, James A. Foster, John Dickinson
  • Proc. Genetic Programming
  • 1996
1 Excerpt

Introduction. Foundations of Genetic Algorithms

  • G.J.E. Rawlins
  • 1991
1 Excerpt

Representation Issues in Genetic 1 100 10000 Elements Gens Elements

  • G. Liepins, M. Vose
  • Gens
  • 1990
1 Excerpt

Similar Papers

Loading similar papers…