%0 Journal Article %1 Radcliffe91equivalenceclass %A Radcliffe, Nicholas J. %D 1991 %J Complex Systems %K algorithms analysis formae genetic %N 2 %P 183-205 %T Equivalence Class Analysis Of Genetic Algorithms %U http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.23.6761 %V 5 %X The conventional understanding of genetic algorithms depends upon analysis by schemata and the notion of intrinsic parallelism. For this reason, only k-ary string representations have had any formal basis and non-standard representations and operators have been regarded largely as heuristics, rather than principled algorithms. This paper extends the analysis to general representations through identification of schemata as equivalence classes induced by implicit equivalence relations over the space of chromosomes.

@article{Radcliffe91equivalenceclass, abstract = {The conventional understanding of genetic algorithms depends upon analysis by schemata and the notion of intrinsic parallelism. For this reason, only k-ary string representations have had any formal basis and non-standard representations and operators have been regarded largely as heuristics, rather than principled algorithms. This paper extends the analysis to general representations through identification of schemata as equivalence classes induced by implicit equivalence relations over the space of chromosomes.}, added-at = {2011-02-23T17:15:54.000+0100}, author = {Radcliffe, Nicholas J.}, biburl = {https://www.bibsonomy.org/bibtex/27e797bba5aec4fedb47f578db591d060/riexinsa}, description = {Equivalence Class Analysis Of Genetic Algorithms}, interhash = {31b67dbe415360730fb0aa04413a806c}, intrahash = {7e797bba5aec4fedb47f578db591d060}, journal = {Complex Systems}, keywords = {algorithms analysis formae genetic}, number = 2, pages = {183-205}, timestamp = {2011-02-23T17:15:54.000+0100}, title = {Equivalence Class Analysis Of Genetic Algorithms}, url = {http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.23.6761}, volume = 5, year = 1991 }