International Journal of Optimization in Civil Engineering
http://ijoce.iust.ac.ir
Iran University of Science & Technology - Journal articles for year 2011, Volume 1, Number 3Yektaweb Collection - http://www.yektaweb.comen2011/9/10AN EFFICIENT HYBRID ALGORITHM BASED ON PARTICLE SWARM AND SIMULATED ANNEALING FOR OPTIMAL DESIGN OF SPACE TRUSSES
http://www.iust.ac.ir/ijoce/browse.php?a_id=46&sid=1&slc_lang=en
<font size="2">In this paper, an efficient optimization algorithm is proposed based on Particle Swarm Optimization (PSO) and Simulated Annealing (SA) to optimize truss structures. The proposed algorithm utilizes the PSO for finding high fitness regions in the search space and the SA is used to perform further investigation in these regions. This strategy helps to use of information obtained by swarm in an optimal manner and to direct the agents toward the best regions, resulting in possible reduction of the number of particles. To show the computational advantages of the new PSO-SA method, some benchmark numerical examples are studied. The PSO-SA algorithm converges to better or at least the same solutions, while the number of structural analyses is significantly reduced </font>A. KavehTOPOLOGY OPTIMIZATION OF COMPOSITE MATERIALS WITH OPTIMAL STIFFNESS AND THERMAL CONDUCTIVITY
http://www.iust.ac.ir/ijoce/browse.php?a_id=47&sid=1&slc_lang=en
<font size="2">This paper presents the bidirectional evolutionary structural optimization (BESO) method for the design of two-phase composite materials with optimal properties of stiffness and thermal conductivity. The composite material is modelled by microstructures in a periodical base cell (PBC). The homogenization method is used to derive the effective bulk modulus and thermal conductivity. BESO procedures are presented to optimize the two individual properties and their various combinations. Three numerical examples are studied. The results agree well with those of the benchmark microstructures and the Hashin-Shtrikman (HS) bounds. </font>X.Y. YangPREDICTION OF NONLINEAR TIME HISTORY DEFLECTION OF SCALLOP DOMES BY NEURAL NETWORKS
http://www.iust.ac.ir/ijoce/browse.php?a_id=48&sid=1&slc_lang=en
<font size="2">This study deals with predicting nonlinear time history deflection of scallop domes subject to earthquake loading employing neural network technique. Scallop domes have alternate ridged and grooves that radiate from the centre. There are two main types of scallop domes, lattice and continuous, which the latticed type of scallop domes is considered in the present paper. Due to the large number of the structural nodes and elements of scallop domes, nonlinear time history analysis of such structures is time consuming. In this study to reduce the computational burden radial basis function (RBF) neural network is utilized. The type of inputs of neural network models seriously affects the computational performance and accuracy of the network. Two types of input vectors: cross-sectional properties and natural periods of the structures can be employed for neural network training. In this paper the most influential natural periods of the structure are determined by adaptive neuro-fuzzy inference system (ANFIS) and then are used as the input vector of the RBF network. Results of illustrative example demonstrate high performance and computational accuracy of RBF network. </font>R. KamyabESTIMATING THE VULNERABILITY OF THE CONCRETE MOMENT RESISTING FRAME STRUCTURES USING ARTIFICIAL NEURAL NETWORKS
http://www.iust.ac.ir/ijoce/browse.php?a_id=49&sid=1&slc_lang=en
<font size="2">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. </font>F.R. RofooeiOPTIMAL CONSTRAINED DESIGN OF STEEL STRUCTURES BY DIFFERENTIAL EVOLUTIONARY ALGORITHMS
http://www.iust.ac.ir/ijoce/browse.php?a_id=50&sid=1&slc_lang=en
<font size="2">Structural optimization, when approached by conventional (gradient based) minimization algorithms presents several difficulties, mainly related to computational aspects for the huge number of nonlinear analyses required, that regard both Objective Functions (OFs) and Constraints. Moreover, from the early '80s to today's, Evolutionary Algorithms have been successfully developed and applied as a computational alternative to many optimization problems, such as structural ones. In this study the effectiveness of a relatively new Evolutionary Algorithm, namely Differential Evolutionary, is investigated for constrained optimization. This presents many interesting advantages and so that it is a candidate to be widely used in many real structural optimization problems. The algorithm version here used has been developed by hybridizing some recent versions of Differential Evolutionary algorithms proposed in literature, and uses a specific way for dealing with constraints which, always, concern real structural optimization problems. The effectiveness of proposed approach has been demonstrated by developing two cases of study, which regard simple but very significant structural problems for steel structures, one of which is a standard benchmark in structural optimization. The analyses show the simplicity and effectiveness of the proposed approach, so that it can be suitably ready for practical uses out of academic contest. </font>R. GrecoOPTIMIZATION TO IDENTIFY MUSKINGUM MODEL PARAMETERS USING IMPERIALIST COMPETITIVE ALGORITHM
http://www.iust.ac.ir/ijoce/browse.php?a_id=51&sid=1&slc_lang=en
<font size="2">In engineering, flood routing is an important technique necessary for the solution of a floodcontrol problem and for the satisfactory operation of a flood-prediction service. A simple conceptual model like the Muskingum model is very effective for the flood routing process. One challenge in application of the Muskingum model is that its parameters cannot be measured physically. In this article we proposed imperialist competitive algorithm (ICA) for optimal parameter estimation of the linear Muskingum model. This algorithm uses imperialism and imperialistic competition process as a source of inspiration. Optimization to identify Muskingum model parameters can be considered as a suitable field to investigate the efficiency of this algorithm. </font>R. SheikholeslamiSHAPE OPTIMIZATION OF STRUCTURES BY MODIFIED HARMONY SEARCH
http://www.iust.ac.ir/ijoce/browse.php?a_id=52&sid=1&slc_lang=en
<font size="2">The main aim of the present study is to propose a modified harmony search (MHS) algorithm for size and shape optimization of structures. The standard harmony search (HS) algorithm is conceptualized using the musical process of searching for a perfect state of the harmony. It uses a stochastic random search instead of a gradient search. The proposed MHS algorithm is designed based on elitism. In fact the MHS is a multi-staged version of the HS and in each stage a new harmony memory is created using the information of the previous stages. Numerical results reveal that the proposed algorithm is a powerful optimization technique with improved exploitation characteristics compared with the standard HS. </font>S. GholizadehEVALUATING EFFICIENCY OF BIG-BANG BIG-CRUNCH ALGORITHM IN BENCHMARK ENGINEERING OPTIMIZATION PROBLEMS
http://www.iust.ac.ir/ijoce/browse.php?a_id=53&sid=1&slc_lang=en
<font size="2">Engineering optimization needs easy-to-use and efficient optimization tools that can be employed for practical purposes. In this context, stochastic search techniques have good reputation and wide acceptability as being powerful tools for solving complex engineering optimization problems. However, increased complexity of some metaheuristic algorithms sometimes makes it difficult for engineers to utilize such techniques in their applications. Big- Bang Big-Crunch (BB-BC) algorithm is a simple metaheuristic optimization method emerged from the Big Bang and Big Crunch theories of the universe evolution. The present study is an attempt to evaluate the efficiency of this algorithm in solving engineering optimization problems. The performance of the algorithm is investigated through various benchmark examples that have different features. The obtained results reveal the efficiency and robustness of the BB-BC algorithm in finding promising solutions for engineering optimization problems. </font>S. Kazemzadeh Azad