# Size and Topology Optimization for Trusses with Discrete Design Variables by Improved Firefly Algorithm.

1. Introduction

Topology optimization is a rapidly expanding field of structural mechanics, which can result in greater savings than mere cross-section or shape optimization. Owing to its complexity, it is an intellectually challenging field (Rozvany and Olhoff 2001 ). Generally, the objective of topology optimization is to reduce the structural weight by adjusting the design variables under a set of predefined constraints imposed according to a selected code of design practice. As for topology optimization problems, the cross-sectional areas of structural members, shape parameters, and topology parameters can be treated as design variables. These variables can be divided into two categories as continuous variables and discrete variables. Actually, in practical engineering applications, discrete variables are used commonly as design or optimization variables, cross-sectional areas of the structural members, for instance. Therefore, size and topology optimization for trusses with discrete design variables is discussed in this study.

The first paper on topology optimization was published over a century ago by the versatile Australian inventor Michell (1904 ), who determined the first truss solutions of least weight and developed a general theory, which is a milestone in the theoretical research of structural topology optimization, for deriving them based on the work of Maxwell (1872 ). Several decades after that, many scholars joined in the field of optimization and a large number of papers were published. However, during that time, the research mainly focused on the development of optimization algorithms for continuous topology optimization. Typically, Dorn (1964 ) proposed the Ground Structure Approach, in which firstly they formed the ground structure containing all (or almost all) possible member connections among all nodes of the structure for a bridge truss, and then they applied the linear programming technique to optimize the structure subject to stress constraints and single loading case. Based on the Ground Structure Approach, Dobbs and Felton (1969 ) used a steepest descent-alternate mode algorithm to minimize the weight of the ground structure of truss subject to stress constraints and multiple loading cases. Kirsch and Topping (1992 ) applied a very attractive two-stage design approach, which evaluates an approximate solution at the first stage and modifies it at the second stage to achieve the final optimum, to optimize topologically the trusses subject to the constraints of stress and displacement.

Compared with topology optimization with continuous variables, the researches on topology optimization of trusses with discrete variables are much less. It is not easy to use the mathematical optimization methods to solve topology optimization problems with discrete variables. Lipson and Gwin (1977 ) adopted member areas and joint coordinates as design variables to minimize the cost of three-dimensional indeterminate truss structures subject to multiple loading conditions and design constraints, in which the constraints include Euler buckling and specified limits on member stresses, member sizes, and joint displacements. In their work, the design process was separated into two parts as geometry modifications and suboptimization. The complex method is applied in the geometry modifications part, and an analogous scaling procedure for displacement which constrains with the stress ratio method is applied in the suboptimization part. For each geometry change, discrete member sizes were selected from a table of allowable values. However, this method has the drawback of readily becoming trapped at a local optimum (Sun et al. 1995 ).

Over the last decade, the emergence of a new class of optimization methods, called metaheuristics, has marked a great revolution in the optimization field (Jarraya and Bouri 2012 ). These methods, which include the simulated annealing method, genetic algorithms, taboo search method, the Ant Colony Algorithms, and particle swarm optimization (PSO), are applicable to almost all types of combinatorial optimization problems. They also have been devised to topology optimization problems with discrete variables and to overcome the drawbacks of mathematical optimization methods. For example, Genetic Algorithm was researched by Wang and Tai (2005 ), Zhou (2010 ), Balamurugan et al. (2008 , 2011 ), Jain and Saxena (2010 ), and Madeira et al. (2010 ). Besides, Artificial Immune Algorithm was researched by Luh and Chueh (2004 ). Taboo Search method was researched by Bennage and Dhingra (2005 ). Ant Colonies Algorithm was researched by Kaveh et al. (2008 ) and Luh and Lin (2009 ) and Particle Swarm Optimization (PSO) was researched by Luh et al. (2011 ). Simulated Annealing method was researched by Shim and Manoochehri (1997 ), while Harmony Search was researched by Lee and Geem (2004 ). Differential Evolution schemes were researched by Wu and Tseng (2010 ). Some of these metaheuristics like Ant Colonies Algorithms and Particle Swarm Optimization may actually converge to reasonable designs within an acceptable number of iterations if combined with some kind of filtering algorithms (Sigmund 2011 ).

The Firefly Algorithm (FA, for short) developed recently by Yang (2009 ) is one of the newest nature-inspired metaheuristic algorithms (2013 ). It has been verified that FA is more accurate and efficient than Genetic Algorithm and Particle Swarm Optimization algorithm when solving continuous optimization problems, combinatorial optimization problems, constrained optimization problems, multiobjective optimization problems, and dynamic and noisy optimization problems. The FA has been applied in almost all areas of optimization, as well as in structural engineering practice (Fister et al. 2013 ). Size and topology optimization of trusses with discrete variables can be regarded as a kind of combinatorial optimization problem, because its solution space is disjoint and nonconvex, and feasible solution set is discrete. Therefore, it can be solved by FA as well (Miguel et al. 2013 ). However, the standard FA shows a slow rate of convergence towards the optimum and needs a high number of structural analyses.

The aim of this paper is to propose a modified Improved Firefly Algorithm (IFA, for short) based on the random-weight and improved attractiveness to solve the size and topology optimization of trusses with discrete design variables. In this method, the topology variables are included in size variables, unstable topologies are disregarded as possible solutions by the measure of geometric construction analysis, and the singular optimal problem can be avoided by the technique of variable elastic modulus. The IFA can speed up the convergence and then obtain a reasonable result, and the effectiveness of the IFA is demonstrated through a selection of benchmark examples.

The remainder of this paper is structured as follows. Section 2 describes the fundamentals of the FA and IFA. Section 3 presents a general framework of the size and topology optimization of trusses with discrete design variables. Additionally, two numerical examples are presented in Section 4. Finally, the paper ends in Section 5 with main conclusions.

2. Firefly Algorithm (FA) and Improved Firefly Algorithm (IFA)

2.1. Standard FA. The FA is a recent nature-inspired metaheuristic algorithm developed by Yang (2009 ) which is inspired by the flashing behavior of fireflies. The FA has the following three idealized assumptions.

(a) All fireflies are unisex, so that one firefly can be attracted to other fireflies regardless of their sexes.

(b) Attractiveness is proportional to brightness; thus for any two flashing fireflies, the less bright firefly will move towards the brighter one. Both attractiveness and brightness decrease as the distance between fireflies increases. If there is no firefly brighter than a particular firefly, that firefly will move randomly.

(c) The brightness of a firefly is affected or determined by the landscape of the objective function.

Based on these three assumptions, there are two essential components of the FA, the variation of the light intensity and the formulation of the attractiveness. The latter one is assumed to be determined by the brightness of a firefly which in turn is related to the objective function of the problem being studied. Based on the idealized assumption (c), the original light intensity of firefly It is the objective function value of the optimization problem:

[I.sub.i] = f([x.sub.i])> (1)

where f([x.sub.i]) is the objective function of the problem being studied, and [x.sub.i] is a vector which represents the position of the firefly i.

As light intensity transmitting in nature, the light intensity decreases as the distance from the light source increases. Therefore, a monotonically decreasing function can express the variation of light intensity. For a given medium with a fixed light absorption coefficient [gamma], the light intensity It of firefly i seen by firefly j whose distance from firefly i is [r.sub.ij] can be

[mathematical expression not reproducible], (2)

where the distance between fireflies i and j at [x.sub.i] and [x.sub.j] can be defined as the Cartesian distance [r.sub.ij] = [parallel][x.sub.i] - [x.sub.j][parallel]

Inspired by (2), the attractiveness also decreases as the distance from the light source increases. Since a firefly's attractiveness is proportional to the light intensity seen by other fireflies, the variation of attractiveness should be a monotonically decreasing function as well. Therefore, the attractiveness of firefly i to attract firefly j whose distance from firefly i is [r.sub.ij] can be defined by

[mathematical expression not reproducible], (3)

where[[beta].sub.0] is the attractiveness; when r = 0 it is commonly set to 1.

Based on these, the firefly j is attracted to another more attractive (brighter) firefly i and its next iteration position is determined by

[x.sub.j] (t+ 1) = [x.sub.j] (t) + [[beta].sub.ij] ([r.sub.ij]) ([x.sub.i] (t) - [x.sub.j] (t)) + [alpha][[epsilon].sub.j], (4)

where t is the iteration number, [[epsilon].sub.j] is a random vector (e.g., the standard Gaussian random vector in which the mean value is 0 and the standard deviation is 1), and [alpha] is the randomization parameter. The second term of (4) represents the attraction between the fireflies and the third term is the random movement. Equation (4) can be called the position update formula.

A swarm of fireflies which contains n fireflies is generated in the preliminary stage of optimization process. A firefly whose position is a multidimensional vector containing multiple design variables corresponds to a candidate solution of optimization problem. Under the effect of attraction, new candidate solutions are chosen in the process in which fire flies update their position constantly.

2.2. Improved Firefly Algorithm (IFA)

2.2.1. Discretization of FA. The FA has proven to be an effective metaheuristic search mechanism on continuous optimization problems (Fister et al. 2013 ). Clearly, the standard FA cannot be applied directly to deal with size and topology optimization with discrete design variables as their positions are real numbers. There are many different techniques proposed to solve this problem, such as (1) utilizing a binary-coded technique to handle discrete variables (Datta and Figueira 2011 , Datta and Figueira 2013 ), (2) replacing the continuous variables by the closest discrete variables, (3) transforming the design variable X to [log.sub.10]X and carrying out the algorithm operation on [log.sub.10]X, (4) representing each discrete variable by an integer in ascending order and performing the algorithm operation on the integer (Ho-Huu et al. 2015 ), and (5) forming a linking relationship between the integers and discrete variables as in technique (4) and carrying out the algorithm operation on the integer by a series of formulas (T. Y. Chen and H. C. Chen 2009 ).

In this study, the discrete variables are arranged in ascending order. Represent each discrete variable by an integer in ascending order. Perform the algorithm operation on the integer. In addition, the initial positions of fireflies and the position updating formula are discretized to avoid the appearance of noninteger.

(1) Discretization of Initial Positions of the Fireflies. Initial positions of the fireflies, which consist of continuous real variables in standard FA, demand to be discretized so that they can be composed of discrete integer variables. The modified initial position of firefly j can be

[x.sub.j] = round ([[x.sub.ji], [x.sub.j2], ..., [x.sub.ji], ..., [x.sub.jn]], 5)

where [x.sub.ji] is the ith element of position of firefly j, n is the number of optimization variables, and the product round means integer conversion.

(2) Discretization of the Position Updating Formula. As the second term and third term of position update formula may be nonintegers, these terms need to be discretized to ensure the updated positions of fireflies are integers. The modified position updates formula can be

[x.sub.j] (t+1) = [x.sub.j] (t) + round ([[beta].sub.ij] ([r.sub.ij]) ([x.sub.i] (t) - [x.sub.j]- (t))) + round ([alpha][[epsilon].sub.j]). (6)

The above two parts of discretization can ensure that the initial and updated positions of each firefly are discrete integer variables, and then the FA can be applied to optimization problems with discrete design variables.

2.2.2. Improved Strategies of IFA. There is a drawback that the standard FA algorithm performs in a slow speed and with a high risk of falling in one of the poor local optima when solving a large solution space optimization problem. The reason is obviously that the initial individuals widely distributed in the large solution space lead to larger distances among each individual and smaller attractiveness. As a result, the moving distance of each individual is too small to find better solutions. To make up the defect which is difficult to be solved by tuning the parameters of [[beta].sub.0] and [gamma], the IFA is proposed by adding the linear attractiveness and improving the original attractiveness.

(1) Random-Weight. In order to enhance the global exploration in the initial stage of the search process in which fireflies move in a large space, the strategy of random-weight is embedded in the proposed algorithm. The strategy of random-weight can be

[omega] = random ([[omega].sub.min] [[omega].sub.max])> (7)

where [[omega].sub.max] and [[omega].sub.min] are upper and lower limit of random-weight [omega], respectively, determined based on plenty of trial calculation.

(2) Improved Attractiveness. To improve the local exploration (the ability of escaping from poor local optima accurately and fast), avoid excessive pace for location updating, and lead to repeated oscillation in the last stage of the search process where the algorithm depends mainly on the local search, the attractiveness [[beta].sub.ij] is improved as follows:

[mathematical expression not reproducible], (8)

where [beta] can be called basic attractiveness which is a constant value and fixed in 0.15 in this paper. [[beta].sub.0] and [gamma] are commonly set to 1 and (0.5 * L * [summation] [d.sup.2.sub.i]).sup.1/2], respectively, where L is the length of position vector of firefly, and [d.sub.i] is the range of ith element of firefly.

With the strategies of random-weight and improved attractiveness, the improved position update formula is proposed:

[mathematical expression not reproducible], (9)

where [t.sub.a] is the number of iteration step which embeds the strategy of random-weight.

In this section, the IFA is presented by discretizing the initial positions of fireflies and the position updating formula, embedding the random-weight and improving the attractiveness. This algorithm will be applied in the size and topology optimization for trusses with discrete design variables with an enhanced performance based on the Ground Structure Approach. Some essential techniques will be introduced in the next section.

3. Size and Topology Optimization for Trusses

The Ground Structure Approach is followed in the proposed methodology. This scheme, initially proposed by Dorn et al., starts with a universal truss containing all (or almost all) possible member connections among all nodes in the structure. Afterwards, the topology optimization procedure is applied to discard the unnecessary members. Simultaneously, the size optimization for the trusses is performed by changing the cross-sectional area of the remaining structural members. This optimization procedure seeks the minimum structural weight of the truss subject to stress and displacement constraints.

3.1. Problem Formulation. With the Ground Structure Approach, size and topology optimization can be transformed into size optimization, while the vector A = [([A.sub.1], [A.sub.2], ..., [A.sub.m]).sup.T] only includes size design variables. When the value of size variables becomes zero, this member is removed and topology of the structure changes. Thus, the optimization problem can be posed as

[mathematical expression not reproducible], (10)

where A is a candidate solution of the optimization problem, [A.sub.i] is the cross-sectional area of the ith member, W is the structural weight, [[rho].sub.i] is the specific weight of the ith member material, [L.sub.i] is the length of ith member, [[sigma].sub.i,l] and [[sigma].sup.max.sub.i,l] are the stress and the maximum allowable stress of the ith member under Zth load case, respectively, [[delta].sub.k,l] and [[delta].sup.max.sub.k,l] are the displacement and maximum allowable displacement of the node k under Zth load case, respectively, S = [S.sub.1], [S.sub.2],..., [S.sub.n]) is the discrete set of member cross-section, [S.sub.1] [right arrow] 0 means that the member is deleted, and n is the number of elements of S. It should be mentioned here that A, [A.sub.i], and W are equivalent to the location of firefly, the ith element of location of firefly, and the light intensity of firefly, respectively, in IFA. In the optimization process, the member's cross-section and structural topology are adjusted by changing the cross-section number of each member which represents a cross-section area arranged in the discrete set S with the order from small to large.

In this methodology, the penalty function method, one of the most common constraint handling approaches, is employed to handle the constraints. The penalty function is defined as follows:

[mathematical expression not reproducible], (11)

where [g.sub.i] (A) is the ith constraint of the optimization problem; [[bar.g].sub.j] is the allowable value of ith constraint; v denotes the sum of the violated constraints; m is the number of constraints in the problem; e is chosen considering the exploration and the exploitation rates of the search space. In this study, the parameter e starts from 1 and then linearly increases to 5. Then, the objective function is defined as follows:

f = W + penal. (12)

3.2. Variable Elastic Modulus Technique. Researchers are apt to be confronted with singular optimums when using Ground Structure Approach to solve topology optimization problems. The singular optimums problems are caused by replacing the section of canceled member with a smaller value for the purpose of changing the topology. They may cause great difficulties of member removal or insertion during the process of optimization. Essentially, the measure using a smaller value to replace the section of canceled member may cause its stress (which is supposed to be zero) to be greater than the allowable stress. Therefore, we can set the stress of canceled member to zero to avoid the singular optimums problems.

In the static analysis by Finite Element Method, the displacement of structure can be obtained by

[K] {[delta]} = {P}, (13)

where [K] is the structure global or total stiffness matrix, {[delta]} is the vector of nodal displacement, and {P} is the vector of global nodal force. Then, the internal forces of the structural elements can be obtained by

[{[bar.F]}.sup.(i)] = [[[bar.K]].sup.(i)] [T] [{[delta]}.sup.(i)], (14)

where [{[bar.F]}.sup.(i)], [[[bar.K]].sup.(i)], [T], and [{[delta]}.sup.(i)] are the vector of internal forces, the stiffness matrix, transfer matrix, and the vector of nodal displacement of ith element, respectively.

From (13) and (14), there are two measures to set the axial forces of canceled members to zero in the static analysis with Finite Element Method. One is setting the displacement of nodes connected to the canceled members to be zero, and the other is setting the element stiffness matrix of the canceled members to null matrix. However, observing from (13), the displacement of nodes connected to many members including canceled ones is difficult to be set to zero in practice; this is because as long as retained members are connected, the displacement of nodes cannot be set to zero. Thereupon, from (14), the measure of variable modulus of elasticity by which the element stiffness matrix of canceled member is set to null matrix is the only feasible method to set the axial forces of canceled members to zero and avoid the singular optimum problems.

3.3. Geometric Construction Analysis. Because structural topology is randomly generated by the IFA, the geometric construction analysis is implemented as a necessary measure to disregard the presence of unstable systems. This measure is applied by checking the positive definiteness of the global stiffness matrix of structure. After geometric construction analysis, a static analysis is performed for each structure and a large value is assigned to unstable systems to reduce unnecessary computation cost. And then, the penalty function whose value has the function of reflecting the degree of a structure in violation of the constraint is applied to the stable structures.

It is notable that, in the process of geometric composition analysis, useless nodes will turn up without connected member in the structure. There is no doubt that the useless nodes should be deleted. In this paper, these nodes are treated as fixed hinge bearing to avoid causing the singular global stiffness matrix of the structure if these nodes were deleted.

3.4. Truss Size and Topology Optimization Process. A size and topology optimization framework of trusses with discrete variables based on the IFA is put forward in this section. Its flow chart is shown in Figure 1, where t means the iteration number. And the optimization will stop when the iteration number reaches the maximum number of iterations which is set artificially.

4. Numerical Examples

To investigate the effectiveness of the proposed IFA for size and topology optimization of trusses with discrete variables, two benchmark examples are illustrated in this section. The results are compared with the solutions of FA or other algorithms. In order to investigate the stability of the IFA which is caused by the stochastic nature of the algorithm, each example is run several times independently, and the average values and variance are presented along with the optimal results.

For structural optimization problems, the stopping condition should be set to have a relation with the search ability of the algorithm (like the convergence of the algorithm). This is because it is not easy to determine an adequate number of maximum iterations if the reference solutions of problems are not known. In Ho-Huu et al.'s (2016 , 2016 ) research, they finish the searching progress either when the absolute value of deviation of the objective function of the best individual and the whole population is less than or equal to the previously assigned value of the tolerance or when the maximum number of iterations is achieved. However, the stopping condition is set to reach the maximum iteration in this study. This is because the required iteration using these algorithms to solve the benchmark examples which have been studied by many scholars can be estimated and plenty of trial calculation has been done.

4.1. The 25-Bar Spatial Truss Example. The size and topology optimization for a 25-bar spatial truss is examined as the first example. The topology and nodal numbering of the 25-bar spatial truss structure is shown in Figure 2 (unit: cm), and the form of the supports is fixed hinge bearing. 25 bars are categorized into 8 groups using their symmetry: (1) A1, (2) A2-A5, (3) A6-A9, (4) A10-A11, (5) A12-A13, (6) A14-A17, (7) A18-A21, and (8) A22-A25. The density of the material is considered as 2.768 x [10.sup.3] kg/[m.sup.3] and the modulus of elasticity is taken as 6.987 x [10.sup.4] MPa. The stress constraints vary for each group as shown in Table 1. Maximum displacement limitation of0.899 cm is imposed on node 1 and node 2 in x and y directions. In this example, the structure is subject to two load cases listed in Table 2. The set of discrete cross-sectional areas is {0.774,1.355, 2.142, 3.348, 4.065, 4.632, 6.542, 7.742, 9.032, 10.839, 12.671, 14.581, 21.483, 34.839, 44.516, 52.903, 60.258, 65.226} [cm.sup.2]. The parameters of different algorithms used in this example are listed in Table 3. This example is run 60 times independently.

The best solution vectors, the corresponding weights, and the required number of analyses obtained by the present and some other algorithms for the size and topology optimization of 25-bar spatial trusses are shown in Table 4. The IFA is more efficient than others for the reason that the weight of best solution obtained by the IFA is the lightest, and the number of required analyses by the IFA is the least.

Table 5 shows the statistical results of the optimum solutions for the FA and IFA which include the minimum weight (the best solution), the maximum weight (the worst solution), the probability of the best solution, the average weight, and the variance. Both the FA and IFA can find the best solution of 256.91 kg whose topology is shown in Figure 3. However, the IFA has a better performance for the reason that the IFA has a higher probability to find the best solution, and the maximum weight and the average weight obtained by the IFA are lighter than the FA. Besides, the variance of the IFA is lower than the FA. Therefore, it is further proved that the IFA is more stable.

The convergence history of the average weight of the 60 times is shown in Figure 4. Comparison of the convergence curves above provides some useful points about the differences of the two algorithms. In the initial stage of the search process in which the fireflies move in a larger solution space, the IFA has a higher convergence rate than the FA. It proves that the IFA performs an excellent global exploration in that stage. In the last stage, the IFA performs a slighter higher convergence rate to reach the final result than FA. It should be noted that the structure found by the IFA at any iteration is much lighter than that found by the FA at the same iteration. Above performances can be interpreted as the improvement strategies improve the exploration capabilities and convergence rate of the standard algorithm.

4.2. The 72-Bar Spatial Truss Example. The second example is the size and topology optimization for a 72-bar spatial truss. In order to investigate the function of improved attractiveness in the search process of IFA for large solution space of the size and topology optimization problem, the FA only improve attractiveness (referred to as IAFA) and the FA only with random-weight (referred to as RWFA) are applied in this example.

The topology and nodal numbering of the 72-bar spatial truss structure are illustrated in Figure 5 (unit: cm), and the form of the supports is fixed hinge bearing. The total 72 structural members of this spatial truss are categorized as 16 groups using symmetry: (1) Al-A4, (2) A5-A12, (3) A13-A16, (4) A17-A18, (5) A19-A22, (6) A23-A30, (7) A31-A34, (8) A35-A36, (9) A37-A40, (10) A41-A48, (11) A49-A52, (12) A53-A54, (13) A55-A58, (14) A59-A66, (15) A67-A70, and (16) A71-A72. The density of the material is considered as 2767.990 kg/[m.sup.3] and the modulus of elasticity is taken as 68,950 MPa. The members are subject to the stress limits of [+ or -] 172.375 MPa. The nodes are subject to the displacement limits of [+ or -] 0.635 cm. In this example, the structure is subject to two load cases listed in Table 6. The discrete cross-sectional areas are displayed in Table 7. The parameters of different algorithms used in this example are listed in Table 8. This example is run 100 times independently.

The best solution vectors, the corresponding weights, and the required number of analyses obtained by four different algorithms for the size and topology optimization of the 72-bar spatial truss are shown in Table 9. The IFA is more efficient because the IFA obtains the best solution with the least number of analyses. Moreover, Figure 6 illustrates two typical topologies of the available solutions obtained by IFA. It should be noted that the topology in Figure 6(a) achieves the best weight. Figure 6(b) shows that the topology consists of fewer members.

All solutions of the FA, IAFA, RWFA, and IFA are shown in Figure 7, and Table 10 demonstrates the statistical results of these solutions. It should be mentioned that an available solution means the error between the obtained solution and the best solution is less than 2.0 kg. Only RWFA and IFA can find the best solution of 167.04 kg which is meaningfully lighter than that of the FA and IAFA. Moreover, all statistical results of the IFA are better than other algorithms. It is proved that the IFA has a remarkable performance in solving size and topology optimization problem of trusses with discrete variables in such a large search space. It should be noted that the variances of IFA and RWFA which obtain the strategy of random-weight are obviously reduced. It can be concluded that the strategy of random-weight has the function to enhance the stability and improve the accuracy. This effect can be reflected intuitively in Figure 7.

The convergence curves of the average weight for 100 times and the best solution are shown in Figures 8 and 9, respectively. Comparison of the average convergence curves above provides some useful information about the differences of the two algorithms. In the initial stage of the search process, the IFA has the highest convergence rate, followed by RWFA, IAFA, and FA. This explains that the strategy of random-weight owns the superior global search ability and the strategy of improved attractiveness can further increase the global search ability of algorithm if it is combined with the strategy of random-weight. However, the solo strategy of improved attractiveness only performs the limited search ability for the large search space. In the last stage in which the algorithm depends mainly on the local search, the IFA performs a slighter higher convergence rate to reach the final result than RWFA. It indicates that the strategy of improved attractiveness can enhance the local exploration.

Besides, the FA and IAFA converge to unavailable solutions, which is the phenomenon of suffering the premature convergence problem. Despite the IAFA with the solo strategy of improved attractiveness which is supposed to gain a better solution, the convergence curve shows that the convergence of IAFA is worse than that of the FA. It indicates that the solo strategy of improved attractiveness cannot improve the FA and even leads to fall in an unavailable local optimal solution much earlier.

As a whole, the strategies applied by the IFA have a remarkable effect in improving the exploitation and exploration capabilities, accuracy, convergence rate, and stability of the algorithm.

5. Conclusions

Based on the Firefly Algorithm, an Improved Firefly Algorithm is proposed to conduct the size and topology optimization for trusses with discrete design variables in this paper. The main conclusions are as follows:

(1) By embedding the random-weight and enhancing the attractiveness, the performance of standard Firefly Algorithm is improved and thus the Improved Firefly Algorithm is proposed.

(2) Based on the Ground Structure Approach, size and topology optimization for trusses with discrete design variables is formulated using the single size variables which are capable of including topology variables. And with two essential techniques of variable elastic modulus technology and geometric construction analysis, an optimization method for the topological design of trusses based on the Improved Firefly Algorithm is proposed.

(3) The effectiveness of the IFA in size and topology optimization for trusses with discrete variables is demonstrated through the numerical examples of a 25-bar spatial truss and a 72-bar spatial truss. The solutions of these problems using IFA are compared to those obtained using different optimization algorithms. The numerical results reveal that the strategies of random-weight and improved attractiveness have a remarkable effect in improving the exploitation and exploration capabilities, accuracy, convergence rate, and stability of the algorithm. Last but not least, the remarkable performance of IFA in solving these problems also proves that IFA owns a stronger robustness.

https://doi.org/10.1155/2017/1457297

Conflicts of Interest

The authors declare that they have no conflicts of interest.

Acknowledgments

The work has been supported by the National Natural Science Foundation of China (Grant no. 51378150 and Grant no. 51578186).

References

 G. Rozvany and N. Olhoff, Topology Optimization of Structures and Composite Continua, vol. 7, Springer Science and Business Media, 2001.

 A. G. M. Michell, "The limits of economy of material in frame structures," Philosophical Magazine Ser, vol. 8, pp. 589-597, 1904.

 J. C. Maxwell, "On reciprocal figures, frames and diagrams of forces," Edinb Roy Soc Proc, vol. 7, pp. 160-208,1970.

 W. S. Dorn, "Automatic design of optimal structures," Journal de Mecanique, vol. 3, 1964.

 M. W. Dobbs and L. P. Felton, "Optimization of truss geometry," ASCE Journal of Structural Division, vol. 95, pp. 2105-2118, 1969.

 U. Kirsch and B. H. V. Topping, "Minimum weight design of structural topologies," Journal of Structural Engineering, vol. 118, no. 7, pp. 1770-1785, 1992.

 S. L. Lipson and L. B. Gwin, "Discrete sizing of trusses for optimal geometry," Journal of the Structural Division, vol. 103, no. 5, pp. 1031-1046, 1977

 H. C. Sun, S. Chai, Y. Wang, and L. S. Shi, Discrete Optimum Design of Structures, Dalian University of Technology, 1995.

 B. Jarraya and A. Bouri, "Metaheuristic optimization backgrounds: a literature review," International Journal of Contemporary Business Studies, vol. 3, p. 12, 2012.

 S. Y. Wang and K. Tai, "Structural topology design optimization using genetic algorithms with a bit-array representation," Computer Methods in Applied Mechanics and Engineering, vol. 194, no. 36-38, pp. 3749-3770, 2005.

 H. Zhou, "Topology optimization of compliant mechanisms using hybrid discretization model," Journal of Mechanical Design, vol. 132, no. 11, Article ID 111003, 2010.

 R. Balamurugan, C. V. Ramakrishnan, and N. Singh, "Performance evaluation of a two stage adaptive genetic algorithm (TSAGA) in structural topology optimization," Applied Soft Computing Journal, vol. 8, no. 4, pp. 1607-1624, 2008.

 R. Balamurugan, C. V. Ramakrishnan, and N. Swaminathan, "A two phase approach based on skeleton convergence and geometric variables for topology optimization using genetic algorithm," Structural and Multidisciplinary Optimization, vol. 43, no. 3, pp. 381-404, 2011.

 C. Jain and A. Saxena, "An improved material-mask overlay strategy for topology optimization of structures and compliant mechanisms," Journal of Mechanical Design, vol. 132, no. 6, pp. 0610061-06100610, 2010.

 J. F. A. Madeira, H. L. Pina, and H. C. Rodrigues, "GA topology optimization using random keys for tree encoding of structures," Structural and Multidisciplinary Optimization, vol. 40, no. 1-6, pp. 227-240, 2010.

 G.-C. Luh and C.-H. Chueh, "Multi-modal topological optimization of structure using immune algorithm," Computer Methods in Applied Mechanics and Engineering, vol. 193, no. 3638, pp. 4035-4055, 2004.

 W. A. Bennage and A. K. Dhingra, "Optimization of truss topology using tabu search," International Journal for Numerical Methods in Engineering, vol. 38, no. 23, pp. 4035-4052, 2005.

 A. Kaveh, B. Hassani, S. Shojaee, and S. M. Tavakkoli, "Structural topology optimization using ant colony methodology," Engineering Structures, vol. 30, no. 9, pp. 2559-2565, 2008.

 G.-C. Luh and C.-Y. Lin, "Structural topology optimization using ant colony optimization algorithm," Applied Soft Computing Journal, vol. 9, no. 4, pp. 1343-1353, 2009.

 G.-C. Luh, C.-Y. Lin, and Y.-S. Lin, "A binary particle swarm optimization for continuum structural topology optimization," Applied Soft Computing Journal, vol. 11, no. 2, pp. 2833-2844, 2011.

 P. Y. Shim and S. Manoochehri, "Generating optimal configurations in structural design using simulated annealing," International Journal for Numerical Methods in Engineering, vol. 40, no. 6, pp. 1053-1069, 1997.

 K. S. Lee and Z. W. Geem, "A new structural optimization method based on the harmony search algorithm," Computers and Structures, vol. 82, no. 9-10, pp. 781-798, 2004.

 C. Wu and K. Tseng, "Topology optimization of structures using modified binary differential evolution," Structural and Multidisciplinary Optimization, vol. 42, no. 6, pp. 939-953, 2010.

 O. Sigmund, "On the usefulness of non-gradient approaches in topology optimization," Structural and Multidisciplinary Optimization, vol. 43, no. 5, pp. 589-596, 2011.

 X. S. Yang, "Firefly algorithms for multimodal optimization," in Lecture Notes in Computer Science, pp. 169-178, 2009.

 I. Fister, I. Fister Jr., X.-S. Yang, and J. Brest, "A comprehensive review of firefly algorithms," Swarm and Evolutionary Computation, vol. 13, no. 1, pp. 34-46, 2013.

 L. F. F. Miguel, R. H. Lopez, and L. F. F. Miguel, "Multimodal size, shape, and topology optimisation of truss structures using the firefly algorithm," Advances in Engineering Software, vol. 56, no. 2, pp. 23-37, 2013.

 S. Chai, L. S. Shi, and H. C. Sun, "Topology optimization of truss structures with discrete variables including two kinds of variables," Acta Mechanica Sinica, vol. 31, pp. 574-584, 1999 (Chinese).

 H. L. Luo, Research on genetic-tabu algorithms for topology optimization of structures with discrete variables Beijing, Beijing University of Technology, 2006, (Chinese).

 D. Datta and J. R. Figueira, "A real-integer-discrete-coded particle swarm optimization for design problems," Applied Soft Computing Journal, vol. 11, no. 4, pp. 3625-3633, 2011.

 D. Datta and J. R. Figueira, "A real-integer-discrete-coded differential evolution," Applied Soft Computing Journal, vol. 13, no. 9, pp. 3884-3893, 2013.

 V. Ho-Huu, T. Nguyen-Thoi, M. H. Nguyen-Thoi, and L. LeAnh, "An improved constrained differential evolution using discrete variables (D-ICDE) for layout optimization of truss structures," Expert Systems with Applications, vol. 42, no. 20, pp. 7057-7069, 2015.

 T. Y. Chen and H. C. Chen, "Mixed-discrete structural optimization using a rank-niche evolution strategy," Engineering Optimization, vol. 41, no. 1, pp. 39-58, 2009.

 V. Ho-Huu, T. Nguyen-Thoi, T. Vo-Duy, and T. Nguyen-Trang, "An adaptive elitist differential evolution for optimization of truss structures with discrete design variables," Computers and Structures, vol. 165, pp. 59-75, 2016.

 V. Ho-Huu, T. Nguyen-Thoi, T. Truong-Khac, L. Le-Anh, and T. Vo-Duy, "An improved differential evolution based on roulette wheel selection for shape and size optimization of truss structures with frequency constraints," Neural Computing and Applications, pp. 1-19, 2016.

Yue Wu, (1) Qingpeng Li, (1,2) Qingjie Hu, (3,4) and Andrew Borgart (2)

(1) Key Lab of Structures Dynamic Behavior and Control of the Ministry of Education, Harbin Institute of Technology, Harbin 150090, China

2) Faculty of Architecture and Built Environment, Delft University of Technology, Julianalaan 134, 2628 BL Delft, Netherlands

(3) Hangzhou Xiaoshan Urban Planning Institute, Hangzhou 311200, China

(4) Hangzhou Xiaoshan District Housing & Construction Bureau, Hangzhou 311200, China

Correspondence should be addressed to Qingpeng Li; hitssrclqp@gmail.com

Received 2 January 2017; Revised 14 March 2017; Accepted 23 April 2017; Published 4 June 2017

Academic Editor: Nantiwat Pholdee

Caption: Figure 1: Flow chart of size and topology optimization of trusses with discrete variables based on the IFA.

Caption: Figure 2: The 25-bar spatial truss structure.

Caption: Figure 3: Best topology for the size and topology optimization of the 25-bar spatial truss.

Caption: Figure 4: Convergence history of the average weight of the 60 times for the size and topology optimization problem of the 25-bar spatial truss.

Caption: Figure 5: The 72-bar spatial truss structure.

Caption: Figure 6: Best topology for the size and topology optimization of 72- bar spatial.

Caption: Figure 7: All solutions for the size and topology optimization of 72bar spatial truss.

Caption: Figure 8: Convergence history of the average weight for the size and topology optimization of the 72-bar spatial truss.

Caption: Figure 9: Convergence history of the best solution for the size and topology optimization of the 72-bar spatial truss.
```Table 1: Allowable stress for each member.

Group            (1)          (2)          (3)          (4)

[[sigma].bar]    -242.044     -79.941      -119.36      -242.044
[bar.[sigma]]    275.896      275.896      275.896      275.896

Group            (5)          (6)          (7)          (8)

[[sigma].bar]    -242.044     -46.619      -46.619      -76.437
[bar.[sigma]]    275.896      275.896      275.896      275.896

Table 2: Load cases of 25-bar spatial truss.

Case   Node   [P.sub.x]/KN   [P.sub.y]/KN    [P.sub.z]/KN

1          44.5           44.5           -22.25
1      2           0             44.5           -22.25
3         2.225            0                0
6         2.225            0                0

2      1           0             89.0           -22.25
2           0            -89.0           -22.25

Table 3: Parameters for the different algorithm.

Algorithm    [alpha]   [beta]    [gamma]   [[omega].sub.min]

FA             1.5       --       0.02            --
IFA            1.5      0.15      0.02            0.9

Algorithm    [[omega].sub.max]   [t.sub.a]     t      n

FA                  --               --       250     15
IFA                 1.1              50       250     15

Table 4: Optimum solutions of the 25-bar spatial truss for the
different algorithms.

Optimal cross-sectional areas ([cm.sup.2])

Element                RDQA                     GATS
group                  (Chaietal. 1999 )    (Luo 2006 )

(1)                    0                        0
(2)                    12.671                   10.839
(3)                    21.483                   21.483
(4)                    0                        0
(5)                    0                        0
(6)                    6.452                    7.742
(7)                    14.581                   12.671
(8)                    14.581                   14.581
Weight (kg)            275.0                    262.97
Number of structural   --                       750
static analyses

Optimal cross-sectional
areas ([cm.sup.2])

Element                   FA        IFA
group

(1)                       0          0
(2)                     10.839     10.839
(3)                     21.483     21.483
(4)                       0          0
(5)                       0          0
(6)                     6.452      6.452
(7)                     12.671     12.671
(8)                     14.581     14.581
Weight (kg)             256.91     256.91
Number of structural     1245       570
static analyses

Table 5: The statistical results of the optimum solutions for 25-bar
size and truss optimization problem.

Algorithm    Minimum      Maximum      Probability of the best solution

FA           256.91 kg    565.61 kg    93.3%
IFA          256.91 kg    256.91 kg    100%

Algorithm    Average      Variance

FA           262.07 kg    1588.02
IFA          256.91 kg    0

Table 6: Load cases of 25-bar spatial truss.

Node                     Case 1

[P.sub.x]/kN     [P.sub.y]/kN     [P.sub.z]/kN

(17)        22.25            22.25            -22.25
(18)         0.0              0.0              0.0
(19)         0.0              0.0              0.0
(20)         0.0              0.0              0.0

Node                 Case 2

[P.sub.x]    [P.sub.y]     [P.sub.z]/kN

(17)       0.0          0.0           -22.25
(18)       0.0          0.0           -22.25
(19)       0.0          0.0           -22.25
(20)       0.0          0.0           -22.25

Table 7: The available cross-section areas.

Number              [mm.sup.2]

(1)                    71.613
(2)                    90.968
(3)                   126.451
(4)                   161.290
(5)                   198.064
(6)                   252.258
(7)                   285.161
(8)                   363.225
(9)                   388.386
(10)                  494.193
(11)                  506.451
(12)                  641.289
(13)                  645.160
(14)                  729.031
(15)                  792.256
(16)                  816.773
(17)                  939.998
(18)                 1008.385
(19)                 1045.159
(20)                 1161.288
(21)                 1283.868
(22)                 1374.191
(23)                 1535.481
(24)                 1690.319
(25)                 1696.771
(26)                 1858.061
(27)                 1890.319
(28)                 1993.544
(29)                 2180.641
(30)                 2238.705
(31)                 2290.318
(32)                 2341.931
(33)                 2477.414
(34)                 2496.769
(35)                 2503.221
(36)                 2696.769
(37)                 2722.575
(38)                 2896.768
(39)                 2961.284
(40)                 3096.768
(41)                 3206.445
(42)                 3303.219
(43)                 3703.218
(44)                 4658.055
(45)                 5141.925
(46)                 5503.215
(47)                 5999.988
(48)                 6999.986
(49)                 7419.430
(50)                 8709.660
(51)                 8967.724
(52)                 9161.272
(53)                 9999.980
(54)                10322.560
(55)                10903.204
(56)                12129.008
(57)                12838.684
(58)                14193.520
(59)                14774.164
(60)                15806.420
(61)                17096.740
(62)                18064.480
(63)                19354.800
(64)                21612.860

Table 8: Parameters for the different algorithm.

Algorithm      [alpha]   [beta]    [gamma]   [[omega].sub.min]

FA             1.5       --        0.01      --
IAFA           1.5       0.15      0.01      --
RWFA           1.5       --        0.01      0.8
IFA            1.5       0.15      0.01      0.8

Algorithm      [[omega].sub.max]   [t.sub.a]     t      n

FA             --                  --           500    35
IAFA           --                  --           500    35
RWFA           1.2                 200          500    35
IFA            1.2                 200          500    35

Table 9: Optimum solutions of the 72-bar spatial truss for the
different algorithms.

Element group          Optimal cross-sectional areas ([mm.sup.2])

FA           IAFA         RWFA         IFA

(1)                    2180.641     2180.641     1283.868     1283.868
(2)                    729.031      252.258      363.225      363.225
(3)                    729.031      0.000        0.000        0.000
(4)                    729.031      0.000        0.000        0.000
(5)                    494.193      792.256      792.256      792.256
(6)                    161.290      285.161      285.161      285.161
(7)                    729.031      0.000        0.000        0.000
(8)                    729.031      0.000        0.000        0.000
(9)                    729.031      729.031      363.225      363.225
(10)                   198.064      285.161      363.225      363.225
(11)                   0.000        729.031      0.000        0.000
(12)                   729.031      729.031      71.613       71.613
(13)                   71.613       90.968       126.451      126.451
(14)                   729.031      363.225      363.225      363.225
(15)                   729.031      729.031      285.161      285.161
(16)                   729.031      161.290      363.225      363.225
Weight (kg)            197.80       220.84       167.04       167.04
Number of analyses     12635        14875        14280        9520

Table 10: The statistical results of the optimum solutions for 72-bar
size and truss optimization problem.

Algorithm    Minimum      Maximum        Probability of
available solution

FA           197.80 kg    390.12 kg             0%
IAFA         220.84 kg    449.27 kg             0%
RWFA         167.04 kg    237.34 kg            76%
IFA          167.04 kg    171.02 kg            95%

Algorithm    Average      Variance

FA           273.44 kg    1499.634
IAFA         289.85 kg    1534.114
RWFA         170.26 kg    72.128
IFA          167.58 kg    0.507
```
COPYRIGHT 2017 Hindawi Limited
No portion of this article can be reproduced without the express written permission from the copyright holder.