Genetic Programming with Simple Loops  

作　　者：齐越胜 王保中 康立山 

机构地区：[1]StateKeyLaboratoryofSoftwareEngineering,WuhanUniversity,Wuhan430072,P,R.China

出　　处：《Journal of Computer Science & Technology》1999年第4期429-432,F003,共5页计算机科学技术学报（英文版）

摘　　要：A kind of loop function LoopN in Genetic Programming (GP) isproposed. Different from other forms of loop function, such as While-Do and Repeat-Until, LoopN takes only one argument as its loop body and makes its loop bodysimply run N times, so infinite loops will never happen. The problem of how to avoidtoo many layers of loops in Genetic Programming is also solved. The advantage ofLoopN in GP is shown by the computational results in solving the mower problem.A kind of loop function LoopN in Genetic Programming (GP) isproposed. Different from other forms of loop function, such as While-Do and Repeat-Until, LoopN takes only one argument as its loop body and makes its loop bodysimply run N times, so infinite loops will never happen. The problem of how to avoidtoo many layers of loops in Genetic Programming is also solved. The advantage ofLoopN in GP is shown by the computational results in solving the mower problem.

关 键 词：loop function genetic programming mower problem 

分 类 号：TP31[自动化与计算机技术—计算机软件与理论]