%0 Conference Paper %1 li:2005:CECx %A Li, Xiang %A Ciesielski, Vic %B Proceedings of the 2005 IEEE Congress on Evolutionary Computation %C Edinburgh, UK %D 2005 %E Corne, David %E Michalewicz, Zbigniew %E Dorigo, Marco %E Eiben, Gusz %E Fogel, David %E Fonseca, Carlos %E Greenwood, Garrison %E Chen, Tan Kay %E Raidl, Guenther %E Zalzala, Ali %E Lucas, Simon %E Paechter, Ben %E Willies, Jennifier %E Guervos, Juan J. Merelo %E Eberbach, Eugene %E McKay, Bob %E Channon, Alastair %E Tiwari, Ashutosh %E Volkert, L. Gwenn %E Ashlock, Dan %E Schoenauer, Marc %I IEEE Press %K ADL, STGP algorithms, ant, forloops, genetic iteration, modified programming, %P 2522--2529 %T An Analysis of Explicit Loops in Genetic Programming %V 3 %X we analyse the reasons why evolving programs with a restricted form of loops is superior to evolving programs without loops for two problems which have underlying repetitive characteristics - a visit every- square problem and a modified Santa Fe ant problem. We show that in the case of loops there is a larger number of solutions with smaller tree sizes. We show that the computational patterns captured in the bodies of the loops are reflective of repeating patterns in the domain. We show that the increased computational cost of evaluating an individual can be controlled by domain knowledge. %@ 0-7803-9363-5

@inproceedings{li:2005:CECx, abstract = {we analyse the reasons why evolving programs with a restricted form of loops is superior to evolving programs without loops for two problems which have underlying repetitive characteristics - a visit every- square problem and a modified Santa Fe ant problem. We show that in the case of loops there is a larger number of solutions with smaller tree sizes. We show that the computational patterns captured in the bodies of the loops are reflective of repeating patterns in the domain. We show that the increased computational cost of evaluating an individual can be controlled by domain knowledge.}, added-at = {2008-06-19T17:35:00.000+0200}, address = {Edinburgh, UK}, author = {Li, Xiang and Ciesielski, Vic}, biburl = {https://www.bibsonomy.org/bibtex/2f5258c7b9224ced2c21b5786481f3c02/brazovayeye}, booktitle = {Proceedings of the 2005 IEEE Congress on Evolutionary Computation}, editor = {Corne, David and Michalewicz, Zbigniew and Dorigo, Marco and Eiben, Gusz and Fogel, David and Fonseca, Carlos and Greenwood, Garrison and Chen, Tan Kay and Raidl, Guenther and Zalzala, Ali and Lucas, Simon and Paechter, Ben and Willies, Jennifier and Guervos, Juan J. Merelo and Eberbach, Eugene and McKay, Bob and Channon, Alastair and Tiwari, Ashutosh and Volkert, L. Gwenn and Ashlock, Dan and Schoenauer, Marc}, interhash = {d29f33dc0026176a373b14a69da20dcb}, intrahash = {f5258c7b9224ced2c21b5786481f3c02}, isbn = {0-7803-9363-5}, keywords = {ADL, STGP algorithms, ant, forloops, genetic iteration, modified programming,}, month = {2-5 September}, notes = {CEC2005 - A joint meeting of the IEEE, the IEE, and the EPS.}, organisation = {IEEE Computational Intelligence Society, Institution of Electrical Engineers (IEE), Evolutionary Programming Society (EPS)}, pages = {2522--2529}, publisher = {IEEE Press}, publisher_address = {445 Hoes Lane, P.O. Box 1331, Piscataway, NJ 08855-1331, USA}, timestamp = {2008-06-19T17:45:34.000+0200}, title = {An Analysis of Explicit Loops in Genetic Programming}, volume = 3, year = 2005 }