2012
DOI: 10.1007/s00521-012-1144-6
|View full text |Cite
|
Sign up to set email alerts
|

Design equations for prediction of pressuremeter soil deformation moduli utilizing expression programming systems

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
4
1

Citation Types

0
34
0
3

Year Published

2015
2015
2024
2024

Publication Types

Select...
6
2

Relationship

0
8

Authors

Journals

citations
Cited by 87 publications
(37 citation statements)
references
References 31 publications
0
34
0
3
Order By: Relevance
“…As a result, the main components of GEP mathematical algorithms are control parameters, function set, fitness function, terminal set, and termination condition [35]. Those parse trees are known as expression trees (ETs) for the GEP algorithm [36]. Therefore, the GEP nature permits the evolution of more complex programs composed of several substructures or subprograms called GEP genes.…”
Section: Methodsmentioning
confidence: 99%
See 2 more Smart Citations
“…As a result, the main components of GEP mathematical algorithms are control parameters, function set, fitness function, terminal set, and termination condition [35]. Those parse trees are known as expression trees (ETs) for the GEP algorithm [36]. Therefore, the GEP nature permits the evolution of more complex programs composed of several substructures or subprograms called GEP genes.…”
Section: Methodsmentioning
confidence: 99%
“…Therefore, the GEP nature permits the evolution of more complex programs composed of several substructures or subprograms called GEP genes. Consequently, each GEP gene encompasses a list of symbols with a fixed length that can be any element from the terminal set such as {x, y, z, À2} and a function set such as {Â, /, +, À, sin} [36]. For instance, a two-gene chromosome can be made of four functions, Q, ⁄, /, and +, (Q expresses the square root function) and three terminals, a, b and c, together with its decoded ET and the corresponding mathematical expression.…”
Section: Methodsmentioning
confidence: 99%
See 1 more Smart Citation
“…1) [55]. The solutions derived by conventional GP are shown as tree structures [63]. However, there are other branches of GP that produce models in different shapes (see Fig.…”
Section: Methodsmentioning
confidence: 99%
“…Those parse trees are known as expression trees (ETs) for the GEP algorithm [20]. Hence, the nature of gene expression programming authorities the evolution of more complex programs composed of various substructures or subprograms so-called GEP genes.…”
Section: Gene Expression Programmingmentioning
confidence: 99%