%0 Conference Paper %1 poli:1998:local %A Poli, Riccardo %A Langdon, William B. %B Genetic Programming 1998: Proceedings of the Third Annual Conference %C University of Wisconsin, Madison, Wisconsin, USA %D 1998 %E Koza, John R. %E Banzhaf, Wolfgang %E Chellapilla, Kumar %E Deb, Kalyanmoy %E Dorigo, Marco %E Fogel, David B. %E Garzon, Max H. %E Goldberg, David E. %E Iba, Hitoshi %E Riolo, Rick %I Morgan Kaufmann %K algorithms, genetic programming %P 293--301 %T On the Search Properties of Different Crossover Operators in Genetic Programming %U http://citeseer.ist.psu.edu/502272.html %X In this paper we study and compare the search properties of different crossover operators in genetic programming (GP) using probabilistic models and experiments to assess the amount of genetic material exchanged between the parents to generate the offspring. These operators are: standard crossover, one-point crossover and a new operator, uniform crossover. Our analysis suggests that standard crossover is a local and biased search operator not ideal to explore the search space of programs effectively. One-point crossover is better in some cases as it is able to perform a global search at the beginning of a run, but it suffers from the same problems as standard crossover later on. Uniform crossover largely overcomes these limitations as it is global and less biased. %@ 1-55860-548-7

@inproceedings{poli:1998:local, abstract = {In this paper we study and compare the search properties of different crossover operators in genetic programming (GP) using probabilistic models and experiments to assess the amount of genetic material exchanged between the parents to generate the offspring. These operators are: standard crossover, one-point crossover and a new operator, uniform crossover. Our analysis suggests that standard crossover is a local and biased search operator not ideal to explore the search space of programs effectively. One-point crossover is better in some cases as it is able to perform a global search at the beginning of a run, but it suffers from the same problems as standard crossover later on. Uniform crossover largely overcomes these limitations as it is global and less biased.}, added-at = {2008-06-19T17:46:40.000+0200}, address = {University of Wisconsin, Madison, Wisconsin, USA}, author = {Poli, Riccardo and Langdon, William B.}, biburl = {https://www.bibsonomy.org/bibtex/21e9565d069d37a2ddf56d8e35cbd09ee/brazovayeye}, booktitle = {Genetic Programming 1998: Proceedings of the Third Annual Conference}, editor = {Koza, John R. and Banzhaf, Wolfgang and Chellapilla, Kumar and Deb, Kalyanmoy and Dorigo, Marco and Fogel, David B. and Garzon, Max H. and Goldberg, David E. and Iba, Hitoshi and Riolo, Rick}, interhash = {7638460e0281ef68483bb87d006b303b}, intrahash = {1e9565d069d37a2ddf56d8e35cbd09ee}, isbn = {1-55860-548-7}, keywords = {algorithms, genetic programming}, month = {22-25 July}, notes = {GP-98. Based on \cite{poli:1998:localTR}}, pages = {293--301}, publisher = {Morgan Kaufmann}, publisher_address = {San Francisco, CA, USA}, timestamp = {2008-06-19T17:49:41.000+0200}, title = {On the Search Properties of Different Crossover Operators in Genetic Programming}, url = {http://citeseer.ist.psu.edu/502272.html}, year = 1998 }