# Optimum Performance-Based Seismic Design Using a Hybrid Optimization Algorithm

Authors: S. Talatahari; A. Hosseini; S. R. Mirghaderi; F. Rezazadeh
Journal: Mathematical Problems in Engineering
 (2014)

---

## Abstract

A hybrid optimization method is presented to optimum seismic design of steel frames considering four performance levels. These performance levels are considered to determine the optimum design of structures to reduce the structural cost. A pushover analysis of steel building frameworks subject to equivalent-static earthquake loading is utilized. The algorithm is based on the concepts of the charged system search in which each agent is affected by local and global best positions stored in the charged memory considering the governing laws of electrical physics. Comparison of the results of the hybrid algorithm with those of other metaheuristic algorithms shows the efficiency of the hybrid algorithm.


---

## Body

## 1. Introduction

Many of engineering problems can be modeled into optimization problems. Therefore, developing new optimization techniques to solve these types of problems becomes highly significant. For this case, a large number of optimization algorithms as optimization techniques have already been proposed and applied in solving engineering problems such as ant colony optimization (ACO) [1], ABC (artificial bee colony) [2, 3], cuckoo search (CS) [4–6], bat algorithm (BA) [7, 8], genetic programming (GP) [9], ES (evolutionary strategy) [10], GA (genetic algorithm) [11], HS (harmony search) [12, 13], biogeography-based optimization (BBO) [14–16], differential evolution (DE) [17–19], particle swarm optimization (PSO) [20, 21], electromagnetism-like mechanism (EM) [22], and the charged system search algorithm (CSS) [23–25].In 2010, Kaveh and Talatahari have firstly proposed a robust metaheuristic search technique, namely, CSS algorithm [23], for possibly nonlinear functions. The governing laws from the physics initiate the base of the CSS algorithm. CSS is a multiagent algorithm in which each agent is considered as a charged sphere. Since these agents are treated as charged particles that can affect each other according to the Coulomb and Gauss laws from electrostatics, they are called charged particles (CPs). After determining the resultant force affected on each CP, the Newtonian motion law is utilized to determine the movement of the agents. The successive moving of CPs considering the resultant forces directs the agents toward optimum solutions.The contribution of this paper is to present a hybrid CSS-based algorithm to find a seismic optimum design of steel frames considering four performance levels. The nonlinear analysis is required to reach the structural response at various performance levels. Therefore, the refined plastic hinge analysis method is developed to estimate the nonlinear behavior of the entire structural system and members effectively.The organization of this paper is as follows. Section2 and Section 3 describe the statement of the problem and the utilized analyses method, respectively. Our proposed CSS-based hybrid method is described in detail in Sections 4 and 5. Subsequently, the merits of our method are verified by numerical examples in Section 6. At last, Section 7 summarizes our work.


## 2. Statement of Seismic Design of Frames

The mathematical formulation of the structural optimization problems can be expressed as minimizing the weight of structures as the cost function without taking into consideration other influencing tributary parameters:(1)
Minimize
:
W
(
X
)
=
∑
j
=
1
n
e
ρ
·
L
j
·
A
j
,
where W
(
X
) is the weight of the structure; X is the vector of design variables taken from W-shaped sections found in the AISC design manual [26]; n
e is the number of members; ρ is the material mass density; and L
j and A
j are the length and the cross-sectional area of the memberj, respectively.Lateral deflections of a building may cause human discomfort and minor damage of nonstructural components. Extreme inelastic lateral deflections due to a severe earthquake can cause the failure of mechanical, electrical and plumbing systems or suspended ceilings and equipment to fall, thereby posing threats to the human life. This matter is considered as the constraint functions in this paper as [27]
(2)
OP
Level
Δ
OP
(
X
)
≤
Δ
-
OP
,
IO
Level
Δ
IO
(
X
)
≤
Δ
-
IO
,
LS
Level
Δ
LS
(
X
)
≤
Δ
-
LS
,
CP
Level
Δ
CP
(
X
)
≤
Δ
-
CP
,
where Δ
level is the lateral drift and Δ
-
level is the allowable lateral drift (0.4%, 0.7%, 2.5% and 5% of the height of the building are taken as the allowable roof drifts for the OP, IO, LS, and CP performance levels, resp.). Here, OP, IO, LS, and CP are the different performance levels. Operational (OP), Immediate Occupancy (IO), life safety (LS), and collapse Prevention (CP) (FEMA-273, 1997), [28] are building performance levels. The operational level is that at which a building has sustained minimal or no damage to its structural and nonstructural components, and the building is suitable for normal occupancy or use; a building at the immediate occupancy level has sustained minimal or no damage to its structural elements and only minor damage to its nonstructural components, and is safe to be reoccupied immediately; a building at the life safety level has experienced extensive damage to its structural and nonstructural components and, while the risk to life is low, repairs may be required before reoccupancy can occur; the collapse prevention level is when a building has reached a state of impending partial or total collapse, where the building may have suffered a significant loss of lateral strength and stiffness with some permanent lateral deformation, but the major components of the gravity load carrying system should still continue to carry gravity load demands.


## 3. Pushover Analysis for Performance-Based Design

There are various methods of static pushover analyses to predict the seismic demands on building frameworks under equivalent static earthquake loading [29–35]; however, here a developed computer-based pushover analysis procedure is utilized [27] which was originally conceived for the elastic analysis of steel frameworks with semirigid connections [36, 37]. The analysis process is inspired from second-order inelastic analysis of semi-rigid framed structures that rigidity factor is replaced with plasticity factor in stiffness matrix. Fictitious plastic-hinge connections are necessary at the two ends of beam-column elements and semi-rigid analysis techniques were modified for the nonlinear load-deformation analysis of building frameworks under increasing seismic loads. The value of plasticity factor p is conceived from rigidity factor used in semi-rigid analysis. This factor r
i defines the rotational stiffness of the connection and can be interpreted as the ratio of the end-rotation α
i of the member to the combined rotation θ
i of the member as
(3)
r
i
=
α
i
θ
i
=
1
1
+
(
3
EI
/
R
L
)
(
i
=
1
,
2
)
,
where R is the rotational stiffness of connection i and EI and L are the bending stiffness and length of the connected member, respectively. In fact, upon replacing connection rotational stiffness R with section postelastic flexural stiffness in (3), the degradation of the flexural stiffness of a member section experiencing postelastic behavior can be characterized by the plasticity factor:
(4)
p
=
1
1
+
(
3
EI
/
R
p
L
)
,
where R
p
=
d
M
/
d
ϕ is the section postelastic flexural stiffness and p is the plasticity factor:
(5)
%
plasticity
=
100
(
1
-
p
)
.Here, the elastic stiffness matrix is comprised of both the first-order and the second-order geometric properties:(6)
K
=
S
e
C
e
+
S
g
C
g
.
The matrix K consists of two parts; the first part is conceived from Monfortoon and Wu’s method [38] that employs the rigidity factor concept to develop a first-order elastic analysis technique for semi-rigid frames (i.e., S
e
×
C
e) and the second part is conceived from Xu’s method [36] that considers the rigidity-factor concept to develop a second-order elastic analysis technique for semi-rigid frames (i.e., S
g
×
C
g). Here S
e and S
g are the standard first-order elastic and the second-order geometric stiffness matrices, respectively, when the member has rigid moment-connections; C
e and C
g are the corresponding correction matrices which account for the reduced rotational stiffness of the semi-rigid moment-connections. The flowchart of pushover analysis for performance-based design is shown in Figure 1.Figure 1
Flowchart of pushover analysis for performance-based design.


## 4. Utilized Algorithms

A review of utilized metaheuristic algorithms is presented in the following subsections.


### 4.1. Charged System Search Algorithm

The charged system search (CSS) algorithm is based on the Coulomb and Gauss laws from electrical physics and the governing laws of motion from the Newtonian mechanics. This algorithm can be considered as a multiagent approach, where each agent is a charged particle (CP). Each CP is considered as a charged sphere with radiusa, having a uniform volume charge density, and is equal to [23]
(7)
q
j
=
W
j
-
W
worst
W
best
-
W
worst
,
j
=
1,2
,
…
,
N
,
where W
best and W
worst are the minimum and the maximum weight among all the particles, W
j represents the weight of the agent i, and N is the total number of CPs.CPs can impose electrical forces on the others. The kind of the forces is attractive and its magnitude for the CP located in the inside of the sphere is proportional to the separation distance between the CPs and for a CP located outside the sphere is inversely proportional to the square of the separation distance between the particles:(8)
F
j
=
q
j
∑
i
,
i
≠
j
(
q
i
a
3
r
i
j
·
i
1
+
q
i
r
i
j
2
·
i
2
)
p
i
j
(
X
i
-
X
j
)
,
∑
i
,
i
≠
j
(
q
i
a
3
r
i
j
i
i
i
1
+
q
i
r
i
j
2
·
i
2
)
p
i
j
i
i
i
j
=
1,2
,
…
,
N
,
(
X
i
-
X
j
)
(
iii
X
j
)
i
1
=
1
,
i
2
=
0
⟺
r
i
j
<
a
,
(
X
i
-
X
j
)
(
iii
X
j
)
i
1
=
0
,
i
2
=
1
⟺
r
i
j
≥
a
,
where F
j is the resultant force acting on the jth CP and r
i
j is the separation distance between two charged particles which is defined as follows:
(9)
r
i
j
=
∥
X
i
-
X
j
∥
∥
(
X
i
+
X
j
)
/
2
-
X
best
∥
+
ε
,
where X
i and X
j are the positions of the ith and jth CPs, respectively; X
best is the position of the best current CP with the minimal weight; and ε is a small positive number. The initial positions of CPs are determined randomly in the search space and the initial velocities of charged particles are assumed to be zero. P
i
j determines the probability of moving each CP toward the others as
(10)
p
i
j
=
{
1
W
i
-
W
best
W
j
-
W
i
>
rand
or
W
j
>
W
i
0
otherwise
.The resultant forces and the motion laws determine the new location of the CPs. At this stage, each CP moves toward to its new position considering the resultant forces and its previous velocity as(11)
X
j
,
new
=
rand
j
1
·
k
a
·
F
j
m
j
·
Δ
t
2
+
rand
j
2
·
k
v
·
V
j
,
old
·
Δ
t
+
X
j
,
old
,
V
j
,
new
=
X
j
,
new
-
X
j
,
old
Δ
t
,
where k
a is the acceleration coefficient; k
v is the velocity coefficient to control the influence of the previous velocity; and rand
j
1 and rand
j
2 are two random numbers uniformly distributed in the range of (0, 1). If each CP exits from the allowable search space, its position is corrected using the harmony search-based handling approach as described by Kaveh and Talatahari [39]. In addition, to save the best design, a memory (charged memory) is considered containing the CMS number of positions for the so far best agents.Both CSS and EM [22] are based on the governing laws from the electrical physics; however, the movement strategies, the resultant force for each agent, and deification of electrical charges for agents are different. The CSS algorithm utilizes a velocity term while in the EM we have no term of a velocity. The EM just uses the Coulomb law to determine the forces while the CSS approach uses the Coulomb law as well as Gauss’s law to explore the search space more efficiently. After evaluating the total force vector in the EM, each agent is moved in the direction of the force by a random step length (being uniformly distributed between 0 and 1) while the movements in the CSS are based on the governing laws of motion from the Newtonian mechanics. The potency of the EM is summarized to find the direction of an agent’ movement, while in the CSS not only the directions but also the amount of movements are determined.From the above discussion, it can be concluded that the CSS algorithm is a general form of the EM which contains its superiorities and avoids its disadvantages.


### 4.2. Particle Swarm Optimization

The particle swarm optimization (PSO) is motivated from the social behavior of bird flocking and fish schooling which has a population of individuals, called particles, that adjust their movements depending on both their own experience and the population’s experience [20]. In other words, each particle in the PSO algorithm continuously focuses and refocuses on the effort of its search according to both local best and global best. In PSO, the position of each agent, X
i
k, and its velocity, V
i
k
+
1, are calculated as
(12)
X
i
k
+
1
=
X
i
k
+
V
i
k
+
1
,
V
i
k
+
1
=
ω
V
i
k
+
c
1
r
1
∘
(
P
i
k
-
X
i
k
)
+
c
2
r
2
∘
(
P
g
k
-
X
i
k
)
,
where ω is an inertia weight to control the influence of the previous velocity, r
1 and r
2 are two random vectors uniformly distributed in the range of (0, 1), and c
1 and c
2 are two acceleration constants, and the sign “∘” denotes element-by-element multiplication. The abovementioned formulations of the PSO algorithm can be combined and rewritten as
(13)
X
i
k
+
1
=
X
i
k
+
ω
V
i
k
+
c
1
r
1
∘
(
P
i
k
-
X
i
k
)
+
c
2
r
2
∘
(
P
g
k
-
X
i
k
)
.In some previous studies, to improve the performance of the algorithm, another term is added to the above formulae as(14)
X
i
k
+
1
=
X
i
k
+
ω
V
i
k
+
c
1
r
1
∘
(
P
i
k
-
X
i
k
)
+
c
2
r
2
∘
(
P
g
k
-
X
i
k
)
+
∑
j
=
1
n
e
c
j
r
j
∘
(
R
j
k
-
X
i
k
)
,
where c
j, similar to c
1 and c
2, is a constant value and r
j is a random vector. n
e denotes the number of extra terms considered in the algorithm and R
j
k is defined based on the type of the algorithm being used.


## 4.1. Charged System Search Algorithm

The charged system search (CSS) algorithm is based on the Coulomb and Gauss laws from electrical physics and the governing laws of motion from the Newtonian mechanics. This algorithm can be considered as a multiagent approach, where each agent is a charged particle (CP). Each CP is considered as a charged sphere with radiusa, having a uniform volume charge density, and is equal to [23]
(7)
q
j
=
W
j
-
W
worst
W
best
-
W
worst
,
j
=
1,2
,
…
,
N
,
where W
best and W
worst are the minimum and the maximum weight among all the particles, W
j represents the weight of the agent i, and N is the total number of CPs.CPs can impose electrical forces on the others. The kind of the forces is attractive and its magnitude for the CP located in the inside of the sphere is proportional to the separation distance between the CPs and for a CP located outside the sphere is inversely proportional to the square of the separation distance between the particles:(8)
F
j
=
q
j
∑
i
,
i
≠
j
(
q
i
a
3
r
i
j
·
i
1
+
q
i
r
i
j
2
·
i
2
)
p
i
j
(
X
i
-
X
j
)
,
∑
i
,
i
≠
j
(
q
i
a
3
r
i
j
i
i
i
1
+
q
i
r
i
j
2
·
i
2
)
p
i
j
i
i
i
j
=
1,2
,
…
,
N
,
(
X
i
-
X
j
)
(
iii
X
j
)
i
1
=
1
,
i
2
=
0
⟺
r
i
j
<
a
,
(
X
i
-
X
j
)
(
iii
X
j
)
i
1
=
0
,
i
2
=
1
⟺
r
i
j
≥
a
,
where F
j is the resultant force acting on the jth CP and r
i
j is the separation distance between two charged particles which is defined as follows:
(9)
r
i
j
=
∥
X
i
-
X
j
∥
∥
(
X
i
+
X
j
)
/
2
-
X
best
∥
+
ε
,
where X
i and X
j are the positions of the ith and jth CPs, respectively; X
best is the position of the best current CP with the minimal weight; and ε is a small positive number. The initial positions of CPs are determined randomly in the search space and the initial velocities of charged particles are assumed to be zero. P
i
j determines the probability of moving each CP toward the others as
(10)
p
i
j
=
{
1
W
i
-
W
best
W
j
-
W
i
>
rand
or
W
j
>
W
i
0
otherwise
.The resultant forces and the motion laws determine the new location of the CPs. At this stage, each CP moves toward to its new position considering the resultant forces and its previous velocity as(11)
X
j
,
new
=
rand
j
1
·
k
a
·
F
j
m
j
·
Δ
t
2
+
rand
j
2
·
k
v
·
V
j
,
old
·
Δ
t
+
X
j
,
old
,
V
j
,
new
=
X
j
,
new
-
X
j
,
old
Δ
t
,
where k
a is the acceleration coefficient; k
v is the velocity coefficient to control the influence of the previous velocity; and rand
j
1 and rand
j
2 are two random numbers uniformly distributed in the range of (0, 1). If each CP exits from the allowable search space, its position is corrected using the harmony search-based handling approach as described by Kaveh and Talatahari [39]. In addition, to save the best design, a memory (charged memory) is considered containing the CMS number of positions for the so far best agents.Both CSS and EM [22] are based on the governing laws from the electrical physics; however, the movement strategies, the resultant force for each agent, and deification of electrical charges for agents are different. The CSS algorithm utilizes a velocity term while in the EM we have no term of a velocity. The EM just uses the Coulomb law to determine the forces while the CSS approach uses the Coulomb law as well as Gauss’s law to explore the search space more efficiently. After evaluating the total force vector in the EM, each agent is moved in the direction of the force by a random step length (being uniformly distributed between 0 and 1) while the movements in the CSS are based on the governing laws of motion from the Newtonian mechanics. The potency of the EM is summarized to find the direction of an agent’ movement, while in the CSS not only the directions but also the amount of movements are determined.From the above discussion, it can be concluded that the CSS algorithm is a general form of the EM which contains its superiorities and avoids its disadvantages.


## 4.2. Particle Swarm Optimization

The particle swarm optimization (PSO) is motivated from the social behavior of bird flocking and fish schooling which has a population of individuals, called particles, that adjust their movements depending on both their own experience and the population’s experience [20]. In other words, each particle in the PSO algorithm continuously focuses and refocuses on the effort of its search according to both local best and global best. In PSO, the position of each agent, X
i
k, and its velocity, V
i
k
+
1, are calculated as
(12)
X
i
k
+
1
=
X
i
k
+
V
i
k
+
1
,
V
i
k
+
1
=
ω
V
i
k
+
c
1
r
1
∘
(
P
i
k
-
X
i
k
)
+
c
2
r
2
∘
(
P
g
k
-
X
i
k
)
,
where ω is an inertia weight to control the influence of the previous velocity, r
1 and r
2 are two random vectors uniformly distributed in the range of (0, 1), and c
1 and c
2 are two acceleration constants, and the sign “∘” denotes element-by-element multiplication. The abovementioned formulations of the PSO algorithm can be combined and rewritten as
(13)
X
i
k
+
1
=
X
i
k
+
ω
V
i
k
+
c
1
r
1
∘
(
P
i
k
-
X
i
k
)
+
c
2
r
2
∘
(
P
g
k
-
X
i
k
)
.In some previous studies, to improve the performance of the algorithm, another term is added to the above formulae as(14)
X
i
k
+
1
=
X
i
k
+
ω
V
i
k
+
c
1
r
1
∘
(
P
i
k
-
X
i
k
)
+
c
2
r
2
∘
(
P
g
k
-
X
i
k
)
+
∑
j
=
1
n
e
c
j
r
j
∘
(
R
j
k
-
X
i
k
)
,
where c
j, similar to c
1 and c
2, is a constant value and r
j is a random vector. n
e denotes the number of extra terms considered in the algorithm and R
j
k is defined based on the type of the algorithm being used.


## 5. A Hybrid Optimization Algorithm

In the present hybrid algorithm, the advantage of the PSO containing utilizing the local best and the global best is added to the CSS algorithm. The charged memory (CM) for the hybrid algorithm is treated as the local best in the PSO, and the CM updating process is defined as(15)
CM
i
,
new
=
{
CM
i
,
old
,
W
(
X
i
,
new
)
≥
W
(
CM
i
,
old
)
,
X
i
,
new
,
W
(
X
i
,
new
)
<
W
(
CM
i
,
old
)
,
in which the first term identifies that when the new position is not better than the previous one the updating does not perform while when the new position is better than the stored so far good position the new solution vector is replaced. In the first iteration, the vector stored in CM and the first positions of the agents will be identical. Considering the abovementioned new charged memory, the electric forces generated by agents are modified as
(16)
F
j
=
∑
i
∈
S
1
(
q
i
a
3
r
i
j
·
i
1
+
q
i
r
i
j
2
·
i
2
)
(
CM
i
,
old
-
X
j
)
+
∑
i
∈
S
2
(
q
i
a
3
r
i
j
·
i
1
+
q
i
r
i
j
2
·
i
2
)
a
r
i
j
p
i
j
(
X
i
-
X
j
)
,
where S
1 and S
2 are defined as follows:
(17)
S
1
=
{
t
1
,
t
2
,
…
,
t
n
∣
q
(
t
)
>
q
(
j
)
,
j
=
1,2
,
…
,
N
,
j
≠
i
,
g
}
,
(18)
S
2
=
S
-
S
1
,
in which S
1 determines the set of agents utilized from CM, n denotes the number of CM agents, S is utilized as a set of all agents’ number, and thus S
2 will be the set of current agents used for directing the agent j. Here, in the primary iterations n is set to two continuing the number of the best stored so far agent among all CPs (global best) and jth agent stored in the CM which is treated as local best. Then the number of used agents from CM is increased linearly and finally it reached N in the last iterations. In this hybrid algorithm, CM
i
,
old will be treated similar to P
i
k in the PSO. The other modification is that the forces can be attractive or repulsive, and a
r
i
j is added to fulfill this aim which determines the kind of the force as
(19)
a
r
i
j
=
{
+
1
,
w
.
p
.
k
t
,
-
1
,
w
.
p
.
1
-
k
t
,
where “w.p.” represents the abbreviation for “with the probability” and k
t is a parameter to control the effect of the kind of forces. Comparing to (10), this new formula (18) considers the best so far location of agents and the best local position of the current agent in addition to the location of other agents. Also, here m
j is assumed to be q
j and therefore (12) is simplified as
(20)
X
j
,
new
=
k
a
·
r
1
·
F
j
+
k
v
·
r
2
·
V
j
,
old
+
X
j
,
old
.
The pseudocode of the hybrid algorithm can be summarized as follows.Step 1 (initialization).
The magnitude of the charge for each CP is defined by (7). The initial positions of the CPs are determined randomly and the initial velocities of charged particles are assumed to be zero.Step 2 (CM creation).
The position of the initial agents and the values of their corresponding objective functions are saved in the charged memory (CM).Step 3 (the forces determination).
The probability of moving each CP towards the others (p
i
j) and the kind of forces (a
i
j) are determined using (10) and (19), respectively, and the resultant force vector for each CP is calculated using (18).Step 4 (solution construction).
Each CP moves to the new position according to (20).Step 5 (CM updating).
CM updating is performed according to (15).Step 6 (terminating criterion control).
Steps3–5 are repeated for a predefined number of iterations.


## 6. Design Examples

Two building frameworks are selected for seismic optimum design using the metaheuristic algorithm [27]. These frames have previously been used to illustrate the pushover analysis technique by Hasan et al. [42] and Talatahari [40].The expected yield strength of steel material used for column members isσ
ye
=
397 MPa, while σ
ye
=
339 MPa is considered for beam members. The constant gravity load w is accounted for a tributary-area width of 4.57 m and dead-load and live-load factors of 1.2 and 1.6, respectively. For each example, 30 independent runs are carried out using the new hybrid algorithms and compared with other algorithms. The number of 20 individuals for CPs is used and the values of constants k
v and k
a are set to 0.4.


### 6.1. Four-Bay Three-Story Steel Frame

The configuration, grouping of the members and applied loads of the four-bay three-story framed structure are shown in Figure2, [27]. The 27 members, of the structure are categorized into five groups, as indicated in the figure. The modulus of elasticity is taken as E
=
200 GPa. The constant gravity load of w
1
=
32 kN/m is applied to the first and second story beams, while the gravity load of w
2
=
28.7 kN/m is applied to the roof beams. The seismic weight is 4,688 kN for each of the first and second stories and 5,071 kN for the roof story.Figure 2
Three-story steel moment-frame.The performance-based optimum results for the metaheuristic algorithm are summarized in Table1. The hybrid CSS, HPACO, ACO, and GA need 4500, 4500, 3900 and 6800 analyses to reach a convergence while 8500 analyses required by the PSO. The best hybrid CSS design results in a frame that weighs 273.7 kN, which is lighter than the design of Gall optimization algorithm. The result of conventional design [41] is approximately 50% more than the result of new algorithm. In a series of 30 different design runs, the average weight of the hybrid CSS designs is 286.7 kN, with a standard deviation of 5.651 kN, while the average weight of the PSACO, PSO, and ACO designs is 290.4 kN, 302.4 kN, and 294.3 kN, respectively. The standard deviation values are 6.45 kN, 10.45 kN and 7.56 for the PSACO, PSO, and ACO, respectively.Table 1
The statistical information of performance-based optimum designs for the 4-bay 3-story frame.
Algorithm
Hybrid CSS
PSACO [40]
PSO [40]
ACO [27]
GA [27]
A conventional design [41]
Best weight (kN)
273.7
279.2
286.3
283.4
303.9
412.9 kN
Average weight (kN)
286.7
290.4
302.4
294.3
321.5
—
Worst weight (kN)
297.8
298.5
310.7
303.2
339.7
—
Std. dev. (kN)
5.651
6.453
10.453
7.566
14.332
Average number of analyses
4,500
4,500
8,500
3,900
6,800
—


### 6.2. Five-Bay Nine-Story Steel Frame

A five-bay nine-story steel frame is considered as shown in Figure3. The material has a modulus of elasticity equal to E
=
200 GPa. The 108 members of the structure are categorized into fifteen groups, as indicated in the figure. The constant gravity load of w
1
=
32 kN/m is applied to the beams in the first to the eighth story, while w
2
=
28.7 kN/m is applied to the roof beams. The seismic weights are 4,942 kN for the first story, 4,857 kN for each of the second to eighth stories, and 5,231 kN for the roof story. In this example, each of the five beam element groups is chosen from all 267 W-shapes, while the eight column element groups are limited to W14 sections (37 W-shapes).Figure 3
Nine-story steel moment-frame.Table2 presents the statistical results obtained by the metaheuristic algorithms. The best hybrid CSS design results in a frame weighing 1568.66 kN which is 1.9%, 7.0%, 3.8%, and 9.5% lighter than the PSACO, PSO, ACO, and GA. In order to converge to a solution for the hybrid CSS algorithm, approximately 5,000 frame analyses are required which are less than the 6,000, 12,500, and 9,700 analyses necessary for the PSACO, PSO, and GA, respectively. The ACO needs only 5,600 analyses to find an optimum result.Table 2
The statistical information of performance-based optimum designs for the 4-bay 9-story frame.
Algorithm
Hybrid CSS
PSACO [40]
PSO [40]
ACO  [27]
GA [27]
Best weight (kN)
1568.66
1601.32
1682.63
1631.83
1723.1
Average weight (kN)
1626.32
1650.55
1725.36
1696.2
1791.4
Worst weight (kN)
1725.36
1759.65
1813.25
1786.94
1943.2
Std. dev. (kN)
30.35
38.52
66.35
49.33
78.33
Average number of analyses
5,000
6,000
12,500
5,600
9,700


## 6.1. Four-Bay Three-Story Steel Frame

The configuration, grouping of the members and applied loads of the four-bay three-story framed structure are shown in Figure2, [27]. The 27 members, of the structure are categorized into five groups, as indicated in the figure. The modulus of elasticity is taken as E
=
200 GPa. The constant gravity load of w
1
=
32 kN/m is applied to the first and second story beams, while the gravity load of w
2
=
28.7 kN/m is applied to the roof beams. The seismic weight is 4,688 kN for each of the first and second stories and 5,071 kN for the roof story.Figure 2
Three-story steel moment-frame.The performance-based optimum results for the metaheuristic algorithm are summarized in Table1. The hybrid CSS, HPACO, ACO, and GA need 4500, 4500, 3900 and 6800 analyses to reach a convergence while 8500 analyses required by the PSO. The best hybrid CSS design results in a frame that weighs 273.7 kN, which is lighter than the design of Gall optimization algorithm. The result of conventional design [41] is approximately 50% more than the result of new algorithm. In a series of 30 different design runs, the average weight of the hybrid CSS designs is 286.7 kN, with a standard deviation of 5.651 kN, while the average weight of the PSACO, PSO, and ACO designs is 290.4 kN, 302.4 kN, and 294.3 kN, respectively. The standard deviation values are 6.45 kN, 10.45 kN and 7.56 for the PSACO, PSO, and ACO, respectively.Table 1
The statistical information of performance-based optimum designs for the 4-bay 3-story frame.
Algorithm
Hybrid CSS
PSACO [40]
PSO [40]
ACO [27]
GA [27]
A conventional design [41]
Best weight (kN)
273.7
279.2
286.3
283.4
303.9
412.9 kN
Average weight (kN)
286.7
290.4
302.4
294.3
321.5
—
Worst weight (kN)
297.8
298.5
310.7
303.2
339.7
—
Std. dev. (kN)
5.651
6.453
10.453
7.566
14.332
Average number of analyses
4,500
4,500
8,500
3,900
6,800
—


## 6.2. Five-Bay Nine-Story Steel Frame

A five-bay nine-story steel frame is considered as shown in Figure3. The material has a modulus of elasticity equal to E
=
200 GPa. The 108 members of the structure are categorized into fifteen groups, as indicated in the figure. The constant gravity load of w
1
=
32 kN/m is applied to the beams in the first to the eighth story, while w
2
=
28.7 kN/m is applied to the roof beams. The seismic weights are 4,942 kN for the first story, 4,857 kN for each of the second to eighth stories, and 5,231 kN for the roof story. In this example, each of the five beam element groups is chosen from all 267 W-shapes, while the eight column element groups are limited to W14 sections (37 W-shapes).Figure 3
Nine-story steel moment-frame.Table2 presents the statistical results obtained by the metaheuristic algorithms. The best hybrid CSS design results in a frame weighing 1568.66 kN which is 1.9%, 7.0%, 3.8%, and 9.5% lighter than the PSACO, PSO, ACO, and GA. In order to converge to a solution for the hybrid CSS algorithm, approximately 5,000 frame analyses are required which are less than the 6,000, 12,500, and 9,700 analyses necessary for the PSACO, PSO, and GA, respectively. The ACO needs only 5,600 analyses to find an optimum result.Table 2
The statistical information of performance-based optimum designs for the 4-bay 9-story frame.
Algorithm
Hybrid CSS
PSACO [40]
PSO [40]
ACO  [27]
GA [27]
Best weight (kN)
1568.66
1601.32
1682.63
1631.83
1723.1
Average weight (kN)
1626.32
1650.55
1725.36
1696.2
1791.4
Worst weight (kN)
1725.36
1759.65
1813.25
1786.94
1943.2
Std. dev. (kN)
30.35
38.52
66.35
49.33
78.33
Average number of analyses
5,000
6,000
12,500
5,600
9,700


## 7. Conclusion Remarks

The problem of optimum design of frame structures is formulated to minimize the weight of the structure considering the required constraints specified by design codes. For seismic design of structures, two main points should be considered: structural costs and structural damages. As a result, it is essential to control the lateral drift of building frameworks under seismic loading at various performance levels. To fulfill this aim, in this paper a hybrid optimization method is presented. The algorithm is based on the CSS algorithm. CSS is a multiagent algorithm in which each agent is considered as a charged sphere. Since these agents are treated as charged particles that can affect each other according to the Coulomb and Gauss laws from electrostatics, in the present hybrid algorithm, the advantage of the PSO containing utilizing the local best and the global best is added to the CSS algorithm. The charged memory for the hybrid algorithm is treated as the local best in the PSO, and the CM updating process is redefined to adapt the new requirements.A simple computer-based method for push-over analysis of steel building frameworks subject to equivalent-static earthquake loading is utilized. The method accounts for first-order elastic and second-order geometric stiffness properties and the influence that combined stresses have on plastic behavior and employs a conventional elastic analysis procedure modified by a plasticity-factor to trace elastic-plastic behavior over the range of performance levels for a structure [27]. Two examples are optimized using the new algorithm as well as some advanced metaheuristic algorithms to investigate the capability of the new method. The genetic algorithm, ant colony optimization, particle swarm optimization, and particle swarm ant colony optimization method as well as the new hybrid method are utilized to find optimum seismic design of examples. The obtained results indicate that the new algorithm compared to GA, ACO, PSO, and PSACO can find better optimum seismic design of structures.



---

*Source: 693128-2014-02-16.xml*