524:
replaces it with a subtree within itself. Thus hoist mutation is guaranteed to make the child smaller. Leaf and same arity function replacement ensure the child is the same size as the parent. Whereas subtree mutation (in the animation) may, depending upon the function and terminal sets, have a bias to either increase or decrease the tree size. Other subtree based mutations try to carefully control the size of the replacement subtree and thus the size of the child tree.
460:. Experiments seem to show faster convergence when using program representations that allow such non-coding genes, compared to program representations that do not have any non-coding genes. Instantiations may have both trees with introns and those without; the latter are called canonical trees. Special canonical crossover operators are introduced that maintain the canonical structure of parents in their children.
306:
different offspring that become part of the new generation of programs. Some programs not selected for reproduction are copied from the current generation to the new generation. Mutation involves substitution of some random part of a program with some other random part of a program. Then the selection and other operations are recursively applied to the new generation of programs.
528:
338:(GA) conference in Pittsburgh that Nichael Cramer published evolved programs in two specially designed languages, which included the first statement of modern "tree-based" Genetic Programming (that is, procedural languages organized in tree-based structures and operated on by suitably defined GA-operators). In 1988,
547:
tool, a machine learning tool and an automatic problem-solving engine. GP is especially useful in the domains where the exact form of the solution is not known in advance or an approximate solution is acceptable (possibly because finding the exact solution is very difficult). Some of the applications
349:
In 1996, Koza started the annual
Genetic Programming conference which was followed in 1998 by the annual EuroGP conference, and the first book in a GP series edited by Koza. 1998 also saw the first GP textbook. GP continued to flourish, leading to the first specialist GP journal and three years later
345:
Koza followed this with 205 publications on “Genetic
Programming” (GP), name coined by David Goldberg, also a PhD student of John Holland. However, it is the series of 4 books by Koza, starting in 1992 with accompanying videos, that really established GP. Subsequently, there was an enormous expansion
305:
The operations are: selection of the fittest programs for reproduction (crossover), replication and/or mutation according to a predefined fitness measure, usually proficiency at the desired task. The crossover operation involves swapping specified parts of selected pairs (parents) to produce new and
589:
Critics of this idea often say this approach is overly broad in scope. However, it might be possible to constrain the fitness criterion onto a general class of results, and so obtain an evolved GP that would more efficiently produce results for sub-classes. This might take the form of a meta evolved
572:
technique of evolving a genetic programming system using genetic programming itself. It suggests that chromosomes, crossover, and mutation were themselves evolved, therefore like their real life counterparts should be allowed to change on their own rather than being determined by a human programmer.
523:
Other mutation operators select a leaf (external node) of the tree and replace it with a randomly chosen leaf. Another mutation is to select at random a function (internal node) and replace it with another function with the same arity (number of inputs). Hoist mutation randomly chooses a subtree and
492:
In
Genetic Programming two fit individuals are chosen from the population to be parents for one or two children. In tree genetic programming, these parents are represented as inverted lisp like trees, with their root nodes at the top. In subtree crossover in each parent a subtree is randomly chosen.
468:
Selection is a process whereby certain individuals are selected from the current generation that would serve as parents for the next generation. The individuals are selected probabilistically such that the better performing individuals have a higher chance of getting selected. The most commonly used
313:
It may and often does happen that a particular run of the algorithm results in premature convergence to some local maximum which is not a globally optimal or even good solution. Multiple runs (dozens to hundreds) are usually necessary to produce a very good result. It may also be necessary to have
496:
Sometimes two child crossover is used, in which case the removed subtree (in the animation on the left) is not simply deleted but is copied to a copy of the second parent (here on the right) replacing (in the copy) its randomly chosen subtree. Thus this type of subtree crossover takes two fit trees
309:
Typically, members of each new generation are on average more fit than the members of the previous generation, and the best-of-generation program is often better than the best-of-generation programs from previous generations. Termination of the evolution usually occurs when some individual program
326:
in 1950. There was a gap of 25 years before the publication of John
Holland's 'Adaptation in Natural and Artificial Systems' laid out the theoretical and empirical foundations of the science. In 1981, Richard Forsyth demonstrated the successful evolution of small programs, represented as trees, to
362:
and repair, predictive modeling, data mining, financial modeling, soft sensors, design, and image processing. Applications in some areas, such as design, often make use of intermediate representations, such as Fred Gruau’s cellular encoding. Industrial uptake has been significant in several areas
519:
There are many types of mutation in genetic programming. They start from a fit syntactically correct parent and aim to randomly create a syntactically correct child. In the animation a subtree is randomly chosen (highlighted by yellow). It is removed and replaced by a randomly generated subtree.
585:
is an earlier effort that may be the same technique. It is a recursive but terminating algorithm, allowing it to avoid infinite recursion. In the "autoconstructive evolution" approach to meta-genetic programming, the methods for the production and variation of offspring are encoded within the
350:(2003) the annual Genetic Programming Theory and Practice (GPTP) workshop was established by Rick Riolo. Genetic Programming papers continue to be published at a diversity of conferences and associated journals. Today there are nineteen GP books including several for students.
556:, classification, etc. John R. Koza mentions 76 instances where Genetic Programming has been able to produce results that are competitive with human-produced results (called Human-competitive results). Since 2004, the annual Genetic and Evolutionary Computation Conference (
444:
for encoding solutions. Other program representations on which significant research and development have been conducted include programs for stack-based virtual machines, and sequences of integers that are mapped to arbitrary programming languages via grammars.
456:). Such non-coding genes may seem to be useless because they have no effect on the performance of any one individual. However, they alter the probabilities of generating different offspring under the variation operators, and thus alter the individual's
500:
560:) holds Human Competitive Awards (called Humies) competition, where cash awards are presented to human-competitive results produced by any form of genetic and evolutionary computation. GP has won many awards in this competition over the years.
397:. Trees can be easily evaluated in a recursive manner. Every internal node has an operator function and every terminal node has an operand, making mathematical expressions easy to evolve and evaluate. Thus traditionally GP favors the use of
493:(Highlighted with yellow in the animation.) In the root donating parent (in the animation on the left) the chosen subtree is removed and replaced with a copy of the randomly chosen subtree from the other parent, to give a new child tree.
805:
Goldberg. D.E. (1983), Computer-aided gas pipeline operation using genetic algorithms and rule learning. Dissertation presented to the
University of Michigan at Ann Arbor, Michigan, in partial fulfillment of the requirements for
510:
Some individuals selected according to fitness criteria do not participate in crossover, but are copied into the next generation, akin to asexual reproduction in the natural world. They may be further subject to mutation.
302:) is a technique of evolving programs, starting from a population of unfit (usually random) programs, fit for a particular task by applying operations analogous to natural genetic processes to the population of programs.
342:(also a PhD student of John Holland) patented his invention of a GA for program evolution. This was followed by publication in the International Joint Conference on Artificial Intelligence IJCAI-89.
377:
346:
of the number of publications with the
Genetic Programming Bibliography, surpassing 10,000 entries. In 2010, Koza listed 77 results where Genetic Programming was human competitive.
590:
GP for producing human walking algorithms which is then used to evolve human running, jumping, etc. The fitness criterion applied to the meta GP would simply be one of efficiency.
1626:
1837:
1876:
535:
Similarly there are many types of linear genetic programming mutation, each of which tries to ensure the mutated child is still syntactically correct.
1366:
Genetic
Programming: An Introduction, Wolfgang Banzhaf, Peter Nordin, Robert E. Keller, Frank D. Francone, Morgan Kaufmann, 1999. ISBN 978-1558605107
281:
1761:
GECCO '16 Companion : proceedings of the 2016 Genetic and
Evolutionary Computation Conference : July 20-24, 2016, Denver, Colorado, USA
1792:
1350:
1812:
499:
449:
is another form of GP, which uses a graph representation instead of the usual tree based representation to encode computer programs.
1443:
Spector, Lee; Robinson, Alan (2002-03-01). "Genetic
Programming and Autoconstructive Evolution with the Push Programming Language".
2132:
104:
1825:
1656:
Spector, Lee (2012). "Assessment of problem modality by differential performance of lexicase selection in genetic programming".
1869:
240:
274:
2127:
1919:
1914:
1909:
109:
1747:"1987 THESIS ON LEARNING HOW TO LEARN, METALEARNING, META GENETIC PROGRAMMING, CREDIT-CONSERVING MACHINE LEARNING ECONOMY"
1623:
358:
Early work that set the stage for current genetic programming research topics and applications is diverse, and includes
2165:
1513:
1763:. Neumann, Frank (Computer scientist), Association for Computing Machinery. SIGEVO. New York, New York. 20 July 2016.
1862:
1768:
1675:
1564:
187:
1486:
Spector, Lee; Klein, Jon; Keijzer, Maarten (2005-06-25). "The Push3 execution stack and the evolution of control".
674:
569:
267:
134:
42:
1937:
1176:
531:
Animation of creating genetic programing child by mutating parent removing subtree and replacing with random code
474:
69:
586:
evolving programs themselves, and programs are executed to produce new programs to be added to the population.
167:
993:"Genetic Programming -- An Introduction; On the Automatic Evolution of Computer Programs and its Applications"
2033:
1224:
604:
446:
220:
197:
177:
139:
2186:
1275:
650:
437:
235:
182:
2191:
2028:
1972:
966:"Genetic Programming and Data Structures: Genetic Programming + Data Structures = Automatic Programming!"
620:
402:
331:
245:
114:
758:
698:
1992:
1982:
1796:
1323:
1299:
1200:
1104:
992:
645:
413:
225:
172:
124:
1128:
1051:
941:
1276:"Genetic Algorithm Decoding for the Interpretation of Infra-red Spectra in Analytical Biotechnology"
1201:"Discovery of Human-Competitive Image Texture Feature Extraction Programs Using Genetic Programming"
893:
1957:
1904:
1885:
1547:
1496:
1347:
734:
89:
965:
2087:
2013:
1152:
848:
484:
individuals) from the current generation, is a technique sometimes employed to avoid regression.
1643:
477:, lexicase selection, and others have been demonstrated to perform better for many GP problems.
2082:
1952:
1899:
1542:
1491:
917:
816:
630:
599:
457:
406:
388:
79:
59:
50:
2117:
2102:
1225:"Three Ways to Grow Designs: A Comparison of Embryogenies for an Evolutionary Design Problem"
655:
640:
635:
615:
544:
394:
230:
192:
782:
574:
1659:
Proceedings of the 14th annual conference companion on
Genetic and evolutionary computation
470:
417:
398:
314:
a large starting population size and variability of the individuals to avoid pathologies.
8:
2061:
1376:
625:
549:
429:
334:, was current amongst John Holland’s students, it was not until they organised the first
144:
99:
28:
24:
2008:
1977:
1947:
1786:
1681:
1605:
1519:
1468:
1416:
869:
441:
424:
uses automatic induction of binary machine code ("AIM") to achieve better performance.
94:
74:
480:
Elitism, which involves seeding the next generation with the best individual (or best
2147:
2122:
2112:
2066:
2051:
1962:
1817:
1774:
1764:
1671:
1597:
1560:
1509:
1460:
1033:
553:
433:
359:
335:
158:
119:
84:
20:
1609:
1523:
870:"The effects of recombination on phenotypic exploration and robustness in evolution"
817:"Genetic Programming: On the Programming of Computers by Means of Natural Selection"
2157:
2137:
2107:
2097:
1712:
1685:
1663:
1589:
1552:
1501:
1472:
1452:
1025:
412:
Non-tree representations have been suggested and successfully implemented, such as
255:
149:
2092:
1630:
1354:
363:
including finance, the chemical industry, bioinformatics and the steel industry.
64:
16:
Evolving computer programs with techniques analogous to natural genetic processes
1488:
Proceedings of the 7th annual conference on Genetic and evolutionary computation
2056:
2018:
1987:
783:"Hierarchical genetic algorithms operating on populations of computer programs"
527:
381:
129:
1717:
1700:
1456:
1377:"A Comparison of Cartesian Genetic Programming and Linear Genetic Programming"
1248:
1029:
840:
2180:
2043:
2023:
1778:
1657:
1601:
1464:
1037:
578:
202:
32:
1746:
1667:
1505:
1348:"A Representation for the Adaptive Generation of Simple Sequential Programs"
735:"A representation for the Adaptive Generation of Simple Sequential Programs"
1854:
1388:
330:
Although the idea of evolving programs, initially in the computer language
1732:
2142:
323:
1593:
322:
The first record of the proposal to evolve programs is probably that of
1556:
376:
327:
perform classification of crime scene evidence for the UK Home Office.
1842:
Riccardo Poli, William B. Langdon, Nicholas F. McPhee, John R. Koza, "
918:"Genetic Programming 1996: Proceedings of the First Annual Conference"
1929:
1177:"Human-competitive machine invention by means of genetic programming"
393:
GP evolves computer programs, traditionally represented in memory as
339:
1849:
1843:
1080:
1300:"Genetic Programming for Mining DNA Chip data from Cancer Patients"
1249:"Cellular encoding as a graph grammar - IET Conference Publication"
1541:. Berlin, Heidelberg: Springer Berlin Heidelberg. pp. 83–96.
1105:"Data Mining and Knowledge Discovery with Evolutionary Algorithms"
722:
582:
250:
1942:
1402:
609:
453:
432:
to generate programs that fully exploit the syntax of a given
1832:
557:
1644:
A New Crossover Technique for Cartesian Genetic Programming"
1701:"Human-competitive results produced by genetic programming"
1253:
894:"Human-competitive results produced by genetic programming"
1016:
Banzhaf, Wolfgang (2000-04-01). "Editorial Introduction".
452:
Most representations have structurally noneffective code (
1642:
Janet Clegg; James Alfred Walker; Julian Francis Miller.
1153:"Applying Computational Intelligence How to Create Value"
1943:
Covariance Matrix Adaptation Evolution Strategy (CMA-ES)
1580:
O'Neill, M.; Ryan, C. (2001). "Grammatical evolution".
1850:
Genetic Programming, a community maintained resource
1391:, 1997, Banzhaf et al., 1998, Section 11.6.2-11.6.3)
759:"Non-Linear Genetic Algorithms for Solving Problems"
699:"BEAGLE A Darwinian Approach to Pattern Recognition"
401:
that naturally embody tree structures (for example,
1838:
The Hitch-Hiker's Guide to Evolutionary Computation
1537:Ryan, Conor; Collins, JJ; Neill, Michael O (1998).
1485:
310:reaches a predefined proficiency or fitness level.
2178:
1536:
987:
985:
1579:
1442:
1438:
1436:
610:Covariance Matrix Adaptation Evolution Strategy
1400:
1324:"Genetic Programming and Jominy Test Modeling"
1075:
1073:
1071:
1870:
1582:IEEE Transactions on Evolutionary Computation
982:
275:
1884:
1433:
1068:
563:
1877:
1863:
1819:Genetic Programming and Evolvable Machines
1791:: CS1 maint: location missing publisher (
1705:Genetic Programming and Evolvable Machines
1445:Genetic Programming and Evolvable Machines
1018:Genetic Programming and Evolvable Machines
353:
282:
268:
1716:
1546:
1495:
1340:
1052:"Genetic Programming Theory and Practice"
568:Meta-genetic programming is the proposed
416:which perhaps suits the more traditional
371:
2133:No free lunch in search and optimization
548:of GP are curve fitting, data modeling,
526:
375:
1655:
1015:
2179:
1081:"A Field Guide to Genetic Programming"
675:"Computing Machinery and Intelligence"
1858:
1375:Garnett Wilson and Wolfgang Banzhaf.
2128:Interactive evolutionary computation
1920:Interactive evolutionary computation
1915:Human-based evolutionary computation
1910:Evolutionary multimodal optimization
1844:A Field Guide to Genetic Programming
1698:
1662:. Gecco '12. ACM. pp. 401–408.
543:GP has been successfully used as an
110:Evolutionary multimodal optimization
1813:Aymen S Saket & Mark C Sinclair
13:
2166:Evolutionary Computation (journal)
1733:"Humies =Human-Competitive Awards"
14:
2203:
1806:
1539:Lecture Notes in Computer Science
1417:"Stack-Based Genetic Programming"
573:Meta-GP was formally proposed by
473:, although other methods such as
498:
497:and generates two child trees.
407:functional programming languages
135:Promoter based genetic algorithm
1938:Cellular evolutionary algorithm
1753:
1739:
1725:
1692:
1649:
1636:
1624:"Cartesian Genetic Programming"
1616:
1573:
1530:
1479:
1409:
1394:
1381:
1369:
1360:
1316:
1292:
1268:
1241:
1217:
1193:
1169:
1145:
1121:
1097:
1044:
1009:
958:
934:
910:
886:
862:
851:from the original on 2021-12-11
841:"Genetic Programming:The Movie"
538:
475:fitness proportionate selection
70:Cellular evolutionary algorithm
833:
809:
799:
775:
751:
727:
721:A personal communication with
715:
691:
667:
505:
1:
2034:Bacterial Colony Optimization
661:
605:Cartesian genetic programming
447:Cartesian genetic programming
420:. The commercial GP software
221:Cartesian genetic programming
140:Spiral optimization algorithm
1827:Evo2 for genetic programming
651:Multi expression programming
487:
463:
438:Multi expression programming
380:A function represented as a
294:In artificial intelligence,
236:Multi expression programming
7:
2029:Particle swarm optimization
1973:Gene expression programming
1490:. ACM. pp. 1689–1696.
621:Gene expression programming
593:
514:
115:Particle swarm optimization
10:
2208:
1993:Learning classifier system
1983:Natural evolution strategy
646:Linear genetic programming
469:selection method in GP is
414:linear genetic programming
386:
366:
317:
226:Linear genetic programming
173:Clonal selection algorithm
125:Natural evolution strategy
18:
2156:
2075:
2042:
2001:
1928:
1892:
1718:10.1007/s10710-010-9112-3
1129:"EDDIE beats the bookies"
1085:www.gp-field-guide.org.uk
1958:Evolutionary programming
1905:Evolutionary data mining
1886:Evolutionary computation
564:Meta-genetic programming
90:Evolutionary computation
19:Not to be confused with
2088:Artificial intelligence
2014:Ant colony optimization
1668:10.1145/2330784.2330846
1506:10.1145/1068009.1068292
1457:10.1023/A:1014538503543
1257:: 17/1–1710. April 1993
1030:10.1023/A:1010026829303
354:Foundational work in GP
2083:Artificial development
1953:Differential evolution
1900:Evolutionary algorithm
631:Genetic representation
600:Bio-inspired computing
532:
458:variational properties
389:genetic representation
384:
372:Program representation
80:Differential evolution
60:Artificial development
51:Evolutionary algorithm
2118:Fitness approximation
2103:Evolutionary robotics
2044:Metaheuristic methods
1795:) CS1 maint: others (
1699:Koza, John R (2010).
942:"Genetic Programming"
656:Propagation of schema
641:Inductive programming
636:Grammatical evolution
616:Fitness approximation
545:automatic programming
530:
399:programming languages
379:
231:Grammatical evolution
193:Genetic fuzzy systems
1401:Giovanni Squillero.
471:tournament selection
430:directed multigraphs
418:imperative languages
409:are also suitable).
2187:Genetic programming
2062:Gaussian adaptation
1968:Genetic programming
1594:10.1109/4235.942529
626:Genetic improvement
550:symbolic regression
296:genetic programming
241:Genetic Improvement
212:Genetic programming
145:Self-modifying code
100:Gaussian adaptation
29:genetic engineering
25:generic programming
2192:Genetic algorithms
2009:Swarm intelligence
2002:Related techniques
1978:Evolution strategy
1948:Cultural algorithm
1629:2015-09-24 at the
1622:Julian F. Miller.
1557:10.1007/bfb0055930
1421:gpbib.cs.ucl.ac.uk
1353:2005-12-04 at the
1346:Nichael L. Cramer
874:gpbib.cs.ucl.ac.uk
845:gpbib.cs.ucl.ac.uk
575:JĂĽrgen Schmidhuber
533:
442:Three-address code
385:
360:software synthesis
336:Genetic Algorithms
95:Evolution strategy
75:Cultural algorithm
2174:
2173:
2148:Program synthesis
2123:Genetic operators
2113:Fitness landscape
2067:Memetic algorithm
2052:Firefly algorithm
1963:Genetic algorithm
1328:www.cs.bham.ac.uk
1304:www.cs.bham.ac.uk
1280:www.cs.bham.ac.uk
1229:www.cs.bham.ac.uk
1205:www.cs.bham.ac.uk
1181:www.cs.bham.ac.uk
1157:www.cs.bham.ac.uk
1133:www.cs.bham.ac.uk
1109:www.cs.bham.ac.uk
1056:www.cs.bham.ac.uk
997:www.cs.bham.ac.uk
970:www.cs.bham.ac.uk
946:www.cs.bham.ac.uk
922:www.cs.bham.ac.uk
898:www.cs.bham.ac.uk
821:www.cs.bham.ac.uk
787:www.cs.bham.ac.uk
763:www.cs.bham.ac.uk
739:www.cs.bham.ac.uk
703:www.cs.bham.ac.uk
679:www.cs.bham.ac.uk
554:feature selection
434:assembly language
292:
291:
159:Genetic algorithm
120:Memetic algorithm
105:Grammar induction
85:Effective fitness
21:genetic algorithm
2199:
2138:Machine learning
2108:Fitness function
2098:Digital organism
1879:
1872:
1865:
1856:
1855:
1801:
1800:
1790:
1782:
1757:
1751:
1750:
1743:
1737:
1736:
1729:
1723:
1722:
1720:
1711:(3–4): 251–284.
1696:
1690:
1689:
1653:
1647:
1640:
1634:
1620:
1614:
1613:
1577:
1571:
1570:
1550:
1534:
1528:
1527:
1499:
1483:
1477:
1476:
1440:
1431:
1430:
1428:
1427:
1413:
1407:
1406:
1398:
1392:
1385:
1379:
1373:
1367:
1364:
1358:
1344:
1338:
1337:
1335:
1334:
1320:
1314:
1313:
1311:
1310:
1296:
1290:
1289:
1287:
1286:
1272:
1266:
1265:
1263:
1262:
1245:
1239:
1238:
1236:
1235:
1221:
1215:
1214:
1212:
1211:
1197:
1191:
1190:
1188:
1187:
1173:
1167:
1166:
1164:
1163:
1149:
1143:
1142:
1140:
1139:
1125:
1119:
1118:
1116:
1115:
1101:
1095:
1094:
1092:
1091:
1077:
1066:
1065:
1063:
1062:
1048:
1042:
1041:
1013:
1007:
1006:
1004:
1003:
989:
980:
979:
977:
976:
962:
956:
955:
953:
952:
938:
932:
931:
929:
928:
914:
908:
907:
905:
904:
890:
884:
883:
881:
880:
866:
860:
859:
857:
856:
837:
831:
830:
828:
827:
813:
807:
803:
797:
796:
794:
793:
779:
773:
772:
770:
769:
755:
749:
748:
746:
745:
731:
725:
719:
713:
712:
710:
709:
695:
689:
688:
686:
685:
671:
502:
284:
277:
270:
256:Parity benchmark
150:Polymorphic code
38:
37:
2207:
2206:
2202:
2201:
2200:
2198:
2197:
2196:
2177:
2176:
2175:
2170:
2152:
2093:Artificial life
2071:
2038:
1997:
1924:
1888:
1883:
1833:GP bibliography
1809:
1804:
1784:
1783:
1771:
1759:
1758:
1754:
1745:
1744:
1740:
1731:
1730:
1726:
1697:
1693:
1678:
1654:
1650:
1641:
1637:
1631:Wayback Machine
1621:
1617:
1578:
1574:
1567:
1535:
1531:
1516:
1484:
1480:
1441:
1434:
1425:
1423:
1415:
1414:
1410:
1403:"ÎĽGP (MicroGP)"
1399:
1395:
1386:
1382:
1374:
1370:
1365:
1361:
1355:Wayback Machine
1345:
1341:
1332:
1330:
1322:
1321:
1317:
1308:
1306:
1298:
1297:
1293:
1284:
1282:
1274:
1273:
1269:
1260:
1258:
1247:
1246:
1242:
1233:
1231:
1223:
1222:
1218:
1209:
1207:
1199:
1198:
1194:
1185:
1183:
1175:
1174:
1170:
1161:
1159:
1151:
1150:
1146:
1137:
1135:
1127:
1126:
1122:
1113:
1111:
1103:
1102:
1098:
1089:
1087:
1079:
1078:
1069:
1060:
1058:
1050:
1049:
1045:
1014:
1010:
1001:
999:
991:
990:
983:
974:
972:
964:
963:
959:
950:
948:
940:
939:
935:
926:
924:
916:
915:
911:
902:
900:
892:
891:
887:
878:
876:
868:
867:
863:
854:
852:
839:
838:
834:
825:
823:
815:
814:
810:
804:
800:
791:
789:
781:
780:
776:
767:
765:
757:
756:
752:
743:
741:
733:
732:
728:
720:
716:
707:
705:
697:
696:
692:
683:
681:
673:
672:
668:
664:
596:
566:
541:
517:
508:
490:
466:
395:tree structures
391:
374:
369:
356:
320:
288:
65:Artificial life
36:
17:
12:
11:
5:
2205:
2195:
2194:
2189:
2172:
2171:
2169:
2168:
2162:
2160:
2154:
2153:
2151:
2150:
2145:
2140:
2135:
2130:
2125:
2120:
2115:
2110:
2105:
2100:
2095:
2090:
2085:
2079:
2077:
2076:Related topics
2073:
2072:
2070:
2069:
2064:
2059:
2057:Harmony search
2054:
2048:
2046:
2040:
2039:
2037:
2036:
2031:
2026:
2021:
2019:Bees algorithm
2016:
2011:
2005:
2003:
1999:
1998:
1996:
1995:
1990:
1988:Neuroevolution
1985:
1980:
1975:
1970:
1965:
1960:
1955:
1950:
1945:
1940:
1934:
1932:
1926:
1925:
1923:
1922:
1917:
1912:
1907:
1902:
1896:
1894:
1890:
1889:
1882:
1881:
1874:
1867:
1859:
1853:
1852:
1847:
1840:
1835:
1830:
1823:
1815:
1808:
1807:External links
1805:
1803:
1802:
1769:
1752:
1738:
1724:
1691:
1676:
1648:
1635:
1615:
1588:(4): 349–358.
1572:
1565:
1548:10.1.1.38.7697
1529:
1515:978-1595930101
1514:
1497:10.1.1.153.384
1478:
1432:
1408:
1393:
1380:
1368:
1359:
1339:
1315:
1291:
1267:
1240:
1216:
1192:
1168:
1144:
1120:
1096:
1067:
1043:
1008:
981:
957:
933:
909:
885:
861:
832:
808:
798:
774:
750:
726:
723:Tom Westerdale
714:
690:
665:
663:
660:
659:
658:
653:
648:
643:
638:
633:
628:
623:
618:
613:
607:
602:
595:
592:
565:
562:
540:
537:
516:
513:
507:
504:
489:
486:
465:
462:
387:Main article:
382:tree structure
373:
370:
368:
365:
355:
352:
319:
316:
290:
289:
287:
286:
279:
272:
264:
261:
260:
259:
258:
253:
248:
243:
238:
233:
228:
223:
215:
214:
208:
207:
206:
205:
200:
195:
190:
188:Genetic memory
185:
180:
175:
170:
162:
161:
155:
154:
153:
152:
147:
142:
137:
132:
130:Neuroevolution
127:
122:
117:
112:
107:
102:
97:
92:
87:
82:
77:
72:
67:
62:
54:
53:
47:
46:
15:
9:
6:
4:
3:
2:
2204:
2193:
2190:
2188:
2185:
2184:
2182:
2167:
2164:
2163:
2161:
2159:
2155:
2149:
2146:
2144:
2141:
2139:
2136:
2134:
2131:
2129:
2126:
2124:
2121:
2119:
2116:
2114:
2111:
2109:
2106:
2104:
2101:
2099:
2096:
2094:
2091:
2089:
2086:
2084:
2081:
2080:
2078:
2074:
2068:
2065:
2063:
2060:
2058:
2055:
2053:
2050:
2049:
2047:
2045:
2041:
2035:
2032:
2030:
2027:
2025:
2024:Cuckoo search
2022:
2020:
2017:
2015:
2012:
2010:
2007:
2006:
2004:
2000:
1994:
1991:
1989:
1986:
1984:
1981:
1979:
1976:
1974:
1971:
1969:
1966:
1964:
1961:
1959:
1956:
1954:
1951:
1949:
1946:
1944:
1941:
1939:
1936:
1935:
1933:
1931:
1927:
1921:
1918:
1916:
1913:
1911:
1908:
1906:
1903:
1901:
1898:
1897:
1895:
1891:
1887:
1880:
1875:
1873:
1868:
1866:
1861:
1860:
1857:
1851:
1848:
1845:
1841:
1839:
1836:
1834:
1831:
1829:
1828:
1824:
1821:
1820:
1816:
1814:
1811:
1810:
1798:
1794:
1788:
1780:
1776:
1772:
1770:9781450343237
1766:
1762:
1756:
1748:
1742:
1734:
1728:
1719:
1714:
1710:
1706:
1702:
1695:
1687:
1683:
1679:
1677:9781450311786
1673:
1669:
1665:
1661:
1660:
1652:
1645:
1639:
1632:
1628:
1625:
1619:
1611:
1607:
1603:
1599:
1595:
1591:
1587:
1583:
1576:
1568:
1566:9783540643609
1562:
1558:
1554:
1549:
1544:
1540:
1533:
1525:
1521:
1517:
1511:
1507:
1503:
1498:
1493:
1489:
1482:
1474:
1470:
1466:
1462:
1458:
1454:
1450:
1446:
1439:
1437:
1422:
1418:
1412:
1404:
1397:
1390:
1384:
1378:
1372:
1363:
1356:
1352:
1349:
1343:
1329:
1325:
1319:
1305:
1301:
1295:
1281:
1277:
1271:
1256:
1255:
1250:
1244:
1230:
1226:
1220:
1206:
1202:
1196:
1182:
1178:
1172:
1158:
1154:
1148:
1134:
1130:
1124:
1110:
1106:
1100:
1086:
1082:
1076:
1074:
1072:
1057:
1053:
1047:
1039:
1035:
1031:
1027:
1023:
1019:
1012:
998:
994:
988:
986:
971:
967:
961:
947:
943:
937:
923:
919:
913:
899:
895:
889:
875:
871:
865:
850:
846:
842:
836:
822:
818:
812:
802:
788:
784:
778:
764:
760:
754:
740:
736:
730:
724:
718:
704:
700:
694:
680:
676:
670:
666:
657:
654:
652:
649:
647:
644:
642:
639:
637:
634:
632:
629:
627:
624:
622:
619:
617:
614:
611:
608:
606:
603:
601:
598:
597:
591:
587:
584:
580:
576:
571:
570:meta-learning
561:
559:
555:
551:
546:
536:
529:
525:
521:
512:
503:
501:
494:
485:
483:
478:
476:
472:
461:
459:
455:
450:
448:
443:
439:
435:
431:
427:
423:
419:
415:
410:
408:
404:
400:
396:
390:
383:
378:
364:
361:
351:
347:
343:
341:
337:
333:
328:
325:
315:
311:
307:
303:
301:
297:
285:
280:
278:
273:
271:
266:
265:
263:
262:
257:
254:
252:
249:
247:
244:
242:
239:
237:
234:
232:
229:
227:
224:
222:
219:
218:
217:
216:
213:
210:
209:
204:
203:Fly algorithm
201:
199:
196:
194:
191:
189:
186:
184:
181:
179:
176:
174:
171:
169:
166:
165:
164:
163:
160:
157:
156:
151:
148:
146:
143:
141:
138:
136:
133:
131:
128:
126:
123:
121:
118:
116:
113:
111:
108:
106:
103:
101:
98:
96:
93:
91:
88:
86:
83:
81:
78:
76:
73:
71:
68:
66:
63:
61:
58:
57:
56:
55:
52:
49:
48:
44:
40:
39:
34:
33:DNA computing
30:
26:
22:
1967:
1826:
1818:
1760:
1755:
1741:
1727:
1708:
1704:
1694:
1658:
1651:
1638:
1618:
1585:
1581:
1575:
1538:
1532:
1487:
1481:
1448:
1444:
1424:. Retrieved
1420:
1411:
1396:
1389:Peter Nordin
1383:
1371:
1362:
1342:
1331:. Retrieved
1327:
1318:
1307:. Retrieved
1303:
1294:
1283:. Retrieved
1279:
1270:
1259:. Retrieved
1252:
1243:
1232:. Retrieved
1228:
1219:
1208:. Retrieved
1204:
1195:
1184:. Retrieved
1180:
1171:
1160:. Retrieved
1156:
1147:
1136:. Retrieved
1132:
1123:
1112:. Retrieved
1108:
1099:
1088:. Retrieved
1084:
1059:. Retrieved
1055:
1046:
1024:(1–2): 5–6.
1021:
1017:
1011:
1000:. Retrieved
996:
973:. Retrieved
969:
960:
949:. Retrieved
945:
936:
925:. Retrieved
921:
912:
901:. Retrieved
897:
888:
877:. Retrieved
873:
864:
853:. Retrieved
844:
835:
824:. Retrieved
820:
811:
801:
790:. Retrieved
786:
777:
766:. Retrieved
762:
753:
742:. Retrieved
738:
729:
717:
706:. Retrieved
702:
693:
682:. Retrieved
678:
669:
588:
567:
542:
539:Applications
534:
522:
518:
509:
495:
491:
481:
479:
467:
451:
425:
421:
411:
392:
357:
348:
344:
329:
321:
312:
308:
304:
299:
295:
293:
211:
2143:Mating pool
1893:Main Topics
1822:, a journal
1451:(1): 7–40.
506:Replication
324:Alan Turing
2181:Categories
1930:Algorithms
1426:2021-05-20
1333:2018-05-20
1309:2018-05-20
1285:2018-05-20
1261:2018-05-20
1234:2018-05-20
1210:2018-05-20
1186:2018-05-20
1162:2018-05-20
1138:2018-05-20
1114:2018-05-20
1090:2018-05-20
1061:2018-05-20
1002:2018-05-20
975:2018-05-20
951:2018-05-19
927:2018-05-19
903:2018-05-20
879:2021-05-20
855:2021-05-20
826:2018-05-19
792:2018-05-19
768:2018-05-19
744:2018-05-19
708:2018-05-19
684:2018-05-19
662:References
579:Doug Lenat
422:Discipulus
168:Chromosome
1787:cite book
1779:987011786
1602:1089-778X
1543:CiteSeerX
1492:CiteSeerX
1465:1389-2576
1038:1389-2576
577:in 1987.
488:Crossover
464:Selection
340:John Koza
198:Selection
178:Crossover
2158:Journals
1846:" (2008)
1633:. p. 19.
1627:Archived
1610:10391383
1524:11954638
1351:Archived
849:Archived
612:(CMA-ES)
594:See also
515:Mutation
405:; other
183:Mutation
43:a series
41:Part of
1686:3258264
1646:. 2007.
1473:5584377
583:Eurisko
454:introns
367:Methods
318:History
251:Eurisko
1777:
1767:
1684:
1674:
1608:
1600:
1563:
1545:
1522:
1512:
1494:
1471:
1463:
1036:
246:Schema
45:on the
1682:S2CID
1606:S2CID
1520:S2CID
1469:S2CID
806:Ph.D.
558:GECCO
440:uses
428:uses
31:, or
1797:link
1793:link
1775:OCLC
1765:ISBN
1672:ISBN
1598:ISSN
1561:ISBN
1510:ISBN
1461:ISSN
1254:IEEE
1034:ISSN
403:Lisp
332:Lisp
1713:doi
1664:doi
1590:doi
1553:doi
1502:doi
1453:doi
1026:doi
581:'s
426:ÎĽGP
2183::
1789:}}
1785:{{
1773:.
1709:11
1707:.
1703:.
1680:.
1670:.
1604:.
1596:.
1584:.
1559:.
1551:.
1518:.
1508:.
1500:.
1467:.
1459:.
1447:.
1435:^
1419:.
1326:.
1302:.
1278:.
1251:.
1227:.
1203:.
1179:.
1155:.
1131:.
1107:.
1083:.
1070:^
1054:.
1032:.
1020:.
995:.
984:^
968:.
944:.
920:.
896:.
872:.
847:.
843:.
819:.
785:.
761:.
737:.
701:.
677:.
552:,
436:.
300:GP
27:,
23:,
1878:e
1871:t
1864:v
1799:)
1781:.
1749:.
1735:.
1721:.
1715::
1688:.
1666::
1612:.
1592::
1586:5
1569:.
1555::
1526:.
1504::
1475:.
1455::
1449:3
1429:.
1405:.
1387:(
1357:.
1336:.
1312:.
1288:.
1264:.
1237:.
1213:.
1189:.
1165:.
1141:.
1117:.
1093:.
1064:.
1040:.
1028::
1022:1
1005:.
978:.
954:.
930:.
906:.
882:.
858:.
829:.
795:.
771:.
747:.
711:.
687:.
482:n
298:(
283:e
276:t
269:v
35:.
Text is available under the Creative Commons Attribution-ShareAlike License. Additional terms may apply.