A New Algorithm For Bi-Directional Evolutionary Structural Optimization
A New Algorithm For Bi-Directional Evolutionary Structural Optimization
A New Algorithm For Bi-Directional Evolutionary Structural Optimization
where N is the total node number of the candidate element. Using the finite element analysis, the performance in-
Thus, the sensitivity numbers for all elements within dex of the structure can infinitely approach the theoret-
the structure as well as possible added elements surround- ical one through the adjustment of the elements. When
ing the structure are used to compare. Elements in the the structure satisfies the convergence criterion defined as
current structure can therefore be removed if they satisfy Eq. (10), an optimum for the present removal ratio of vol-
Eq. (7.a) ume is assumed to be obtained.
|PIi − PIi−1 |
α∗e ≤ αth (7.a) errori = ≤ error (10)
PIi
For these elements surrounding the current structure will where errori is the defined performance error for the ith
be added if they satisfy Eq. (7.b) iteration and error is the maximum allowable error which
α∗e > αth (7.b) is specified by the user.
Sometimes, an oscillation state occurs when elements
where αth is the threshold of the sensitivity number which are added in an iteration and the same elements are re-
is determined by the current removal ratio of volume moved in the subsequent iteration. Thus, these elements
(RRVi ). For example, if there are 1 000 elements in de- will be added and removed in successive iterations. Nor-
sign domain and α1 > α2 ··· > α1 000 and RRVi corresponds mally, the occurrence of the oscillation state is caused by
to a design with 800 elements then αth = α800 . This new a low specified value of the maximum allowable error.
element removal and addition scheme ranks all elements When an oscillation occurs, the current design is assumed
(void and solid) together, while in the original BESO to be an optimum for the present removal ratio of volume
methods(14), (15) elements for removal and those for addi- although the convergence criterion has not been satisfied
tion are treated differently and ranked separated, which is yet.
a bit cumbersome and not very logical. The proposed iterative procedure is similar to the
The cycle of finite element analysis and element re- conventional optimality criteria approach where if only
moval and addition is repeated using the same value of marginal improvement in compliance over last design, the
RRVi until the solution is converged. Then an evolution- iterative procedure would be stopped. However, the de-
ary rate (ER) is introduced and added to the removal ratio signs of the conventional optimality criteria approach con-
of volume, i.e. tain elements of different densities (or thicknesses) rather
RRVi+1 = RRVi + ER, i = 0, 1, 2, 3··· (8) than elements of the same density in the BESO method.
With this increased removal ratio of volume, the cycle of 4. Bi-Directional Evolutionary Structural Optimiza-
finite element analysis and element removal and addition tion Procedure
takes place again until another optimum is obtained. The
To explain better how the bi-directional evolutionary
BESO procedure would be stopped when both the conver-
structural optimization can be implemented into a com-
gent criterion and final objective volume are satisfied.
puter program, a step-by-step algorithm is given as fol-
3. Performance Index (PI) and Convergence Crite- lows:
rion Step 1: The maximum design domain is discretized with
a densely finite element mesh.
Performance index (PI) can be introduced to identify Step 2: Define all boundary constraints, the design loads
the performance of various optimal designs. Thus, the and nonlinear material properties.
definition of the performance index should be directly re- Step 3: Carry out a linear finite element analysis of the
lated to the optimization objective. In the present case, structure.
the stiffness per unit volume or weight denotes the usage Step 4: Output the results of analysis into BESO pro-
efficiency of the material. So the performance index is de- gram.
fined by Step 5: Calculate the sensitivity number for all existed
1 elements as Eq. (3).
PI = (9)
CV Step 6: Calculate the sensitivity number for all existed
Where C and V are the mean compliance and volume nodes as Eq. (4).
(or weight) of the current design. While designs have a Step 7: Calculate the sensitivity number for all candidate
same volume, the one with a highest stiffness is the op- nodes surrounding the structure as Eq. (5).
timum which has the highest performance index. Thus, Step 8: Calculate the sensitivity number for all elements
for a given removal ratio of volume, the structure should as Eq. (6)
be gradually evolved to an optimum with a highest per- Step 9: Remove and add elements which satisfy
formance index by several removing and adding elements Eqs. (7.a) and (7.b).
process. Step 10: If the convergence condition Eq. (10) is satis-
fied, an optimum is reached and the optimiza- nodes. All topologies shown in the following sections are
tion process skips Step 11. Otherwise, go to next smoothed.
step.
5. Examples and Discussion
Step 11: If an oscillatory state is reached when a group
of elements are removed and added back to the 5. 1 Example 1: Michell type structure
structure in the successive iterations. The opti- The classic Michell type structure is fixed at both sup-
mum is reached. Otherwise, repeats step (3) to ports as shown in Fig. 3. The dimensions of the rectangu-
(11) until an optimum is reached. lar domain are 0.2 m by 0.1 m. The thickness of the plate
Step 12: For the optimization process to continue, the re- is 0.001 m. A 100 N concentrated force is applied at the
moval ratio of volume is increased by Eq. (10). center of bottom edge. The linear material is used with
Repeat step (3) to (10) until another optimum is Young’s modulus E = 210 GPa and Poisson’s ratio ν = 0.3.
reached. Because of symmetry, only half the structure is modeled
Figure 2 shows the flow chart which defines the logical with 100×100 four node elements. The BESO parameters
steps for the new BESO method. are: RRV0 = 0.01, ER = 0.01 and error = 0.001.
In the above procedure, the convergent optimums cor-
responding to various intermediate volumes are found. If
only one optimum corresponding to the final volume, V ∗ ,
is requested, the convergence condition may be checked
only after the objective volume V ∗ is satisfied in step 10.
In this way, the computation time can be saved signifi-
cantly.
In order to present the final optimal topology with
manufacturable boundary, an intuitive smoothing tech-
nique is applied. The coordinates of every node on the
boundary are averaged by the coordinates of neighbor
(a) (b)
(c) (d)
(e) (f)
(a) (b)
(c) (d)
(a) (a)
(b) (b)
(c) (c)
(d) (d)
(e) (e)
Fig. 16 Evolutionary history of the structural topology starting Fig. 19 Evolutionary history of the structural topology starting
from the initial guess design: (a) initial design; (b) from the initial guess design: (a) design after iteration
design after iteration 40; (c) design after iteration 80; 20; (b) design after iteration 40; (c) design after
(d) final optimal design; (e) rendered optimal design iteration 60; (d) final optimal design; (e) rendered
optimal design
that of the previous case. It is reasonable because there is (5) Xie, Y.M. and Steven, G.P., Evolutionary Structural
more constraint on the design domain in the later case. Optimization, (1997), Springer, London.
Above two examples also demonstrate the efficiency (6) Tanskanen, P., The Evolutionary Structural Optimiza-
of the present BESO method because the elements in- tion Method: Theoretical Aspects, Comput. Methods
Appl. Mech. Engrg., Vol.191 (2002), pp.5485–5498.
volved in finite element analysis is no more than 20% of
(7) Chu, D.N., Xie, Y.M., Hira, A. and Steven, G.P.,
total elements in the design domain. The convergence cri- Evolutionary Structural Optimization for Problems
terion used here is very strict, ensuring that the BESO al- with Stiffness Constraints, Finite Element Anal. Des.,
gorithm really has converged to an optimum. The designs Vol.21 (1996), pp.239–251.
with the performance index just a few percent above the (8) Xie, Y.M. and Steven, G.P., Evolutionary Structural
“optimal” one may be obtained using a large error such Optimization for Dynamic Problems, Comput. Struct.,
as 0.001 in approximately 50 iterations. Vol.58 (1996), pp.1067–1073.
(9) Manickarajah, D., Xie, Y.M. and Steven, G.P., An
6. Conclusions Evolutionary Method for Optimization of Plate Buck-
ling Resistance, Finite Elements in Anal. Des., Vol.29,
In this paper, a new algorithm for the bi-directional No.3–4 (1998), pp.205–230.
evolutionary structural optimization (BESO) has been de- (10) Cui, C., Ohmori, H. and Sasaki, M., Computational
veloped. Several 2D and 3D examples have demonstrated Morphogenesis of 3D Structures by Extended ESO
the capability of the new BESO method to optimize a Method, Journal of the International Association for
structure by adding and removing material. The devel- Shell and Spatial Structures: IASS, Vol.44 (2003),
oped BESO method has several advantages over tradi- pp.51–61.
tional ESO and BESO methods: (11) Ohmori, H., Futai, H., Iijima, T., Muto, A. and
Hasegawa, Y., Application of Computational Morpho-
1. The adding and removing of material is controlled
genesis to Structural Design, Proceeding of Computa-
by a single parameter: the removal ratio of volume (or tional Science Symposium, Nagoya University, Japan,
weight ratio). October 11–13, (2005), pp.45–52.
2. The final design is independent of the initial de- (12) Mitsui, K. and Sogabe, H., Heuristic Method for Topol-
sign, making the optimization algorithm more robust. The ogy and Shape Optimization of Structure Changing Pe-
final topology and performance index are very close even riodically, Proceeding of Computational Science Sym-
when the initial designs are totally different. posium, Nagoya University, Japan, October 11–13,
3. The performance index provides a clear indication (2005), pp.53–58.
(13) Kita, E. and Toyoda, T., Structural Design Using Cellu-
of structural efficiency of the resulting topologies and an
lar Automata, Structural Optimization, Vol.19 (2000),
effective termination criterion for the optimization proc- pp.64–73.
ess. (14) Querin, O.M., Steven, G.P. and Xie, Y.M., Evolution-
4. The proposed BESO method starting from initial ary Structural Optimisation by an Additive Algorithm,
guess design is more efficient than the original BESO Finite Elements Anal. Design, Vol.34 (2000), pp.291–
method because only small portion of elements which is 308.
no more than the objective volume is calculated in the fi- (15) Yang, X.Y., Xie, Y.M., Steven, G.P. and Querin,
nite element analysis. O.M., Bidirectional Evolutionary Method for Stiffness
Optimization, AIAA Journal, Vol.37, No.11 (1999),
References pp.1483–1488.
(16) Querin, O.M., Young, V., Steven, G.P. and Xie,
(1) Bendsøe, M.P. and Kikuchi, N., Generating Optimal Y.M., Computational Efficiency and Validation of
Topologies in Structural Design Using a Homogeniza- Bi-Directional Evolutionary Structural Optimisation,
tion Method, Comput. Methods Appl. Mech. Eng., Comput. Methods Appl. Mech. Engrg., Vol.189 (2000),
Vol.71 (1988), pp.197–224. pp.559–573.
(2) Bendsøe, M.P. and Sigmund, O., Topology Opti- (17) Li, Q., Steven, G.P. and Xie, Y.M., A Simple Checker-
mization: Theory, Methods and Applications, (2003), board Suppression Algorithm for Evolutionary Struc-
Springer-Verlag, Berlin Heidelberg. tural Optimization, Struct. Multidisc. Optim., Vol.22
(3) Sigmund, O., A 99 Line Topology Optimization Code (2001), pp.230–239.
Written in MATLAB, Struct. Multidisc. Optim., Vol.21 (18) Michell, A.G.M., The Limits of Economy of Material
(2001), pp.120–127. in Frame Structures, Phil. Mag., Vol.8 (1904), pp.589–
(4) Xie, Y.M. and Steven, G.P., A Simple Evolution- 597.
ary Procedure for Structural Optimization, Comput.
Struct., Vol.49 (1993), pp.885–896.