---

Optimal design of large-scale structures is a rather difficult task and the computational efficiency of the currently available methods needs to be improved. In view of this, the paper presents a modified Charged System Search (CSS) algorithm. The new methodology is based on the combination of CSS and Particle Swarm Optimizer. In addition, in order to improve optimization search, the sequence of tasks entailed by the optimization process is changed so that the updating of the design variables can directly be performed after each movement. In this way, the new method acts as a single-agent algorithm while preserving the positive characteristics of its original multi-agent formulation.

---

This paper is concerned with application and evaluation of ant colony optimization (ACO) method to practical structural optimization problems. In particular, a size optimum design of pin-jointed truss structures is considered with ACO such that the members are chosen from ready sections for minimum weight design. The application of the algorithm is demonstrated using two design examples with practical design considerations. Both examples are formulated according to provisions of ASD-AISC (Allowable Stress Design Code of American Institute of Steel Institution) specification. The results obtained are used to discuss the computational characteristics of ACO for optimum design of truss type structures.

---

Many methods have been developed for structural size and configuration optimization in which cross-sectional areas are usually assumed to be continuous. In most practical structural engineering design problems, however, the design variables are discrete. This paper proposes two efficient structural optimization methods based on the harmony search (HS) heuristic algorithm that treat both discrete sizing variables and integrated discrete sizing and continuous geometric variables. The HS algorithm uses a stochastic random search instead of a gradient search so the former has a new-paradigmed derivative. Several truss examples from the literature are also presented to demonstrate the effectiveness and robustness of the new method, as compared to current optimization methods.

---

Earthquake time history records are required to perform dynamic nonlinear analyses. In order to provide a suitable set of such records, they are scaled to match a target spectrum as introduced in the well-known design codes. Corresponding scaling factors are taken similar in practice however, optimizing them reduces extra-ordinary economic charge for the seismic design. In the present work a new hybrid meta-heuristic is developed combining key features from genotypic search and particle swarm optimization. The method is applied to an illustrative example via a parametric study to evaluate its effectiveness and less probability of premature convergence compared with the standard particle swarm optimization.

---

In some cases the optimum is the minimum of the objective function (mathematical optimum), but in other cases the optimum is given by a technical constraint (technical optimum). The present paper shows the both types in two problems. The first problem is to find the optimum dimensions of a ring-stiffened circular cylindrical shell subject to external pressure, which minimize the structural cost. The calculation shows that the cost decreases when the shell diameter decreases. The decrease of diameter is limited by a fabrication constraint that the diameter should be minimum 2 m to make it possible the welding and painting inside of the shell. The second problem is to find the optimum dimensions of a cantilever column loaded by compression and bending. The column is constructed as circular or conical unstiffened shell. The cost comparison of both structural versions shows the most economic one.

---

Evolution Strategies (ES) are a class of Evolutionary Algorithms based on Gaussian mutation and deterministic selection. Gaussian mutation captures pair-wise dependencies between the variables through a covariance matrix. Covariance Matrix Adaptation (CMA) is a method to update this covariance matrix. In this paper, the CMA-ES, which has found many applications in solving continuous optimization problems, is employed for size optimization of steel space trusses. Design examples reveal competitive performance of the algorithm compared to the other advanced metaheuristics.

---

Numerical simulation of structural response is a challenging issue in earthquake engineering and there has been remarkable progress in this area in the last decade. Endurance Time (ET) method is a new response history based analysis procedure for seismic assessment and structural design in which structures are subjected to a gradually intensifying dynamic excitation and their seismic performance is evaluated based on their responses at different excitation levels. Generating appropriate artificial dynamic excitation is essential in this type of analysis. In this paper, an optimization procedure is presented for computation of the intensifying acceleration functions utilized in the ET method and the results of this procedure are discussed. A set of the ET acceleration functions (ETAFs) is considered which has been produced utilizing numerical optimization considering 2048 acceleration points as optimization variables by an unconstrained optimization procedure. The ET formulation is then modified from the continuous time condition into the discrete time state thus the optimization problem is reformulated as a nonlinear least squares problem. In this way, a second set of the ETAFs is generated which better satisfies the proposed objective function. Subsequently, acceleration points are increased to 4096, for 40 seconds duration, and the third set of the ETAFs is produced using a multi level optimization procedure. Improvement of the ETAFs is demonstrated by analyzing several SDOF systems.

---

Nature-inspired search algorithms have proved to be successful in solving real-world optimization problems. Firefly algorithm is a novel meta-heuristic algorithm which simulates the natural behavior of fireflies. In the present study, optimum design of truss structures with both sizing and geometry design variables is carried out using the firefly algorithm. Additionally, to improve the efficiency of the algorithm, modifications in the movement stage of artificial fireflies are proposed. In order to evaluate the performance of the proposed algorithm, optimum designs found are compared to the previously reported designs in the literature. Numerical results indicate the efficiency and robustness of the proposed approach.

---

A constrained version of the Big Bang-Big Crunch algorithm for the efficient solution of the optimal reservoir operation problems is proposed in this paper. Big Bang-Big Crunch (BB-BC) algorithm is a new meta-heuristic population-based algorithm that relies on one of the theories of the evolution of universe namely, the Big Bang and Big Crunch theory. An improved formulation of the algorithm named Constrained Big Bang-Big Crunch (CBB-BC) is proposed here and used to solve the problems of reservoir operation. In the CBB-BC algorithm, all the problems constraints are explicitly satisfied during the solution construction leading to an algorithm exploring only the feasible region of the original search space. The proposed algorithm is used to optimally solve the water supply and hydro-power operation of “Dez” reservoir in Iran over three different operation periods and the results are presented and compared with those obtained by the basic algorithm referred to here as Unconstrained Big Bang–Big Crunch (UBB–BC) algorithm and other optimization algorithms including Genetic Algorithm (GA), Ant Colony Optimization (ACO) and Particle Swarm Optimization (PSO) and those obtained by Non-Linear Programming (NLP) technique. The results demonstrate the efficiency and robustness of the proposed method to solve reservoir operation problems compared to alternative algorithms.

---

Heavy economic losses and human casualties caused by destructive earthquakes around the world clearly show the need for a systematic approach for large scale damage detection of various types of existing structures. That could provide the proper means for the decision makers for any rehabilitation plans. The aim of this study is to present an innovative method for investigating the seismic vulnerability of the existing concrete structures with moment resisting frames (MRF). For this purpose, a number of 2-D structural models with varying number of bays and stories are designed based on the previous Iranian seismic design code, Standard 2800 (First Edition). The seismically–induced damages to these structural models are determined by performing extensive nonlinear dynamic analyses under a number of earthquake records. Using the IDARC program for dynamic analyses, the Park and Ang damage index is considered for damage evaluation of the structural models. A database is generated using the level of induced damages versus different parameters such as PGA, the ratio of number of stories to number of bays, the dynamic properties of the structures models such as natural frequencies and earthquakes. Finally, in order to estimate the vulnerability of any typical reinforced MRF concrete structures, a number of artificial neural networks are trained for estimation of the probable seismic damage index.

---

In this paper nonlinear analysis of structures are performed considering material and geometric nonlinearity using force method and energy concepts. For this purpose, the complementary energy of the structure is minimized using ant colony algorithms. Considering the energy term next to the weight of the structure, optimal design of structures is performed. The first part of this paper contains the formulation of the complementary energy of truss and frame structures for the purpose of linear analysis. In the second part material and geometric nonlinearity of structure is considered using Ramberg-Osgood relationships. In the last part optimal simultaneous analysis and design of structure is studied. In each part, the efficiency of the methods is illustrated by means simple examples.

---

A hybrid meta-heuristic optimization method is introduced to efficiently find the optimal shape of concrete gravity dams including dam-water-foundation rock interaction subjected to earthquake loading. The hybrid meta-heuristic optimization method is based on a hybrid of gravitational search algorithm (GSA) and particle swarm optimization (PSO), which is called GSA-PSO. The operation of GSA-PSO includes three phases. In the first phase, a preliminary optimization is accomplished using GSA as local search. In the second phase, an optimal initial swarm is produced using the optimum result of GSA. Finally, PSO is employed to find the optimum design using the optimal initial swarm. In order to reduce the computational cost of dam analysis subject to earthquake loading, weighted least squares support vector machine (WLS-SVM) is employed to accurately predict dynamic responses of gravity dams. Numerical results demonstrate the high performance of the hybrid meta-heuristic optimization for optimal shape design of concrete gravity dams. The solutions obtained by GSA-PSO are compared with those of GSA and PSO. It is revealed that GSA-PSO converges to a superior solution compared to GSA and PSO, and has a lower computation cost.

---

Different kinds of meta-heuristic algorithms have been recently utilized to overcome the complex nature of optimum design of structures. In this paper, an integrated optimization procedure with the objective of minimizing the self-weight of real size structures is simply performed interfacing SAP2000 and MATLAB® softwares in the form of parallel computing. The meta-heuristic algorithm chosen here is Cuckoo Search (CS) recently developed as a type of population based algorithm inspired by the behavior of some Cuckoo species in combination with the Lévy flight behavior. The CS algorithm performs suitable selection of sections from the American Institute of Steel Construction (AISC) wide-flange (W) shapes list. Strength constraints of the AISC load and resistance factor design specification, geometric limitations and displacement constraints are imposed on frames. Effective time-saving procedure using simple parallel computing, as well as utilizing reliable analysis and design tool are also some new features of the present study. The results show that the proposed method is effective in optimizing practical structures.

---

The main contribution of the present paper is to train efficient neural networks for seismic design of double layer grids subject to multiple-earthquake loading. As the seismic analysis and design of such large scale structures require high computational efforts, employing neural network techniques substantially decreases the computational burden. Square-on-square double layer grids with the variable length of span and height are considered. Back-propagation (BP), radial basis function (RBF) and generalized regression (GR) neural networks are trained for efficiently prediction of the seismic design of the structures. The numerical results demonstrate the superiority of the GR over the BP and RBF neural networks.

---

The present study is an attempt to propose a mutation-based real-coded genetic algorithm (MBRCGA) for sizing and layout optimization of planar and spatial truss structures. The Gaussian mutation operator is used to create the reproduction operators. An adaptive tournament selection mechanism in combination with adaptive Gaussian mutation operators are proposed to achieve an effective search in the design space. The standard deviation of design variables is used as a key factor in the adaptation of mutation operators. The reliability of the proposed algorithm is investigated in typical sizing and layout optimization problems with both discrete and continuous design variables. The numerical results clearly indicated the competitiveness of MBRCGA in comparison with previously presented methods in the literature.

---

This paper investigates the optimized parameters for the tuned liquid column dampers to decrease the earthquake vibrations of high-rise buildings. Considering soil effects, the soilstructure interaction (SSI) is involved in this model. The Tuned Liquid Column Damper (TLCD) is also utilized on the roof of the building. Since the TLCD is a nonlinear device, the time domain analysis based on nonlinear Newmark method is employed to obtain the displacement, velocity and acceleration of different stories and TLCD. To illustrate the results, Kobe earthquake data is applied to the model. In order to obtain the best settings for TLCD, different parameters of TLCD are examined with constant mass quantity. The effective length, head loss coefficient, cross sectional ratio and length ratio of TLCD are assumed as the design variables. The objective is to reduce the maximum absolute and Root Mean Square (RMS) values of displacement and acceleration during earthquake vibration. The results show that the TLCDs are very effective and beneficial devices for decreasing the oscillations of high-rise buildings. It is indicated that the soil type highly affects the suitable parameters of TLCD subjected to the earthquake oscillations. This study helps the researchers to the better understanding of earthquake vibration of the structures including soil effects, and leads the designers to achieve the optimized TLCD for the high-rise buildings.

---

Endurance Time Acceleration Functions are specially predesigned intensifying excitation functions that their amplitude increases with time. On the other hand, wavelet transform is a mathematical tool that indicates time variations of frequency in a signal. In this paper, an approach is presented for generating endurance time acceleration functions (ETAFs) whose response spectrum is compatible with the European Code regulations (EC8) elastic spectrum. Method applied is a modification of data in time and frequency domain. For this purpose, wavelet transform has been used to decompose a series of random points to several levels such that each level covers a special range of frequency, then every level is divided into the numbers of equal time intervals and each interval of time is multiplied by a variable. Subsequently, the mathematical unconstrained optimization algorithm is used to calculate the variables and minimize error between response and target spectra. The prosed procedure is used in two methods. Then with two methods, two different acceleration functions are produced.

---

The purpose of this paper is to present a polynomial time algorithm which determines the lot sizes for purchase component in Material Requirement Planning (MRP) environments with deterministic time-phased demand with zero lead time. In this model, backlog is not permitted, the unit purchasing price is based on the all-units discount system and resale of the excess units is possible at the ordering time. The properties of an optimal order policy are argued and on the basis of them, a branch and bound algorithm is presented to construct an optimal sequence of order policies. In the proposed B&B algorithm, some useful fathoming rules have been proven to make the algorithm very efficient. By defining a rooted tree graph, it has been shown that the worst-case time complexity function of the presented algorithm is polynomial. Finally, some test problems which are randomly generated in various environments are solved to show the efficiency of the algorithm.

---

The cumulative resource constraints of the resource-constrained project scheduling problem (RCPSP) do not treat the resource demands as geometric rectangles, that is, activities are not necessarily assigned to the same resource units over their processing times. In spite of this fact, most papers on resource-constrained project scheduling mainly in the motivation phase use a strip packing of rectangles (SPR) like visualization to illustrate the resource allocation. A novice researcher inspired by the "artistic" SPR visualization may think that the "rectangles" are essential elements of the RCPSP, and that the RCPSP is a special counter-intuitive strip packing problem (SPP) which can be solved without explicitly defined strip packing constraints. In this context "artistic" means, that we have to use a "drawing tool" to produce a SPR like visualization, because the standard model of the RCPSP knows nothing about the rectangles. In the RCPSP, the rectangles can be torn vertically and horizontally, which is absurd in the SPP, and the existence of a cumulative solution is only a necessary but not sufficient condition of the existence of the SPR like visualization, as proven by several researchers. Therefore the popular SPR visualization is theoretically wrong and misleading, and hides a real problem, which is connected to the dedicated resource assignment. In this paper, we prove that replacing the rectangles with a set of strips with unit height we can always generate a theoretically correct strip packing of strips (SPS) like dedicated assignment, where dedicated means that each demand unit is served by exactly one resource unit over its duration without "hidden" transfer time and cost.

---

In this paper we present a unified (probabilistic/possibilistic) model for resource-constrained project scheduling problem (RCPSP) with uncertain activity durations and a concept of a heuristic approach connected to the theoretical model. It is shown that the uncertainty management can be built into any heuristic algorithm developed to solve RCPSP with deterministic activity durations. The essence and viability of our unified model are illustrated by fuzzy examples presented in the recent fuzzy RCPSP literature.