Adaptive genetic programming for steady-state process modeling

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 optimization problems. The genetic programming under discussion in this work relies on tree-like building blocks, and thus support...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Computers & chemical engineering 2004-11, Vol.28 (12), p.2779-2790
Hauptverfasser: Grosman, Benyamin, Lewin, Daniel R.
Format: Artikel
Sprache:eng
Schlagworte:
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung: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 optimization problems. The genetic programming under discussion in this work relies on tree-like building blocks, and thus supports process modeling 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 behavior. 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.
ISSN:0098-1354
1873-4375
DOI:10.1016/j.compchemeng.2004.09.001