• Aucun résultat trouvé

Review of approximation techniques Introduction Contents

N/A
N/A
Protected

Academic year: 2022

Partager "Review of approximation techniques Introduction Contents"

Copied!
4
0
0

Texte intégral

(1)

Contents

CHAPTER 1.

Introduction

...1

1.1 Design optimization ...1

1.2 The problem...3

1.3 Genetic programming methodology...4

1.4 Structure of the thesis ...5

CHAPTER 2.

Review of approximation techniques

...7

2.1 Introduction ...7

2.2 Local approximations ...8

2.3 Global approximations ...10

2.3.1 Response surface methodology ...10

2.3.2 Design and analysis of computer experiments (DACE)...10

2.3.3 Neural network ...12

2.3.4 Genetic programming...12

2.4 Mid-range approximations ...12

2.5 Conclusion...14

(2)

Contents iii

CHAPTER 3.

Response surface methodology

...15

3.1 Introduction ...15

3.2 Approximate model function...17

3.3 Design of experiments...19

3.3.1 Full factorial design ...20

3.3.2 Central composite design ...22

3.3.3 D-optimal designs...23

3.3.4 Taguchi's contribution to experimental design...24

3.3.5 Latin hypercube design...25

3.3.6 Audze-Eglais' approach ...25

3.3.7 Van Keulen's approach ...28

3.4 Conclusion...29

CHAPTER 4.

Genetic programming methodology

...30

4.1 Introduction ...30

4.2 Genetic algorithms...32

4.2.1 The representation scheme ...35

4.2.2 Fitness...36

4.2.3 Selection scheme ...38

4.2.4 Crossover...40

4.2.5 Mutation ...42

4.2.6 Mathematical foundation...43

4.2.7 Implementation of the GA...44

4.3 Genetic Programming...47

4.3.1 Representation scheme ...49

4.3.2 Genetic operators...52

4.3.3 Fitness function ...54

4.3.4 Allocation of tuning parameters ...56

4.3.5 Tuning of an approximation function...59

4.3.6 Implementation of GP ...60

(3)

Contents iv

4.4 Conclusion...64

CHAPTER 5.

Applications to problems with numerically simulated response

...65

5.1 Introduction ...65

5.2 Role of the number of experiments ...66

5.3 Three-bar truss...68

5.4 Rosenbrock's function and the use of sensitivity information...69

5.4.1 Approximation without sensitivity information ...70

5.4.2 Approximation with sensitivity information ...71

5.5 Recognition of damage in steel structures...72

5.5.1 Introduction ...72

5.5.2 Identification problem formulation ...72

5.5.3 Experimental results ...74

5.5.4 Results of damage recognition ...75

5.6 Conclusion...83

CHAPTER 6.

Applications to problems with experimental response

...84

6.1 Introduction ...84

6.2 Approximation of design charts for software development ...85

6.2.1 Introduction ...85

6.2.2 Experiments...86

6.2.3 GP response ...86

6.3 Prediction of the shear strength of reinforced concrete deep beams ...91

6.3.1 Introduction ...91

6.3.2 Training data...92

6.3.3 GP response ...95

6.3.4 Parametric study ...97

(4)

Contents v

6.4 Multicriteria optimization of the calcination of Roman cement ...100

6.4.1 Introduction ...100

6.4.2 Experimental work ...101

6.4.3 Results ...102

6.4.4 Multicriteria optimization...107

6.4.5 Pareto-optimal solution set ...109

6.4.6 Discussion of the results of the optimization ...110

6.5 Conclusion...112

CHAPTER 7.

Conclusions

...113

APPENDIX A.

Genetic programming output

...117

A.1 Recognition of damage in steel structures ...117

A.1.1 Approximation of the overall expression with 20 points ...117

A.1.2 Approximation of the overall expression with 50 points ...117

A.1.3 Approximation of the individual frequencies with 20 points ...118

A.1.4 Approximation of the individual frequencies with 50 points ...118

A.2 Multicriteria optimization of the calcination of Roman cement...119

A.2.1 Anhydrite ...119

A.2.2 Gehlenite...119

A.2.3 Larnite...120

A.2.4 Loss on calcination ...120

A.2.5 Silica ...120

A.2.6 Rate of strength enhancement...120

A.2.7 Setting...121

A.2.8 Strength at 1 week ...121

APPENDIX B.

Input data file for the GP algorithm

...122

References

...123

Références

Documents relatifs

In traditional computa- tional neuroscience, the generation of a cognitive theory typically follows the follow- ing steps: (1) a set of experiments are run and data on the

We use SEGP in combi- nation with varying selection mechanisms and evolvability metrics to ensure we can improve on the true fitness of standard genetic programming (SGP)..

In the state of the art, the weighted sum of scores (which is a linear classifier) and the use of an SVM (which is a non linear classifier) pro- vided by different biometric

A qualitative comparison between our evolved operators and the oscillations method is shown in Figure 7, where the Hölderian regularity is estimated for three of the test images,

In this article we present a new GP algorithm called Zoetrope Genetic Programming (ZGP), which brings the following main contributions: (1) a new and unseen rep- resentation of

Stack-based GP[7] employs the use of multiple different stacks so as to work with state and keep track of multiple values, which can be difficult for the traditional tree-based

The last type of nodes implements ensemble methods – there is a copy node and a k-means node, which divides the data into clusters by the k-means algorithm (both D → [D] n ), and

The learned rule was compared to the original rule with respect to the nodes and edges each rule added to the produced graphs.. True positive: node/edge is both added by the learned