Handbook of Genetic Programming Applications 2015
DOI: 10.1007/978-3-319-20883-1_5
|View full text |Cite
|
Sign up to set email alerts
|

Genetic Programming Applications in Chemical Sciences and Engineering

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
4
1

Citation Types

0
8
0

Year Published

2015
2015
2024
2024

Publication Types

Select...
6
1
1
1

Relationship

1
8

Authors

Journals

citations
Cited by 18 publications
(8 citation statements)
references
References 118 publications
0
8
0
Order By: Relevance
“…There have been many reports in recent years exploiting the potential of GP for system identification, particularly in chemical engineering applications [20]. In order to assess the suitability of GP for nonlinear dynamic system identification, one-step-head (OSA) prediction of a well-known benchmark chemical pro-cess, the Eaton-Rawlings reactor model, was investigated.…”
Section: Identification Of the Eaton-rawlings Reactormentioning
confidence: 99%
“…There have been many reports in recent years exploiting the potential of GP for system identification, particularly in chemical engineering applications [20]. In order to assess the suitability of GP for nonlinear dynamic system identification, one-step-head (OSA) prediction of a well-known benchmark chemical pro-cess, the Eaton-Rawlings reactor model, was investigated.…”
Section: Identification Of the Eaton-rawlings Reactormentioning
confidence: 99%
“…Among these methods, the GEP technique is an efcient approach that exhibits the capability to estimate complex as well as highly nonlinear problems [2,54,55]. Moreover, there exist certain drawbacks to applying the GEP, including the fact that (a) it is computationally complex, (b) the generated solutions may be overft, and (c) the GEP modelling requires additional complex heuristics to achieve optimal results [56]. Terefore, multiexpression programming (MEP) has been applied here alongside the GEP approach to compute the P s -ES in the current study to compare the two genetic programming approaches.…”
Section: Introductionmentioning
confidence: 99%
“…When the stopping condition (the maximum number of generations or a satisfactory solution) is reached, the whole process is finished [ 66 ]. If the termination conditions for achieving the optimum iteration or the favorite fitness value are not satisfied, then the Roulette wheel procedure is used, which chooses the viable chromosomes of the first generation and moves them on to the next generation [ 67 ]. This method will be repeated for a certain number of generations or before the right solution is found [ 68 ].…”
Section: Introductionmentioning
confidence: 99%