%0 Conference Paper %1 langdon:1999:fairxo %A Langdon, W. B. %B Proceedings of the Genetic and Evolutionary Computation Conference %C Orlando, Florida, USA %D 1999 %E Banzhaf, Wolfgang %E Daida, Jason %E Eiben, Agoston E. %E Garzon, Max H. %E Honavar, Vasant %E Jakiela, Mark %E Smith, Robert E. %I Morgan Kaufmann %K algorithms, binary bloat depth evolution genetic growth, initialisation, length linear of programming, reduction, search shape, spaces subquadratic tree uniform %P 1092--1097 %T Size Fair and Homologous Tree Genetic Programming Crossovers %U http://www.cs.bham.ac.uk/~wbl/biblio/gecco1999/GP-405.ps %V 2 %X Size fair and homologous crossover genetic operators for tree based genetic programming are described and tested. Both produce considerably reduced increases in program size and no detrimental effect on GP performance. GP search spaces are partitioned by the ridge in the number of program versus their size and depth. A ramped uniform random initialisation is described which straddles the ridge. With subtree crossover trees increase about one level per generation leading to sub-quadratic bloat in length. %@ 1-55860-611-4

@inproceedings{langdon:1999:fairxo, abstract = {Size fair and homologous crossover genetic operators for tree based genetic programming are described and tested. Both produce considerably reduced increases in program size and no detrimental effect on GP performance. GP search spaces are partitioned by the ridge in the number of program versus their size and depth. A ramped uniform random initialisation is described which straddles the ridge. With subtree crossover trees increase about one level per generation leading to sub-quadratic bloat in length.}, added-at = {2008-06-19T17:35:00.000+0200}, address = {Orlando, Florida, USA}, author = {Langdon, W. B.}, biburl = {https://www.bibsonomy.org/bibtex/2d623c3294fce29bfc075d077f0a24f9a/brazovayeye}, booktitle = {Proceedings of the Genetic and Evolutionary Computation Conference}, editor = {Banzhaf, Wolfgang and Daida, Jason and Eiben, Agoston E. and Garzon, Max H. and Honavar, Vasant and Jakiela, Mark and Smith, Robert E.}, interhash = {a692b7d3d3f8fc9a5fdcd63835641f3b}, intrahash = {d623c3294fce29bfc075d077f0a24f9a}, isbn = {1-55860-611-4}, keywords = {algorithms, binary bloat depth evolution genetic growth, initialisation, length linear of programming, reduction, search shape, spaces subquadratic tree uniform}, month = {13-17 July}, notes = {See also \cite{langdon:2000:fairxo} and \cite{langdon:1999:fairxTR} Also known as langdon:1999:SFHTGPC GECCO-99, part of \cite{banzhaf:1999:gecco99} A joint meeting of the eighth international conference on genetic algorithms (ICGA-99) and the fourth annual genetic programming conference (GP-99)}, pages = {1092--1097}, publisher = {Morgan Kaufmann}, publisher_address = {San Francisco, CA 94104, USA}, timestamp = {2008-06-19T17:44:54.000+0200}, title = {Size Fair and Homologous Tree Genetic Programming Crossovers}, url = {http://www.cs.bham.ac.uk/~wbl/biblio/gecco1999/GP-405.ps}, volume = 2, year = 1999 }