Genetic programming: on the programming of computers by means of natural selection
Genetic programming: on the programming of computers by means of natural selection
Genetic programming: an introduction: on the automatic evolution of computer programs and its applications
Adaptive Selection Methods for Genetic Algorithms
Proceedings of the 1st International Conference on Genetic Algorithms
A Segregated Genetic Algorithm for Constrained Structural Optimization
Proceedings of the 6th International Conference on Genetic Algorithms
Effects of code growth and parsimony pressure on populations in genetic programming
Evolutionary Computation
Hi-index | 0.00 |
Using genetic programming (GP) integrated with nonlinear parameter estimation we can identify the model for avermectin process. In order to reduce the effect caused by bloating which appears when a GP run stagnates in the later period, a fitness function with a double penalty strategy is proposed. GP with this penalty strategy is less sensitive to the choice of penalty parameters and compromises the fitness and the complexity of an individual, so the method can save considerable amounts of computational effort and find models with better quality. In addition, we combine the mechanism knowledge of the fermentation in GP to increase the quality of population and the convergence speed. Experiments prove that this method outperforms standard GP in reducing computational effort and finding better models more quickly.