2011
1
2
2
375
TOPOLOGY OPTIMIZATION OF DOUBLE LAYER GRIDS FOR EARTHQUAKE LOADS USING A TWO-STAGE ESO-ACO METHOD
2
2
A two-stage optimization method is presented by employing the evolutionary structural optimization (ESO) and ant colony optimization (ACO), which is called ESO-ACO method. To implement ESO-ACO, size optimization is performed using ESO, first. Then, the outcomes of ESO are employed to enhance ACO. In optimization process, the weight of double layer grid is minimized under various constraints which artificial ground motion is used to calculate the structural responses. The presence or absence of elements in bottom and web grids and also cross-sectional areas are selected as design variables. The numerical results reveal the computational advantages and effectiveness of the proposed method.
211
232
M.
Mashayekhi
M.
Mashayekhi
M.J.
Fadaee
M.J.
Fadaee
J.
Salajegheh
J.
Salajegheh
E.
Salajegheh
E.
Salajegheh
double layer grids; topology optimization; earthquake loads; ant colony optimization; evolutionary structural optimization
[## ##]
THE CMA EVOLUTION STRATEGY BASED SIZE OPTIMIZATION OF TRUSS STRUCTURES
2
2
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.
233
256
A.
Kaveh
A.
Kaveh
M.
Kalateh-Ahani
M.
Kalateh-Ahani
M.S.
Masoudi
M.S.
Masoudi
The covariance matrix adaptation evolution strategy; metaheuristics; space truss structures; size optimization
[## ##]
OPTIMIZATION OF ENDURANCE TIME ACCELERATION FUNCTIONS FOR SEISMIC ASSESSMENT OF STRUCTURES
2
2
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.
257
277
A.
Nozari
A.
Nozari
H.E.
Estekanchi
H.E.
Estekanchi
response history analysis, Endurance Time method, Intensifying acceleration functions, Numerical optimization, Nonlinear least squares
[## ##]
THE EFFECTS OF INITIAL SAMPLING AND PENALTY FUNCTIONS IN OPTIMAL DESIGN OF TRUSSES USING METAHEURISTIC ALGORITHMS
2
2
Although Genetic algorithm (GA), Ant colony (AC) and Particle swarm optimization algorithm (PSO) have already been extended to various types of engineering problems, the effects of initial sampling beside constraints in the efficiency of algorithms, is still an interesting field. In this paper we show that, initial sampling with a special series of constraints play an important role in the convergence and robustness of a metaheuristic algorithm. Random initial sampling, Latin Hypercube Design, Sobol sequence, Hammersley and Halton sequences are employed for approximating initial design. Comparative studies demonstrate that well distributed initial sampling speeds up the convergence to near optimal design and reduce the required computational cost of purely random sampling methodologies. In addition different penalty functions that define the Augmented Lagrangian methods considered in this paper to improve the algorithms. Some examples presented to show these applications.
279
304
S.
Shojaee
S.
Shojaee
S.
Hasheminasab
S.
Hasheminasab
Metaheuristic algorithms; optimal design; initial sampling; constraint; trusses
[## ##]
AN EFFICIENT CHARGED SYSTEM SEARCH USING CHAOS
2
2
The Charged System Search (CSS) is combined to chaos to solve mathematical global optimization problems. The CSS is a recently developed meta-heuristic optimization technique inspired by the governing laws of physics and mechanics. The present study introduces chaos into the CSS in order to increase its global search mobility for a better global optimization. Nine chaos-based CSS (CCSS) methods are developed, and then for each variant, the performance of ten different chaotic maps is investigated to identify the most powerful variant. A comparison of these variants and the standard CSS demonstrates the superiority and suitability of the selected variants for the benchmark mathematical optimization problems.
305
325
S.
Talatahari
S.
Talatahari
A.
Kaveh
A.
Kaveh
R.
Sheikholeslami
R.
Sheikholeslami
Charged system search; chaos; optimization; chaos-based charged system search algorithm
[## ##]
OPTIMUM DESIGN OF STRUCTURES USING AN IMPROVED FIREFLY ALGORITHM
2
2
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.
327
340
S.
Kazemzadeh Azad
S.
Kazemzadeh Azad
S.
Kazemzadeh Azad
S.
Kazemzadeh Azad
design optimization; truss structures; sizing optimization; geometry optimization; firefly algorithm; nature-inspired algorithms
[## ##]
PSEUDO-RANDOM DIRECTIONAL SEARCH: A NEW HEURISTIC FOR OPTIMIZATION
2
2
Meta-heuristics have already received considerable attention in various fields of engineering optimization problems. Each of them employes some key features best suited for a specific class of problems due to its type of search space and constraints. The present work develops a Pseudo-random Directional Search, PDS, for adaptive combination of such heuristic operators. It utilizes a short term memory via indirect information share between search agents and the directional search inspired by natural swarms. Treated numerical examples illustrate the PDS performance in continuous and discrete design spaces.
341
355
M.
Shahrouzi
M.
Shahrouzi
Pseudo-random directional search, ant system, particle swarm optimization, characteristic graph
[## ##]
CONSTRAINED BIG BANG-BIG CRUNCH ALGORITHM FOR OPTIMAL SOLUTION OF LARGE SCALE RESERVOIR OPERATION PROBLEM
2
2
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.
357
375
M.H.
Afshar
M.H.
Afshar
I.
Motaei
I.
Motaei
Reservoir operation; large scale; big-bang big-crunch; optimisation
[## ##]