A Survey of Genetic Programming and Its Applications

被引:55
作者
Ahvanooey, Milad Taleby [1 ]
Li, Qianmu [1 ,2 ]
Wu, Ming [1 ]
Wang, Shuo [1 ]
机构
[1] Nanjing Univ Sci & Technol, Sch Comp Sci & Engn, POB 210094, Nanjing 210094, Jiangsu, Peoples R China
[2] Wuyi Univ, Intelligent Mfg Dept, POB 529020, Jiangmen, Peoples R China
关键词
Automatic Programming; Genetic Programming; Genetic Algorithm; Genetic Operators; ALGORITHMS; OPTIMIZATION;
D O I
10.3837/tiis.2019.04.002
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Genetic Programming (GP) is an intelligence technique whereby computer programs are encoded as a set of genes which are evolved utilizing a Genetic Algorithm (GA). In other words, the GP employs novel optimization techniques to modify computer programs; imitating the way humans develop programs by progressively re-writing them for solving problems automatically. Trial programs are frequently altered in the search for obtaining superior solutions due to the base is GA. These are evolutionary search techniques inspired by biological evolution such as mutation, reproduction, natural selection, recombination, and survival of the fittest. The power of GAs is being represented by an advancing range of applications; vector processing, quantum computing, VLSI circuit layout, and so on. But one of the most significant uses of GAs is the automatic generation of programs. Technically, the GP solves problems automatically without having to tell the computer specifically how to process it. To meet this requirement, the GP utilizes GAs to a "population" of trial programs, traditionally encoded in memory as tree-structures. Trial programs are estimated using a "fitness function" and the suited solutions picked for re-evaluation and modification such that this sequence is replicated until a "correct" program is generated. GP has represented its power by modifying a simple program for categorizing news stories, executing optical character recognition, medical signal filters, and for target identification, etc. This paper reviews existing literature regarding the GPs and their applications in different scientific fields and aims to provide an easy understanding of various types of GPs for beginners.
引用
收藏
页码:1765 / 1794
页数:30
相关论文
共 111 条
[1]   Recursion in tree-based genetic programming [J].
Agapitos, Alexandros ;
O'Neill, Michael ;
Kattan, Ahmed ;
Lucas, Simon M. .
GENETIC PROGRAMMING AND EVOLVABLE MACHINES, 2017, 18 (02) :149-183
[2]   A genetic algorithm for fitting Lorentzian line shapes in Mossbauer spectra [J].
Ahonen, H ;
deSouza, PA ;
Garg, VK .
NUCLEAR INSTRUMENTS & METHODS IN PHYSICS RESEARCH SECTION B-BEAM INTERACTIONS WITH MATERIALS AND ATOMS, 1997, 124 (04) :633-638
[3]  
Alba Enrique, 1999, Complexity, V4, P31, DOI 10.1002/(SICI)1099-0526(199903/04)4:4<31::AID-CPLX5>3.0.CO
[4]  
2-4
[5]  
[Anonymous], COMPUTERS IND ENG
[6]  
[Anonymous], 2009, P 11 ANN C COMP GEN, DOI 10.1007/978-3-642-17310-3_2
[7]  
[Anonymous], THESIS
[8]  
[Anonymous], EVOLUTIONARY COMPUTA
[9]  
[Anonymous], GENETIC EVOLUTIONARY
[10]  
[Anonymous], EVOLUTIONARY COMPUTA