Genetic programming algorithms

Eberhart2 is one of the few recent introductions to that field, but also covers genetic algorithms and genetic programming by way of setting the scene. 

New methods of variable selection include evolutionary methods based on Darwinian principles including Genetic Algorithms and Genetic Programming... 

Keywords Combinatorial library design Quantitative structure - activity relationships Evolutionary algorithms Genetic algorithms Genetic programming... 

All of the nonlinear programming algorithms can suffer from the convergence and local optima problems described in Section 1.9.7. Probabilistic methods such as simulated annealing and genetic algorithms can be used if it is suspected that the feasible region is nonconvex or multiple local optima are present. 

The algorithm G-REX uses crossover and mutation (see Figure 14.6), and the extraction strategy is based on genetic programming [106-109]. 

The example described here employs genetic programming (GP) (see further description of the method in Section 14.3.2.2) and the genetic rule extraction (G-REX) algorithm [54, 55]. 

In class 1 type problems, the description of environment and specification is complete and the problem is completely described. However, in most cases, there are too many candidates of feasible solutions due to combinatorial explosion. Eor this type of problems, evolutionary computation methods, such as genetic algorithms, genetic programming, evolutionary strategies, and evolutionary programming, have been successfully applied. 

Briefly explain how genetic algorithms and genetic programming-based models can be apphed in drag design efforts. 

---