Corso di Dottorato: Ottimizzazione Strutturale Parte C - Franco Bontempi

1Ottimizzazione Strutturale
franco.bontempi@uniroma1.it
1
Introduzione alla
OTTIMIZZAZIONE STRUTTURALE
(parte C)
Franco Bontempi
Ordinario di Tecnica delle Costruzioni
Facolta’ di Ingegneria Civile e Industriale
Sapienza Universita’ di Roma

3
Object of the course
• Introduction of basic and advanced ideas
and aspects of structural design without to
much stress on the analytical apparatus
but with some insigth on the computational
techniques.

Ottimizzazione Strutturale
4
5TECHNIQUES

5
FEW OBSERVATIONS

7
STRUCTURAL
QUALITY
- design life
- railway
runability
- highway
runability
- free channel
- robustness
- durability
- management
GLOBAL
GEOMETRY
AND
TOPOLOGY
TOPOLOGY
- suspension system
- towers
- towers foundation
- anchor system
- main deck
- deck landing
- ...
GLOBAL GEOMETRY
- main span
- sx span
- dx span
SECTIONAL GEOMETRY
- continuous girder sections
- transverse section
- main cables
- hangers
- towers
- secondary elements
MATERIALS
CHARACTERISTICS
- girders
- cables
SYNTHESIS OF
STRUCTURAL
SOLUTION
AND
DOCUMENTATION
BOUNDARY
CONDITIONS
CONSTRAINTS:
rigid and elastic
constraints,
imposed
displacements
NATURAL
ACTIONS
- temperature
- wind
- earthquake
ANTROPIC
ACTIONS
a) permanent
loading
system
b) variable
- railway
- highway
c) accidental
CONVENTIONALMODELING:
QUASISTATICREPRESENTATION
BASIC STRUCTURAL
CONFIGURATION
PARAMETERS
- individuation
- definition
- uncertainty
- description
- bounding
GLOBAL
MODELING
- 2D
- 3D
MODELING WITH
DYNAMIC INTERACTION
ALTERNATIVE STRUCTURAL
CONFIGURATIONS
GLOBAL
OPTIMIZATION
- topology
- morphology
- parametric
LOCAL
OPTIMIZATION
- girders section
- transverse
section
- restraint zone
EXPERT AND
FIXED CHOICES
MEASURES
a) qualitative
b) materials volumes
c) serviceability
- modal characteristics
- deflections
- deformations
- reversibility
d) collapse scenarios
- collapse characteristics
- robustness
e) accidental scenarios
- configurations
- risks
DETAILED
MODELING
EXTENDED
MODELING
1
2 3
4
5
6
7
Numerical Modeling for the
Structural Analysis and Design of
MESSINA STRAIT BRIDGE:
subdivision and development of activities.
FB - june 6, 2005 / franco.bontempi@uniroma1.it
7

The function: y(x1,x2)
8

The sensibility of the function
9

10
STRATEGY #1: SENSITIVITY
governance of priorities

The boundings of the function
11

12
STRATEGY #2: BOUNDING
behavior governance
p
(p)

p
(p)


13
Super
Controllore
Problema Risultato
Solutore #1
Solutore #2
Voting System
STRATEGY #3: REDUNDANCY

14
STRUCTURAL
MODELING
CODE
Global Frame Models Local Models
Frame
Work
Substruct-
ured Models
STRUCTURAL
MODELING
CODE
Global Frame Models Local Models
Frame
Work
Substruct-
ured Models
structural configurations
specificity of the modeling
commercial
codes

15

Design of Experiments (DOE)
• In general usage, design of experiments (DOE) or
experimental design is the design of any information-
gathering exercises where variation is present, whether under
the full control of the experimenter or not. However, in
statistics, these terms are usually used for controlled
experiments.
• Formal planned experimentation is often used in evaluating
physical objects, chemical formulations, structures,
components, and materials. Other types of study, and their
design, are discussed in the articles on computer
experiments, opinion polls and statistical surveys (which are
types of observational study), natural experiments and quasi-
experiments (for example, quasi-experimental design).
16

Sampling Points (1)
17

Sampling Points (2)
18

Simulation & Approximation
of the response (≈ surrogate)
19

20

The nature of optimum (1)
21

The nature of optimum (2)
22
A sub-optimal solution
to a problem is one
that is less than perfect.
Slack situation: loose and not pulled tight.

Example (1)
23

Example (2)
24

25
OPTIMIZATION METHODS
Heuristics
Nelder – Mead
Genetic Algorithm

Bounded Rationality
Bounded rationality is the idea that in decision-making, rationality
of individuals is limited by the information they have, the
cognitive limitations of their minds, and the finite amount of time
they have to make a decision. It was proposed by Herbert A.
Simon as an alternative basis for the mathematical modeling of
decision making, as used in economics, political science and
related disciplines; it complements rationality as optimization,
which views decision-making as a fully rational process of finding
an optimal choice given the information available. Another way to
look at bounded rationality is that, because decision-makers lack
the ability and resources to arrive at the optimal solution, they
instead apply their rationality only after having greatly simplified
the choices available. Thus the decision-maker is a satisfier, one
seeking a satisfactory solution rather than the optimal one.
26

Model Extensions
• Ariel Rubinstein proposed to model bounded rationality by
explicitly specifying decision-making procedures..
• Gerd Gigerenzer opines that decision theorists have not really
adhered to Simon's original ideas and proposes and shows
that simple heuristics often lead to better decisions than
theoretically optimal procedures.
• Huw Dixon later argues that it may not be necessary to
analyze in detail the process of reasoning underlying bounded
rationality. If we believe that agents will choose an action that
gets them "close" to the optimum, then we can use the notion
of epsilon-optimization, that means you choose your actions
so that the payoff is within epsilon of the optimum. The notion
of strict rationality is then a special case (ε=0).
27

εὑρίσκω
• Heuristic (/hjʉˈrɪstɨk/; Greek:
"Εὑρίσκω", "find" or "discover") refers
to experience-based techniques for
problem solving, learning, and
discovery that give a solution which is
not guaranteed to be optimal. Where
the exhaustive search is impractical,
heuristic methods are used to speed
up the process of finding a satisfactory
solution via mental shortcuts to ease
the cognitive load of making a
decision. Examples of this method
include using a rule of thumb, an
educated guess, an intuitive judgment,
stereotyping, or common sense.
• In more precise terms, heuristics are
strategies using readily accessible,
though loosely applicable, information
to control problem solving in human
beings and machines.
• L'euristica (dalla lingua greca εὑρίσκω,
letteralmente "scopro" o "trovo") è una
parte dell'epistemologia e del metodo
scientifico.
• Si definisce procedimento euristico, un
metodo di approccio alla soluzione dei
problemi che non segue un chiaro
percorso, ma che si affida all'intuito e
allo stato temporaneo delle
circostanze, al fine di generare nuova
conoscenza. È opposto al
procedimento algoritmico. In
particolare, l'euristica di una teoria
dovrebbe indicare le strade e le
possibilità da approfondire nel
tentativo di rendere una teoria
progressiva.

30
1

Simulated Annealing (Metropolis)
• Simulated annealing (SA) is a generic probabilistic heuristic for the
global optimization problem of locating a good approximation to the
global optimum of a given function in a large search space.
• The name and inspiration come from annealing in metallurgy, a
technique involving heating and controlled cooling of a material to
increase the size of its crystals and reduce their defects.
• This notion of slow cooling is implemented in the Simulated
Annealing algorithm as a slow decrease in the probability of
accepting worse solutions as it explores the solution space.
Accepting worse solutions is a fundamental property of heuristics
because it allows for a more extensive search for the optimum.
• The method is an adaptation of the Metropolis-Hastings algorithm, a
Monte Carlo method to generate sample states of a thermodynamic
system, invented by M.N. Rosenbluth and published in a paper by
N. Metropolis et al. in 1953.

32

33
Basic version (1)

36

37

Points for SA
• Diameter of the search graph
• Transition probabilities
• Acceptance probabilities
• Efficient candidate generation
• Barrier avoidance
• Cooling schedule
38

39
2

Nelder-Mead Method (Amoeba)
• The Nelder–Mead method or downhill simplex
method or amoeba method is a commonly used
nonlinear optimization technique, which is a
well-defined numerical method for problems for
which derivatives may not be known.
• The Nelder–Mead technique is a heuristic
search method that was proposed by John
Nelder & Roger Mead (1965) for minimizing an
objective function in a many-dimensional space.

41

47

Genetic Algorithm (GA)
• The original motivation for the GA approach was a biological
analogy. In the selective breeding of plants or animals, for example,
offspring are sought that have certain desirable characteristics,
characteristics that are determined at the genetic level by the way
the parents’ chromosomes combine. In the case of GAs, a
population of strings is used, i.e. chromosomes.
• The recombination of strings is carried out using analogies of
genetic crossover and mutation, and the search is guided by the
results of evaluating the objective function f for each string in the
population.
• Based on this evaluation, strings that have higher fitness (i.e.,
represent better solutions) can be identified, and these are given
more opportunity to breed.

Terminology
49

50

Coding
• One of the distinctive features of the GA approach is to
allow the separation of the representation of the problem
from the actual variables in which it was originally
formulated. In line with biological usage of the terms, it
has become customary to distinguish the ‘genotype’—
the encoded representation of the variables, from the
‘phenotype’—the set of variables themselves.
52

Genotype space = {0,1}L
(mappa)
Phenotype space
(territorio)
Encoding
(representation)
Decoding
(inverse representation)
01101001
01001001
10010010
10010001
Translation

Example
54

Mating, Mutation, Selection
56

One or Two
57

EXCEL
58

6USES
59

60
OPTIMIZATION OF HCS

61

Precast hollow core slabs (HCS)
62

Tensile crack phenomena in HCS
(splitting, bursting, spalling).
• splitting cracks: caused by stresses resulting from
the development of prestressing in the anchorage
zone, that may generate traction stresses in the
concrete.
• bursting cracks: a local effect, generated by the
strand slippage into the slab end while the former
widens slightly on being cut.
• spalling cracks: occurring above the axis of the
strands in the HCS end zone, caused also by the
development of prestressing in the concrete at the
slab ends where only the lower part holding the
strands begins to be prestressed.Ottimizzazione Strutturale
63

Tensile crack phenomena in HCS
(splitting, bursting, spalling).
64

65

Cross-section of the reference HCS
and numerical model
66

Tensile deformations in the vertical
directions for the spalling effect
67

The binary coding of the geometry
characteristics of the section
68

• The fitness function F includes terms to represent
the weight of the slab.
• First, functions gi(x), represents the geometry
constraints, implicitly satisfied during the definition of
the variable space.
• Functions hi(x) represent the structural safety
constraints. In this study, two checks are carried out:
1. the first one on the bending stress, carried out after the
initial structural analyses on the meso-scale model.
2. the second one, on the spalling stress, carried out on the
micro-scale model.
• If both checks are positive, the individual is fitting the
constrain conditions, otherwise, it is discarded and a
different element is introduced in the population.
69

70

71

Original values values obtained
after the optimization process
72

73
OPTIMIZATION OF S&T

95
OPTIMIZATION AS A TOOL
FOR EXPLORATION

a
96

Limit States
Service Limit States Ultimate Limit States

Elements of nonlinear formulation

b
128

Uses of genetic algorithm
• To perform the stochastic exploration of
the load space;
• To handle the uncertainties related to the
definition of the loads;
• To investigate the global behavior of the
structure by means of the definition of the
envelope diagram of the performances;
• To define the worst load combination;
• To scrutinize the exact value of a specific
performance.
129

130

Dissipation devices
Soil behavior
Material
Soil-Structure interface Contact
Support system
Pylon
Cable system
Geometrical
Soil-Structure
Response
Vehicle-StructureWind-Structure
Nonlinearities
Interactions
Action
Uncertainties
131

132

Dependability attributes threats,
means and their interactions.
133

Performance in relation to the
return periods of the actions.
134

S N
Geometry of the long-span
suspension bridge considered.
135

The design variables and
the performance levels
136

A genetic algorithm approach for
performance assessment
• The performance of a long-span suspension bridge is
investigated by means of a GA approach.
• Focus is given to three aspects of the structural behavior of
the bridge:
1) maximum vertical displacement;
2) maximum longitudinal and transversal slope;
3) maximum tension in main cable and in the tower legs.
• The load scenarios that lead to the most severe performance
metrics are explored in the space of the load variables by an
optimization process based on GA’s.
• The implementation of a GA based optimization is essential
since the traditional optimization techniques are rather
ineffective, due to the high number of dimensions of the load
variables space and the presence of numerous local optimum
points.
137

Loading systems considered in the
genetic algorithm analysis.
138

Remarks on loading system
• Traffic and train loads are directed vertically but the
possibility to have a longitudinal component due to the
acceleration (A) or the deceleration (D) is also taken into
account.
• In addition, a torque is present if the traffic loads are not
positioned on the axis of the respective box girder
section.
• The wind action, assumed always present and flowing
transversally to the longitudinal axis of the bridge,
produces lift, drag and torque.
• In order to represent analytically the entire loading
system, 16 variables are needed.
• Since each of the girders is formed by 123 finite
elements, the position of the loads will be defined by
integer variables, ranging, in general, from 0 to 123.
139

Variables considered for the
definition of the loading system.
140

Description of loading system
141

Binary coding
• The position variables are implemented in binary
code with a dimension of eight bits (the minimum
dimension able to represent the position of the
loads on the bridge deck):
• In this row vector, x1 defines the position of the
train on the bridge deck, in binary code: for
example, if the train load starts from the fifteenth
element on the deck, the variable x1 is:
142

Population
• The GA starts by considering an initial population of N
row vector x created assigning random values to the
unknown variables; each row of the matrix X represents
the chromosome of one solution:
143

Target functions
• In order to evaluate the performance of the bridge, the
following six target functions are considered:
1. the vertical displacement (negative) for the bridge deck;
2. the horizontal displacement (positive) for the bridge
deck;
3. the longitudinal slope for the bridge deck;
4. the transversal slope for the bridge deck;
5. the axial tension for the main cables;
6. the stress state induced by the axial action and the two
bending moments for the bridge tower legs.
• Each performance is measured by the peak value over
all nodes of the bridge deck.
144

Evolution of population
• For each target function, the genetic algorithm
creates new populations of N row vector x in order
to find the worse configurations of the considered
loads.
• The genetic algorithm works by evaluating the target
function in correspondence with each assumed
vector x.
• If the population contains a N number of x vectors,
the best N/2 vectors are saved in a new population
while the other vectors are erased.
• To complete the new population, additional N/2
vectors are formed from the saved vectors using the
genetic operator of mutation and crossover.
145

Mutation
• The mutation on the generic vector i of the
population n changes a single bit of a
randomly selected chromosome; for example
provides the change from 1 to 0:
• As a result a new vector k is obtained for the
population n+1.
146

Crossover
• The crossover on the generic vectors i and j of
population n is provided in this example:
• where a group of cells of chromosomes i and j is
selected and the respective states changed.
• As a result there are two new vectors k and l for the
population n+1. Ottimizzazione Strutturale
147

Remarks
• When N/2 new vectors are created, the genetic algorithm
restarts with the evaluation of the target function for each
vector xn+1.
• It should be observed that a genetic algorithm is a
stochastic evolutionary procedure because the operators
of mutation and crossover are not deterministic but there
is a probability of occurrence for each operator.
• Usually the probability of occurrence of the mutation
operator is low (0 – 5%) while the probability of
occurrence of the crossover operator is high (70 – 90%).
• What makes this procedure attractive is the fact that
usually there is a large interdependence between the
quality of results and of the choice of these parameters.
148

149

• The FE model consists of 1614 elements (beams, no
compression cable elements and gaps) and 1140 nodes.
• For each of the six previously chosen performance
metrics (target functions), GA analysis is performed with
an initial randomly chosen population of 100
chromosomes. For each chromosome the structural
analysis, accounting for geometrical and material
nonlinearities, is developed using ADINA, starting each
time from the reference configurations under permanent
loads and adding the traffic and wind loads.
• The custom software reads the output evaluation and
performs the genetic recombination of the chromosomes
to get a new generation of chromosomes: 100 cycles of
regeneration are considered for a total of 10000 different
load scenarios, each of them leading to a nonlinear
structural analysis.
• The probability of occurrence of the crossover operator
is of 80% while the probability of occurrence of the
mutation operator is of 2%.
150

151

Remarks
• It is clear that the convergence of the variables that
define the train position (A) is better than the one that
defines the position of the light traffic load (B).
• From a design point of view, it means that the influence
of the railway load in defining the vertical displacement is
much higher than the traffic load.
• In addition, it can be observed that the railway loads
converge towards two different edges (North and South).
This is due to the fact that the geometry of the bridge is
almost symmetrical.
152

Vertical displacement envelope
153

Transversal slope envelope
154

Longitudinal slope envelope
155

156

Comparative importance
of the loads.
157

7FEW MORE THEORETICAL ASPECTS OF DESIGN
158

INDEX
• Knowledge
• Limits
• Scale effects
• Ergonomy
• People
159

160
KNOWLEDGE

CONOSCENZA
RICHIESTA
DA UN PROGETTO
EVOLUTIVO
CONOSCENZA
RICHESTA
DA UN PROGETTO
INNOVATIVO
BASE DI
CONOSCENZA
ATTUALE
La crescita di conoscenze
161

Evolutive vs Innovative Design

Knowledge Growth Process
KNOWLEDGE
REQUIRED
BY AN EVOLUTIVE
DESIGN
NEW KNOWLEDGE
REQUIRED BY
AN INNOVATIVE
DESIGN
ACTUAL
KNOWLEDGE BASIS

164

165

166

167
STRUTTURECON
COMPORTAMENTOPERFORMA

168
STRUTTURECON
COMPORTAMENTOVETTORIALE

169
STRUTTURECON
COMPORTAMENTOSEZIONALE

170
STRUTTURECON
COMPORTAMENTODISUPERFICIE

Evolutive Jump
171

172

174

175

176

Horizons
177

Ships
178

Failure due to unexpected facts
179

Causes of system failure
100%
Time
%offailure
Unknown phenomena
Known phenomena
Research
level
Design code
level
past present future
A
BB B
C
Humanerrors
180

181
LIMITS

182

LIMITS
183

LIMITS
184

LIMITS
185

LIMITS
186

187

188

Reaching limits
189

190

S Curve
191

Dalian, June 2008 193
0
500
1000
1500
2000
2500
3000
3500
SPAN 1100 1298 1385 1410 1624 1991 3300
BISA
N-
VER
RAZZ
JIAN
GYN
HUM
BER
GRE
AT
AKA
SHI
MES
SINA

Lorenz
196

Mental Heritage
197

Bias
198

Hybrid Solution
199

200

201

202

203
SCALE EFFECTS

204

SCALEEFFECTS
205

Quebec Bridge
206

Quebec Bridge Failure
207

Chord Members
208

2nd Quebec Bridge
209

Dalian, June 2008 210
GLOBAL LEVEL
3300 m
Local level
200 m
Example: Size Effect

211
ERGONOMY

212

213

214

Interactions
215

216

217

218

Ciclodivita
219

220
PEOPLE

VALUES

222

Nonaka-Takeuchi Concept
223

Nonaka & Takeuchi:
conoscenza esplicite e implicite
224

225

226

227

228

229

230

231

232

233
Str
o N
GER
www.stronger2012.com

Corso di Dottorato: Ottimizzazione Strutturale Parte C - Franco Bontempi

Recomendados

Recomendados

Más contenido relacionado

Destacado

Destacado (20)

Similar a Corso di Dottorato: Ottimizzazione Strutturale Parte C - Franco Bontempi

Similar a Corso di Dottorato: Ottimizzazione Strutturale Parte C - Franco Bontempi (20)

Más de Franco Bontempi Org Didattica

Más de Franco Bontempi Org Didattica (20)

Último

Último (20)

Corso di Dottorato: Ottimizzazione Strutturale Parte C - Franco Bontempi