Beruflich Dokumente
Kultur Dokumente
GENETIC OPTIMIZATION
By S. Pezeshk,1 Member, ASCE, C. V. Camp,2 Associate Member, ASCE, and
D. Chen,3 Member, ASCE
ABSTRACT: In this paper we present a genetic algorithm (GA)-based optimization procedure for the design of
Downloaded from ascelibrary.org by UNICAMP - Universidade Estadual De Campinas on 02/09/18. Copyright ASCE. For personal use only; all rights reserved.
2D, geometrical, nonlinear steel-framed structures. The approach presented uses GAs as a tool to achieve discrete
nonlinear optimal or near-optimal designs. Frames are designed in accordance with the requirements of the
AISC-LRFD specification. In this paper, we employ a group selection mechanism, discuss an improved adapting
crossover operator, and provide recommendations on the penalty function selection. We compare the differences
between optimized designs obtained by linear and geometrically nonlinear analyses. Through two examples, we
will illustrate that the optimal designs are not affected significantly by the P-⌬ effects. However, in some cases
we may achieve a better design by performing nonlinear analysis instead of linear analysis.
INTRODUCTION learn how the P-⌬ effects influence optimal designs, we will
conduct both linear and geometrically nonlinear analysis.
Many mathematical programming methods have been de- Through a series of design examples, we will conclude that
veloped during the last three decades (Gallagher and Zien- the optimal design is not significantly affected by P-⌬ effects.
kiewicz 1973; Hillier and Lieberman 1990). However, no sin- But, in some cases we may get a better design by considering
gle method has been found to be entirely efficient and robust P-⌬ effects. In addition, we will demonstrate that our proposed
for the entire range of engineering optimization problems (Ra- approach can be an effective optimization technique.
jeev and Krishnamoorthy 1992). Most design applications in
civil engineering involve selecting values for a set of design GENETIC ALGORITHMS
variables that best describe the behavior and performance of
the particular problem while satisfying the requirements and A genetic algorithm is a search strategy that models the
specifications imposed by codes of practice. Mathematically, mechanisms of genetic evolution (Holland 1975; Goldberg
these design variables are discrete for most practical design 1989). The GA search is based on the principles of ‘‘survival
problems. However, most mathematical optimization applica- of the fittest’’ and adaptation. In general, a GA is a flexible
tions are suited and developed for continuous design variables. and fairly efficient strategy to search such complex spaces as
In discrete optimization problems, searching for the global or the solution space for the design of frames.
a local optimal solution becomes a difficult task. A few math- GAs are search algorithms that are based on the concepts
ematical methods have been reported for solving problems in of natural selection and genetic coding. As algorithms, GAs
discrete optimization. These methods include complete enu- are different from traditional optimization methods in the fol-
meration techniques, integer programming, branch and bound lowing aspects: (1) They work with a coded set of the varia-
algorithms, and dynamic programming. All these methods use bles and not with the variables themselves; (2) they search
mathematical programming techniques. from a population of design variables rather than improving a
In this paper we present a genetic algorithm (GA) approach single design variable; (3) they use objective function infor-
for optimized design of 2D frames using discrete structural mation without any gradient information; and (4) their tran-
elements. GAs are efficient and broadly applicable global sition scheme is probabilistic, whereas traditional methods use
search procedures based on a stochastic approach that relies gradient information (Goldberg 1989).
on a ‘‘survival of the fittest’’ strategy. In recent years, GAs
have been used in structural optimization by many researchers Coding and Decoding
(Goldberg and Samtani 1986; Rajeev and Krishnamoorthy
1992; Adeli and Cheng 1994; Koumousis and Georgiou 1994; An essential characteristic of a GA is the coding of the
Rajan 1995; Kocer and Arora 1997; Camp et al. 1996; and variables that describe the problem. The most common coding
Rajeev and Krishnamoorthy 1997). All these studies have method is to transform the variables to a binary string of spe-
shown that the GA can be a powerful design tool for discrete cific length. In this paper, we use a simple binary coding
optimization. method.
An optimal design of 2D steel-framed structures using a GA
approach will be conducted. Designs are in compliance with Group Selection
the American Institute of Steel Construction Load Resistance The GA used in this study proceeds by first randomly gen-
Factor Design (AISC-LRFD) specification (Manual 1994). To erating a solution population of a specific size. From this pop-
1
ulation, the next generation of designs is evolved by perform-
Prof., Dept. of Civ. Engrg., Campus Box 526570, Univ. of Memphis, ing three distinct operations—reproduction, crossover, and
Memphis, TN 38152.
2
Assoc. Prof., Dept. of Civ. Engrg., Campus Box 526570, Univ. of
mutation. There are several different forms for these operators.
Memphis, Memphis, TN. There are a number of reproduction schemes commonly
3
Programming Engr., Green Mountain Geophysics, Boulder, CO used in GAs; these include proportionate reproduction, ranking
80302. selection, tournament selection, steady-state selection, and
Note. Associate Editor: Scott A. Burns. Discussion open until August greedy over selection. Comparison of the various schemes
1, 2000. To extend the closing date one month, a written request must have been performed by Goldberg and Deb (1991). In this
be filed with the ASCE Manager of Journals. The manuscript for this
paper was submitted for review and possible publication on September
study we used a group selection scheme for reproduction. In
1, 1998. This paper is part of the Journal of Structural Engineering, this scheme individuals in the solution population are sorted,
Vol. 126, No. 3, March, 2000. 䉷ASCE, ISSN 0733-9445/00/0003-0382– according to their fitness values, from best to worst. Then the
0388/$8.00 ⫹ $.50 per page. Paper No. 19107. sorted population is divided into groups. Each group is as-
382 / JOURNAL OF STRUCTURAL ENGINEERING / MARCH 2000
冘
Ne
minimize W = Ai Li i (1)
i=1
冘 冘 冘
different, say one is ‘‘00’’ and the other one is ‘‘11,’’ the Ne Nn Nc
crossover operator is randomly chosen from one-point cross-
over and uniform crossover. C= C ⫹ i C ⫹
d
i C Ii (3)
i=1 i=1 i=1
Since the extra two bits are used to determine which cross-
over to apply, this mechanism should give greater award to where C i , C di , and C Ii = constraint violations for stress, dis-
the crossover operator that produces superior offspring. Note placement, and interaction formulas of the AISC-LRFD spec-
that this mechanism allows the GA to adjust the relative mix- ification. Ne, Nn, and Nc = number of elements, number nodes,
ture of the four crossover operators. For example, the adap- and number of beam columns, respectively. In general, we
tational GA can use multipoint, uniform crossover primarily, express the constraint violation Ci as
再
or any combination among them.
0 if ␣i ⱕ 0
Mutation Ci = ␣i if 0 < ␣i ⱕ 1.0 (4)
␣ 2i if ␣i > 1.0
Although mutation is a secondary GA operator, it can play
an important role in the search. Mutation can be an explorative For stress constraints, we define ␣i as
operator by moving the search into regions of the solution
兩i兩
space it may have never reached. Mutation is a character-based ␣i = ⫺1 (5)
string operation. The procedure for mutation can be summa- 兩 ia兩
rized as follows: For each character of a solution string, a where i = stress in the ith element and ai = allowable stress
randomly generated number is compared against a mutation for the ith element. For displacement constraints we have
probability. If the random number is less than the mutation
probability, the value of the character at that position is 兩di兩
changed; otherwise, move to the next character position and ␣i = ⫺1 (6)
兩d ia兩
repeat the procedure. Typical values for the mutation proba-
bility are around 0.1%. where di = displacement at ith node and d ai = allowable dis-
JOURNAL OF STRUCTURAL ENGINEERING / MARCH 2000 / 383
冉 冊
4. Perform FEA using a suitable software package, check
Pu 8 Mux Muy the given constraints, and calculate the value of the pen-
⫹ ⫹ < 1.0 (7)
Pn 9 b Mnx b Mny alty function.
5. Check the convergence criteria. Terminate the design
Then ␣i becomes
process if it is satisfied; otherwise continue.
Pu 8
冉Mux Muy
冊 6. Calculate the penalized fitness for every individual of the
Downloaded from ascelibrary.org by UNICAMP - Universidade Estadual De Campinas on 02/09/18. Copyright ASCE. For personal use only; all rights reserved.
Example 2
To highlight stability as an important design criterion Ex-
ample 1 is redesigned with additional vertical loadings, as il-
lustrated in Fig. 7. Optimal designs for three cases are given
Case 3. Geometrically Nonlinear Analysis in Lieu of AISC- TABLE 2. Summary of Optimal Design Results for Example 1
LRFD Specification’s P-⌬ Effects Magnification Factors
Analysis Weight
In this case, we performed a geometrically nonlinear anal- procedure Beam Column (lb)
ysis in lieu of the AISC-LRFD specification. Results of 30 (1) (2) (3) (4)
runs are summarized in Table 1. From Table 1, we can observe Case 1 W24⫻62 W10⫻60 18,792
that using W10⫻68 for columns and W24⫻62 for beams re- Case 2 W24⫻62 W10⫻60 18,792
sults in the best design. The corresponding weight of this de- Case 3 W24⫻62 W10⫻68 19,512
sign is 19,512 lb. This is a little heavier than the previous
optimal design (⬵4%).
One typical convergence history is illustrated in Fig. 5. We
note that the optimized design is obtained within 18 genera-
tions. However, the design process keeps fluctuating compared
with the previous linear design.
APPENDIX. REFERENCES
Adeli, H., and Cheng, N. T. (1994). ‘‘Concurrent genetic algorithms for
optimization of large structures.’’ J. Aero. Engrg., 7(3), 276–296.
Camp, C. V., Pezeshk, S., and Cao, G. (1996). ‘‘Design of 3-D structures
using a genetic algorithm.’’ Proc, 1st U.S.-Japan Sem. on Struct. Op-
timization, April, Chicago.
Chen, D. (1997). ‘‘Least weight design of 2-D and 3-D geometrically
nonlinear frame structures using a genetic algorithm,’’ PhD disserta-
tion, University of Memphis, Memphis, Tenn.
Gallagher, R. H., and Zienkiewicz, O. C. (1973). Optimum structural
design: Theory and Applications, Wiley, New York.
Geist, A., Beguelin, A., Dongarra, J., Jiang, W., Mancheck, R., and Sun-
deram, V. (1991). PVM: Parallel virtual machine: A user’s guide and
tutorial for networked parallel computing, The MIT Press, Cambridge,
Mass.
Goldberg, D. E., and Samtani, M. P. (1986). ‘‘Engineering optimization
via genetic algorithms.’’ Proc., 9th Conf. on Electronic Comput.,
ASCE, New York, 471–482.
Hall, S. K., Cameron, G. E., and Grierson, D. E. (1989). ‘‘Least-weight
design of steel frameworks accounting for P-⌬ effects.’’ J. Struct.
Engrg., ASCE, 115(6), 1463–1475.
Hillier, F. S., and Lieberman, G. J. (1990). Introduction to mathematical
FIG. 10. Distribution of Final Design Variables and Typical programming, McGraw-Hill, New York.
Convergence Histories of Example 3 Homaifar, A., Qi, C. X., and Lai, S. H. (1994). ‘‘Constrained optimization
via genetic algorithms.’’ Simulation, April, 242–254.
From Table 4 and Fig. 9 we observe that the optimal designs Manual of steel construction: Load and resistance factor design. (1994).
2nd Ed., American Institute of Steel Construction.
obtained from three different design procedures are not sig- Pezeshk, S. (1992). ‘‘Optimal design of structures with kinematic nonlin-
nificantly different. Because the frame is slender it is the dis- ear behavior.’’ J. Engrg. Mech., ASCE, 118(4), 702–720.
placement constraint, not the strength requirement, that con- Pezeshk, S. (1998). ‘‘Design of framed structures: An integrated nonlinear
trols the design. The design obtained by geometrically analysis and optimal minimum weight design.’’ Int. J. Numer. Methods
nonlinear analysis is the heaviest. From Figs. 10(a–c), we ob- in Engrg., 41, 459–471.
serve that the same design variable for different runs varies in Rajeev, S., and Krishnamoorthy, C. S. (1992). ‘‘Discrete optimization of
structures using genetic algorithms.’’ J. Struct. Engrg., ASCE, 118(5),
a small range of available space. In addition, Figs. 10(a–c) 1233–1250.
show the average, , and average plus and minus one standard Rajan, S. D. (1995). ‘‘Sizing, shape, and topology design optimization of
deviation, ⫹ , of all 30 runs. This demonstrates the present trusses using genetic algorithms.’’ J. Struct. Engrg., ASCE, 121(10),
optimal design method’s ability to converge. From Figs. 10(d– 1480–1487.
f) we can conclude that the optimal design can be achieved Richardson, J. T., Palmer, M. R., Liepins, G., and Hilliard, M. (1989).
within 40 generations. ‘‘Some guidelines for genetic algorithms with penalty functions.’’
Proc., 3rd Int. Conf. on Genetic Algorithms, Morgan Kaufmann, San
Mateo, Calif., 191–197.
CONCLUSIONS Spears, W. M. (1994). ‘‘Adaptive crossover in genetic algorithms.’’ Ar-
tificial Intelligence Center Internal Rep. #AIC-94-019, Naval Research
The writers have presented a design procedure using a ge- Laboratory, Washington, D.C.
netic algorithm for the design of 2D framed structures. Both Zienkiewicz, O. C. (1982). The finite element method, 3rd Ed., McGraw-
geometrically linear and nonlinear analysis were performed to Hill, London.