Beruflich Dokumente
Kultur Dokumente
mxy Ey
1m
xy
m
yx
0
myxEx
1mxy myx
Ey
1mxy myx
0
0 0 l
_
_
_
_
k
cos
2
h sin
2
h 2 cos h sin h
sin
2
h cos
2
h 2 cos h sin h
cos h sin h cos h sin h cos
2
h sin
2
h
_
_
_
_
k
where h represents the deviation angle between the current
lamina principal axis and laminate reference axis.
When ply orientations are restricted to a discrete set of
angles and the symmetry with respect to the z axis is
imposed, constitutive equations (2) are uncoupled about:
(i) bending, twisting and stretching (i.e. the B
ij
terms are
equal to zero); (ii) normal stress and shear in the middle
surface (i.e. A
13
= A
23
= 0; D
13
and D
23
negligible). These
conditions yield to the following three partial dierential
equations expressed in terms of generalised displacements,
referred to the local coordinate system represented in
Fig. 3:
A
11
u;
xx
A
12
v;
xy
A
33
u;
yy
v;
xy
0
A
12
u;
xy
A
22
v;
yy
A
33
u;
xy
v;
xx
0
D
11
w;
xxxx
2D
12
2D
33
w;
xxyy
D
22
w;
yyyy
N
x
w;
xx
N
y
w;
yy
2N
xy
w;
xy
0
5
Fig. 1. Typical lay-up for a ber-reinforced plate.
Ny
yx N
x N
Nxy
Nx
xy N
y N
Nyx
x M
Mxy
M
x
xy M
yx M
y M
My
Myx
x
y
z
Fig. 2. Generalised forces in equilibrium equations.
1720 L. Iuspa, E. Ruocco / Computers and Structures 86 (2008) 17181737
Eq. (5) do not allow a closed-form solution; however, using
a standard separation-of-variable technique, the system
can be reduced to a set of one-dimensional ordinary dier-
ential equations, suitable for analytical solution. Assuming
the following displacement eld:
ux; y UY sinX
vx; y V Y cosX X
xp
k
; Y
yp
k
wx; y W Y cosX
6
with k half-wavelength, N
y
= N
xy
= 0 and N
x
= N
L
(i.e.
uniaxial load), Eq. (5) can be rewritten in the following
form:
sinXA
33
U
00
A
11
N
L
U A
12
A
33
V
0
0
cos XA
22
V
00
A
33
N
L
V A
12
A
33
U 0
cos X D
22
W
0000
4D
12
2D
33
W
00
D
11
N
L
k
2
p
2
_ _
W
_ _
0
7
where for sake of brevity, primes denotes dierentiation
with respect to Y.
Relations (7) represent ordinary dierential equations in
the Y variable having the general solution:
UY k
1
cosh hY /k
2
cosh /Y
k
3
sinh hY /k
4
sinh /Y
V Y hk
1
sinh hY k
2
sinh /Y
hk
3
cosh hY k
4
cosh /Y
W Y k
5
sinh aY k
6
cosh aY k
7
sin bY k
8
cos bY
8
depending on the following parameters:
h 2A
33
A
21
A
11
2N
L
2A
33
A
12
A
22
1
2
/ A
12
A
11
2N
L
A
12
A
22
1
2
a k
1
k
2
1
k
2
1
2
_ _1
2
b k
2
1
k
2
1
2
k
1
_ _1
2
k
1
D
33
D
1
22
k
2
D
1
22
D
11
N
L
k
2
p
2
9
Coecients k
1
, . . . , k
8
are xed imposing boundary
conditions.
Using relations (8) as shape functions of the displace-
ment eld, the local stiness matrix of ber-reinforced
structures formed by plates rigidly connected at their edges,
can be dened in terms of four unknown displacement
magnitudes for each side j:
d
k
j
W W V U
k
j
j 1; 2 k 1; n plate 10
with W computed deriving the out-of-plane displacement
W reported in (8) respect to the Y variable (see Fig. 4).
Well-consolidated, FEM-derived routines can be then
used to assemble the overall stiness matrix. Finally, the
solution of the associated eigenproblem provides both the
smallest critical load and related normalized displacements.
Respect to the more usual nite strip method, this pro-
posed procedure adopts an exact solution as shape function
in Y direction rather than a polynomial expression, while
the same trigonometric approximation in X direction is
used. Simply supported boundary conditions along the
X-side result as consequence of the required approximation
in X direction.
The model is mesh-independent and a solution involving
a reduced number of degrees of freedom can be easily
dened. For stiened plates, the dimension of the system
is about four times only the number of stieners. In
Fig. 5, a comparison between standard nite strip method
FEM and the proposed semi-analytical method is shown in
terms of equivalent discretization for a typical stiened
plate.
x,u
x,u
x,u
x,u
z,w
z,w
z,w
z,w
y,v
y,v y,v
y,v
Fig. 3. Generalised displacements and local coordinate system.
L. Iuspa, E. Ruocco / Computers and Structures 86 (2008) 17181737 1721
Thin-wall structures with very complex and almost arbi-
trary cross-section shapes can be easily handled by this
method (see Fig. 6). On the other hand, the computational
eciency oered by this numerical approach can be advan-
tageously capitalized by an optimization procedure based
on genetic algorithms.
U
V
W
A
B
C
D
Fig. 5. (AD) Finite strip approach for a typical stiened plate; degree of freedoms (A), part decomposition (B) and discretization (C); equivalent F.E.M.
mesh for comparison (D).
W
V 0
x
y
z
U
1
2
1
1
1
1
1
1
1
1
W
V
U1
1
1
2
2
2
y x
0
z
2
2
W2
1
V
1
2
U
1
2
2
1
U
2
2
2
W
2
V2
2
Fig. 4. Unknown local displacement magnitudes.
1722 L. Iuspa, E. Ruocco / Computers and Structures 86 (2008) 17181737
3. Basic concepts in genetic algorithms
In the 1950s and 1960s several computer scientists inde-
pendently studied evolutionary systems with the idea that
simulated evolution of biologic entities could be used as
an optimization tool for engineering problems. In Gold-
bergs short history of evolutionary computation ([20],
chapter 4) the names of Box [21] and Friedman [22] are
associated with works containing the rudiments of evolu-
tion in various forms. All had some kind of selection of
the ttest, some had population-based schemes for selec-
tion and variation, and some others, like many GAs, had
binary strings as abstractions of biological chromosomes.
GAs, as we know them now, were early described in the
1960s and fully developed by Holland [23], where for the
rst time GAs were presented as abstraction of biological
evolution with main theoretical frameworks. In genetic
algorithms, a particular design (A) is represented by a set
of characteristics a
i
called phenotype and dened as real
or integer numbers (Fig. 7).
For each phenotype it is possible to obtain the genotype
encoding each a
i
into a particular alphabet (usually short as
a binary/Gray code). The transformation of the phenotype
structure into a string of bits leads to the so-called chromo-
somes that represent, like in natural systems, the total
genetic prescription for the construction and operation of
some organism.
A genetic algorithm operates on populations of strings
and progressively modies their genotypes to get the better
performance of their phenotype measured through a tness
function. The adaptation process is based on the mecha-
nism of natural selection and natural genetics. In genetic
based evolution simulations, phenotypes express the
parameter sets of alternative solutions to the problem. This
process is iterated over many time steps, each of them
called a generation. After several generations, the result is
a number of high-performance chromosomes in the
population.
4. Genetic algorithms implementation
Since the rst appearance in the late 60s, genetic algo-
rithms have been subject to many implementations and
variants due to their own nature of evolutionary simulation
Fig. 6. Examples of thin-walled structures with arbitrary cross-section shape.
a
4n+m+1 p
a
4n+1
a a
4n+m
a ...... a
1 n
a
n+1
a
2n
a
2n+1
a
4n
a
3n+1
.
.
.
a
3n
......
Fig. 7. Phenotype example in multi-layered plate design.
L. Iuspa, E. Ruocco / Computers and Structures 86 (2008) 17181737 1723
methods. Although simplied, a well-established classica-
tion subdivides binary coded genetic algorithms (bGAs) in
two main branches: explicit or implicit binary formulation.
The rst method is the simplest way to translate genetic
representation of an articial DNA into a computer data
structure using boolean arrays for the purpose. The second
approach codies genetic information directly at a
chromosomal level by means of integer arrays. The main
advantage of an implicit representation is an increased
computational eciency, as no binary-to-decimal conver-
sion and vice versa is required. On the other hand, some
algebraic manipulations involving integers must be applied
in order to perform crossover and mutation operators.
In the present work a special, bit-masking oriented ver-
sion of an implicit binary coded GA BMOGA was used.
This novel approach keeps the computational eciency
of an integer data structure adding some powerful features.
Without going into details, classical procedural genetic
operators are replaced by a unique synthetic operator
engine able to emulate all the traditional crossover and
mutation schemes, plus many others suggested by specic
requests, simply varying the arguments of a special boolean
function. This way complex procedural schemes as multi-
level crossovers operating in parallel on partitions of chro-
mosomal strings can be easily obtained by the nal user
simply dening an appropriate input le. An in-depth
description and further details about BMOGA implemen-
tation can be found in Ref. [24]. In this context some basic
features about the handling of sub-strings connected to
integer/real design variables were adopted, in order to
increase the convergence speed of optimization tasks based
on limited calculus resources (small populations and/or
reduced generations).
5. Application examples
5.1. Topological optimization of a grid structure
As rst example, the analysis of a metallic plate with a
grid-shaped cross-section is shown. The analyzed structure
is constrained to stay inside a bounding box of assigned
depth, width and height dimensions (respectively: 200,
180 and 20 mm). The plate is subject to the previously
dened natural boundary conditions applied on borders
and free edges and optimized to maximize the buckling
load.
In Fig. 8 a pictorial scheme of the plate is shown. The
shape of the plate cross-section is topologically-free,
but expressly conditioned to form anyway an orthogonal
grid. The section comes with a variable number of cells
arranged in rows and columns. Topological design param-
eters n and m dene the number of cells in x and y direc-
tions, while geometrical dimensions of each row/column
are dened by further independent parameters.
Let Dx and Dy be, respectively, the overall dimensions
in x and y directions of the plate cross-section, the follow-
ing conditions must be meet:
n
i1
l
x;i
Dx;
m
j1
l
y;j
Dy 1 6 n 6 n
max
; 1 6 m 6 m
max
;
11
where l
x,i
and l
y,j
denote ith and jth parametric cell-length
along x and y directions and n
max
, m
max
are the maximum
number of allowed rows and columns in the section.
Analyzing relations (11) a clear diculty appears when
one tries to introduce an independent set of design vari-
ables that directly model cells dimensions because: (i) the
number of rows and columns does not remain constant
in the parametric model; (ii) rows and columns represent
an ordered set and consequently an implicit hierarchy
exists about grid coordinates in both directions.
In order to satisfy relations (11) developing at the same
time a robust formulations for geometrical design vari-
ables, two new sets Y
x
and Y
y
of independent, normalized
parameters have been introduced. Aim of these design vec-
tors is to decouple geometrical features by topology. A
functional relation based on natural cubic splines is used
for this scope.
Let (x
k
, y
k
), k = 0, 1, . . . , p be a set of p + 1 points
belonging to an orthogonal domain [x
0
, x
p
] [0, 1] and
equally spaced in x. The following relations will result:
X
Y
Z
1 2 n
1
m
2
Dx
Dy
tk
i
Fig. 8. Plate cross-section layout.
1724 L. Iuspa, E. Ruocco / Computers and Structures 86 (2008) 17181737
x
k
x
0
kh; y
k
2 0; 1; h x
p
x
0
=p;
k 0; 1; . . . ; p 12
a natural cubic spline s(x) interpolating these points can be
dened by means of the following relations:
sx a
k
x x
k1
3
b
k
x x
k1
2
c
k
x x
k1
d
k
;
x
k1
6 x 6 x
k
s
0
x 3a
k
x x
k1
2
2b
k
x x
k1
c
k
s
00
x 6a
k
x x
k1
2b
k
13
where a
k
, b
k
, c
k
, d
k
k = 1, p are 4p unknown coecients.
Imposing on s(x) a C
2
class membership, a number of
4p 2 conditions can be given:
sx
k1
d
k
y
k1
k 1; p
sx
k
a
k
h
3
b
k
h
2
c
k
h d
k
y
k
k 1; p
s
0
x
k
3a
k
h
2
2b
k
h c
k
c
k1
k 1; p 1
s
00
x
k
6a
k
h 2b
k
2b
k1
k 1; p 1
_
_
14
Adding two more conditions (i.e. zero slope at external
points), a complete set of 4p equations is dened:
s
00
x
0
2b
1
0
s
00
x
p
6a
p
h 2b
p
0
_
15
By solving Eqs. (14) and (15) a generic cubic spline-based
relation is now available in the form:
y
sX; Y; x
where
X 0; 1=p; 2=p; . . . ; p 1=p; 1
Y y
0
; y
1
; y
2
; . . . ; y
p
;
x
0
6x
6x
p
16
Using function (16) a link can be established between p + 1
design parameters represented by the y
p
coordinates of the
spline control points and the normalized values returned by
evaluation of (16) at some reference points. In order to ap-
ply this approach to the denition of the grid geometrical
properties, the following steps are executed: (1) a normal-
ized, equally spaced grid in both x and y directions is rst
considered; (2) two separate splines, applied on x and y
coordinate are dened by means of design vectors Y
x
and
Y
y
; (3) for each coordinate values x
i
(i = 1, n 1) and y
j
(j = 1, m 1) related to internal grid points, the following
double spline evaluation is performed:
y
x;i
s
1
X
x
; Y
x
; x
x;i
i 1; n 1
y
y;j
s
2
X
y
; Y
y
; x
y;j
j 1; m 1
17
Normalized, non dimensional values obtained by relations
(17) are nally used to generate dimensional coordinate of
grid intersection points with the following recursive
expressions:
l
x;i
l
x;i1
Dx l
x;i1
y
x;i
; l
x;0
0; i 1; n 1
l
y;j
l
y;j1
Dy l
y;j1
y
y;j
; l
y;0
0; j 1; m 1
18
Fig. 9AD shows how the dimensional attribution works.
In this example, design vectors Y
x
and Y
y
are supposed
to consist respectively of six and three control points, while
the actual topology assumes n = 4, m = 5.
Initially the normalized grid is represented equally
spaced in both x and y direction (Fig. 9C); the resulting
x
x,i
coordinates of the intersection points are evaluated
through the s
1
spline (Fig. 9A) and the related output
values y
x,i
are used to indent hierarchically physical coor-
dinates l
x,i
along the x direction. The same procedure is
replied in y direction processing the x
y,j
coordinates
through the s
2
spline (Fig. 9B). The resulting modied
geometry is shown in Fig. 9D. Deliberately, no implicit
symmetries were imposed.
The geometrical model is nally completed by two fur-
ther continuous parameters tk
x
and tk
y
, which dene uni-
form wall thickness in x and y directions in terms of
percent values referred to the longest cell wall present in
the actual grid.
5.1.1. Mathematical modelling of design variables
In order to furnish a better understanding of the grid
parametric construction, let consider the following numer-
ical example based on ve-point splines (p = 4) for both x
and y coordinates.
Let n = 7, Y
x
= (0.1, 0.1, 0.18, 0.6, 0.65)
T
, m = 4,
Y
y
= (0.2, 0.15, 0.23, 0.52, 0.35)
T
, tk
x
= 0.01, tk
y
= 0.02
be the values of the actual design set, and Dx = 180,
Dy = 20 the xed overall dimensions of the grid cross-
section.
Step (1): A normalized 7 4 cell grid, having ve equally
spaced spline control points along both x and y
directions, is dened into a unit square with ori-
gin placed on the top-left corner; i.e.
X
x
= X
y
= (0.0, 0.25, 0.5, 0.75, 1.0)
T
.
Step (2): Eqs. (13) and (14) are solved for the x-spanned
spline; a piecewise cubic interpolation evaluation
is then performed for each x coordinate of the
n 1 internal crossing points of the grid, i.e:
SplineX
x
; Y
x
; 0:1429; 0:2857; 0:4286; 0:5714;
0:7143; 0:8571
T