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… CONTINUE READING