%0 Journal Article %1 Grosman:2004:CCE %A Grosman, Benyamin %A Lewin, Daniel R. %D 2004 %J Computers & Chemical Engineering %K algorithms, genetic programming %N 12 %P 2779--2790 %R doi:10.1016/j.compchemeng.2004.09.001 %T Adaptive genetic programming for steady-state process modeling %U http://www.sciencedirect.com/science/article/B6TFT-4DMW22F-1/2/3e0d065d49ca47901dac832951154da0 %V 28 %X Genetic programming is one of the computer algorithms in the family of evolutionary-computational methods, which have been shown to provide reliable solutions to complex optimisation problems. The genetic programming under discussion in this work relies on tree-like building blocks, and thus supports process modelling with varying structure. This paper, which describes an improved GP to facilitate the generation of steady-state nonlinear empirical models for process analysis and optimization, is an evolution of several works in the field. The key feature of the method is its ability to adjust the complexity of the required model to accurately predict the true process behaviour. The improved GP code incorporates a novel fitness calculation, the optimal creation of new generations, and parameter allocation. The advantages of these modifications are tested against the more commonly used approaches.

@article{Grosman:2004:CCE, abstract = {Genetic programming is one of the computer algorithms in the family of evolutionary-computational methods, which have been shown to provide reliable solutions to complex optimisation problems. The genetic programming under discussion in this work relies on tree-like building blocks, and thus supports process modelling with varying structure. This paper, which describes an improved GP to facilitate the generation of steady-state nonlinear empirical models for process analysis and optimization, is an evolution of several works in the field. The key feature of the method is its ability to adjust the complexity of the required model to accurately predict the true process behaviour. The improved GP code incorporates a novel fitness calculation, the optimal creation of new generations, and parameter allocation. The advantages of these modifications are tested against the more commonly used approaches.}, added-at = {2008-06-19T17:35:00.000+0200}, author = {Grosman, Benyamin and Lewin, Daniel R.}, biburl = {https://www.bibsonomy.org/bibtex/2eefca819289ea0eebaa9ebbaccd06d10/brazovayeye}, doi = {doi:10.1016/j.compchemeng.2004.09.001}, interhash = {607a1e5431778ec41bd8d4e452438b19}, intrahash = {eefca819289ea0eebaa9ebbaccd06d10}, journal = {Computers \& Chemical Engineering}, keywords = {algorithms, genetic programming}, month = {15 November}, number = 12, owner = {wlangdon}, pages = {2779--2790}, timestamp = {2008-06-19T17:40:41.000+0200}, title = {Adaptive genetic programming for steady-state process modeling}, url = {http://www.sciencedirect.com/science/article/B6TFT-4DMW22F-1/2/3e0d065d49ca47901dac832951154da0}, volume = 28, year = 2004 }