Truss Optimization
Truss Optimization
66
ISSN: 2277-3754
ISO 9001:2008 Certified
International Journal of Engineering and Innovative Technology (IJEIT)
Volume 3, Issue 7, January 2014
Table 1: Examples of truss optimization and x, y, z are the net displacements of the member and
defined as:
Sizing Shape Topology (connectivity)
(2.1)
(2.2)
(2.3)
(3.1)
(3.2)
(3.3)
Where xi, yi, zi, ui, vi, wi are the nodal coordinates and
displacements of member joints, respectively. The strain of
each member is then compared to the allowable strain of used
material (all) as:
67
ISSN: 2277-3754
ISO 9001:2008 Certified
International Journal of Engineering and Innovative Technology (IJEIT)
Volume 3, Issue 7, January 2014
drawbacks by altering and reducing the design variables and limits of deflection which are lower than the limits of using
obtaining the remaining design variables using engineering all available of topology and cross sections. For some cases
design roles. For the traditional approach encountered in if we can easily predict the direction of deflection for each
literature, individual chromosomes combination in population point so the range of deflection variable can be reduced by
may produces optimum topology and shape but due to random 50%.
selection of cross sections this combination produces
Input data
section(s) smaller than minimum needed cross section(s) and
that cause exceeding constrain(s) limit(s) such stress or
deflection so due to this selected section(s) which lead to unfit Create initial population
structure due to the penalty resulting from design violations
usually expresses as [26].
For Each chromosome
(6)
Where F(x) is fitness value, f(x) weight of truss and is the
count of the number of constraints violated by a given Assemble the basic structure and translate the binary
solution including check of stability and constructability. chromosome in to FEM structure
Also sometimes individual chromosomes combination
produces a good topology and shape but due to random
selection this combination produce section(s) larger than Update topology matrix
minimum needed cross section(s), so the outcome truss is
overly weighted despite if we decrease this cross section(s)
Analyze the truss and get cross sections
slightly until reaching the minimum safe cross section(s) the
fitness will be improved. In addition, the chromosome
length needed for representing sizing variable depend on the
number of discrete available cross sections. The Check on constructability and stability
chromosome length reserved for member cross section is
estimated as: No
Passed
(7) Yes
68
ISSN: 2277-3754
ISO 9001:2008 Certified
International Journal of Engineering and Innovative Technology (IJEIT)
Volume 3, Issue 7, January 2014
The node deflection variable is also associated with nodes
not members and as we know the number of truss node usually
less than the number of its members so that also reduces the
chromosome length needed to represent that variable. This
procedure is willing to get the maximum fitness for each
proposed shape and Topology because we get here the
minimum safe sections depending on engineering design rules
which can reduce the probability of getting unfit trusses
exceed constrains limits.
69
ISSN: 2277-3754
ISO 9001:2008 Certified
International Journal of Engineering and Innovative Technology (IJEIT)
Volume 3, Issue 7, January 2014
nodes P6 & P2 which is considered unreal and undesirable
Coordinate. Of Variable Node P3
overlap [27].
Figure 5 shows the shape of optimized truss while table 3. X Y
And 4 show the results of nodal coordinates and member Cm Inch Cm Inch
sections. The maximum deflection investigated in the
optimum solution is 50.763 for node P2 in Y direction which 11.73 461.81 6.40 251.96
reaches 99.92% of the maximum permissible value which
means that the selected cross sections are almost optimum.
Table 6: Loading conditions for 25-bar space truss.
Table 3: Coordinate. Of Variable Point P3
B. 25-bar Space Truss Node Fx (KN) (lb) Fy (KN) (lb) Fz (KN) (lbs.)
1 4.45374 1000 -44.5374 -10000 -44.5374 -10000
3 2.22687 500 0 0 0 0
6 2.672244 600 0 0 0 0
70
ISSN: 2277-3754
ISO 9001:2008 Certified
International Journal of Engineering and Innovative Technology (IJEIT)
Volume 3, Issue 7, January 2014
Table 8: Optimization results for 25-bar space truss.
Talasl
Rajeev Erbat Kaveh
Rajeev and To˘gan ioglu
Design and Erbatur ur Lee et and Tayfu
Krishnamo Coello and [20] Li et al. Camp
variable Krishnam Zhu et al. et al. al. Shoja n This
or-thy et al. Cao [18] Dalo˘gl BGA [21] [23]
(area oor-thy [15] [16] [16] [22] ee Dede study
[13] [17] u wEIS HPSO BB-BC
in2) [13] GAOS1 GAOS HSH [24] [25]
Ps=40 [19] Ps =
Ps=20 2 ACO
300
A1 0.2 0.1 0.1 0.1 0.1 0.1 0.1 0.1 0.1 0.1 0.1 0.1 0.1 0.1 0.1
A2 0.1 1.8 1.9 0.1 1.2 0.7 0.5 0.3 0.1 0.3 0.3 0.3 0.3 0.3 0.3
A3 2.3 2.3 2.6 3.4 3.2 3.2 3.4 3.4 3.4 3.4 3.4 3.4 3.4 3.4 3.6
A4 0.2 0.2 0.1 0.2 0.1 0.1 0.1 0.1 0.1 0.1 0.1 0.1 0.1 0.1 0.1
A5 0.1 0.1 0.1 0.6 0.1 1.4 1.9 2.0 1.9 2.1 2.1 2.1 2.1 2.1 1.7
A6 0.8 0.8 0.8 1.1 0.9 1.1 0.9 1.0 1.0 1.0 1.0 1.0 1.0 1.0 0.8
A7 1.8 1.8 2.1 0.9 0.4 0.5 0.5 0.5 0.7 0.5 0.5 0.5 0.5 0.5 0.4
A8 3.0 3.0 2.6 3.0 3.4 3.4 3.4 3.4 3.4 3.4 3.4 3.4 3.4 3.4 3.6
Weight
546.76 546.01 562.93 515.27 493.8 493.94 485.05 483.35 485.9 484.85 484.85 484.85 484.85 484.85 476.33
(lbs.)
Member space truss problem compared with the results of the
proposed approach. As illustrated from the results, our
propose approach resulted in the most optimized value of
fitness (weight) which is less than all results found in
literature. The maximum deflection investigated in the
optimum solution is 8.89 mm for node 1 in Y direction which
reaches 99.89% of the maximum permissible value which
means that the selected cross sections are almost optimum.
from huge numbers of a pre‐determined set without any
V. CONCLUSIONS increasing the chromosome length.
When dealing with simultaneous size, shape and topology
optimization, the number of possible solutions reaches great REFERENCES
levels, which need long chromosome, big populations and [1] Nanakorn P, Meesomklin K. An adaptive penalty functions in
long calculation time. So to overcome these problems we genetic algorithms for structural design optimization.
should work on reducing the chromosome length without Computer and Structures 2001; 79:2527–39.
affecting the GA efficiency. An approach is proposed based [2] Goldberg DE. Genetic algorithm in search optimization and
on using nodal deflections as design variable instead of the machine learning. New York: Addison-Wesley; 1989.
member sections in addition to the nodal coordinates. This [3] Deb K and Gulati S, Design of truss-structures for minimum
will reduce the length of genotype as nodes are always less weight using genetic algorithms, Finite elements in analysis
than members in truss and as the range of nodal displacement and design, 37 (2001) 447-465
is less than the range of available steel sections for truss [4] Hajela, P. Lee, E. (1995). Genetic algorithms in truss
members. In addition, according to loads and configurations topological optimization. International Journal of Solids and
the direction of deflection can be expected which reduces the Structures. Volume 32, issue 22. Pages3341-3357.
deflection variables to 50% which can improve the [5] Li, Lijuan. Huang, Zhibin. Liu, Feng. (2006). An Improved
calculations. By using simple condition it also allows Particle Swarm Optimizer for Truss Structure Optimization.
removing and keeping on members i.e. making topology 2006 International Conference on Computational Intelligence
optimization without using chromosome for it and also and Security. Volume 1.Pages 924-928.
reduce Complexity and stuck problems of making Topology [6] Kripakaran, Prakash. Gupta, Abhinav. Baugh Jr. John W.
optimization by traditional method because this condition (2007). A novel optimization approach for minimum cost
make topology optimization depend on other variables design of trusses. Computers & Structures. Volume 85, issue
(coordinates of nodes and deflections of nodes). The 23-24. Pages 1782-1794.
proposed procedure was applied to two of the classical truss [7] Galante, Miguel. (1996). genetic algorithms as an approach to
problems and the results were compared to the results of optimize real-world trusses. International journal for
previous work found in literature. The presented results not Numerical Methods in engineering. Volume 39, issue 3.
only produce better optimum weight than previous results Pages 361-382.
but also reduced the calculation time and effort by using a [8] Su Ruiyi, Gui Liangjin, Fan Zijie (2009). truss topology
few numbers of chromosomes and ability to choose sections optimization using genetic algorithm with individual
71
ISSN: 2277-3754
ISO 9001:2008 Certified
International Journal of Engineering and Innovative Technology (IJEIT)
Volume 3, Issue 7, January 2014
identification technique Proceedings of the World Congress [27] Max Hultman. Weight optimization of steel trusses by a
on Engineering 2009 Vol II genetic algorithm – Size, shape and topology optimization
according to Eurocode. (2010)
[9] Rajan SD. Sizing, shape and topology design optimization of
trusses using genetic algorithm. J Struct Eng 1995; [28] Brian J. Auer. Size and Shape Optimization of Frame and
121(10):1480–7. Truss Structures through Evolutionary Methods (2005).
[10] Tang W, Tong L, Gu Y. Improved genetic algorithm for
design optimization of truss structures with sizing, shape and
topology variables. Internat J Numer Methods Engrg 2005;
62:1737–62.
[11] H. Rahami, A. Kaveh,_, Y. Gholipour. Sizing, geometry and
topology optimization of trusses via force method and genetic
algorithm. Engineering Structures 30 (2008) 2360–2369
[12] Kalyanmoy Deb.Surendra Gulati.(2001) Design of
truss-structures for minimum weight using genetic algorithms
Finite elements in analysis and design Volume 37 (2001)
447-465
[13] S. Rajeev, C.S. Krishnamoorthy, Discrete optimization of
structures using genetic algorithms, J. Struct. Eng. 11–5
(1992) 1233–1250.
[14] James M. Gere and William Weaver. Analysis of
Framed Structures. D. Van Nostrand Company, Inc.,1965.
[15] D.M. Zhu, An improved Templeman’s algorithm for optimum
design of trusses with discrete member size, Eng. Opt. 9
(1986) 303–312.
[16] F. Erbatur, O. Hasancebi, I. Tutuncu, H. Kılıc,, Optimal
design of planar and space structures with genetic algorithm,
Comput. Struct. 75 (2000) 209–224.
[17] C.A.C. Coello, M. Rudnick, A.D. Christiansen, Using genetic
algorithm for optimal design of trusses, IEEE (1994) 88–94.
[18] G. Cao, Optimized design of framed structures using a genetic
algorithm, Ph.D.Thesis, The University of Memphis, 1996.
[19] V. To˘gan, A.T. Dalo˘glu, An improved genetic algorithm
with initial population strategy and self-adaptive member
groupings, Comput. Struct. 86 (2008)1204–1218.
[20] T. Talaslioglu, A new genetic algorithm methodology for
design optimization of truss structures: bi population-based
genetic algorithm with enhanced interval search, Model.
Simul.Eng. (2009) 28, Article ID 615162.
[21] L.J. Li, Z.B. Huang, F. Liu, A heuristic particle swarm
optimization method fortruss structures with discrete
variables, Comput. Struct. 87 (2009) 435–443.
[22] K.S. Lee, Z.W. Geem, S.H. Lee, K.W. Bae, The harmony
search heuristic algorithm for discrete structural optimization,
Eng. Opt. 37–7 (2005) 663–684.
[23] C.V. Camp, Design of space trusses using big bang-big
crunch optimization, J.Struct. Eng. (2007) 999–1008.
[24] A. Kaveh, S. Shojaee, Optimal design of skeletal structures
using ant colony optimization, Int. J. Numer. Methods Eng.
70 (2007) 563–581.
[25] TayfunDedea, Serkan Bekiro˘glu, Yusuf Ayvaz , Weight
minimization of trusses with genetic algorithm , Applied Soft
Computing 11 (2011) 2565–25
[26] Sivanandam S. N. Deepa S. N. (2008). Introduction to
Genetic Algorithms. Berlin:Springer.
72
ISSN: 2277-3754
ISO 9001:2008 Certified
International Journal of Engineering and Innovative Technology (IJEIT)
Volume 3, Issue 7, January 2014
APPENDIX
Table 2: Results of previous works with same conditions
Optimization category
Weight
Search Method Size Shape Topology (lbs.)
Galante (1996) [7]. Genetic algorithm √ √ 5119.3
Kripakaran, Gupta and Baugh Jr. (2007) [6]. Hybrid search method. √ 5073.03
Li, Huang and Liu (2006) [5]. Particle swarm √ 5060.9
Rajan (1995) [9]. Genetic algorithm √ √ 4962.1
Su Ruiyi, Gui Liangjin, Fan Zijie (2009) [8]. Genetic algorithm √ √ 4962.07
Hajela and Lee (1995) [4]. Genetic algorithm √ √ 4942.7
Wenyan (2005) [10]. Genetic algorithm √ √ 4921.25
Deb and Gulati (2001) [3]. Genetic algorithm √ √ 4899.15
H. Rahami, A. Kaveh (2008) [11]. Force method √ √ 4855.2
Deb and Gulati (2001) [12]. Genetic algorithm √ √ 4731.65
This study Genetic algorithm √ √ √ 4762.1
73