An evolution strategy in structural optimization problems for plates and shells

2012 ◽  
Vol 94 (4) ◽  
pp. 1461-1470 ◽  
Author(s):  
Aleksander Muc ◽  
Małgorzata Muc-Wierzgoń
Author(s):  
Georg Thierauf ◽  
Jianbo Cai

Abstract A method for the solution of mixed-discrete structural optimization problems based on a two level parallel evolution strategy is presented. On the first level, the optimization problem is divided into two subproblems with discrete and continuous design variables, respectively. The two subproblems are solved simultaneously on a parallel computing architecture. On the second level, each subproblem is further parallelized by means of a parallel sub-evolution-strategy. Periodically, the design variables in the two groups axe exchanged. Examples are included to demonstrate the implementation of this method on a 8 nodes parallel computer.


2012 ◽  
Vol 215-216 ◽  
pp. 133-137
Author(s):  
Guo Shao Su ◽  
Yan Zhang ◽  
Zhen Xing Wu ◽  
Liu Bin Yan

Covariance matrix adaptation evolution strategy algorithm (CMA-ES) is a newly evolution algorithm. It has become a powerful tool for solving highly nonlinear multi-peak optimization problems. In many real-world optimization problems, the location of multiple optima is often required in a search space. In order to evaluate the solution, thousands of fitness function evaluations are involved that is a time consuming or expensive processes. Therefore, conventional stochastic optimization methods meet a special challenge for a very large number of problem function evaluations. Aiming to overcome the shortcoming of stochastic optimization methods in the high calculation cost, a truss optimal method based on CMA-ES algorithm is proposed and applied to solve the section and shape optimization problems of trusses. The study results show that the method is feasible and has the advantages of high accuracy, high efficiency and easy implementation.


Author(s):  
Ali Kaveh ◽  
S.R. Hoseini Vaez ◽  
Pedram Hosseini

In this study, the Modified Dolphin Monitoring (MDM) operator is used to enhance the performance of some metaheuristic algorithms. The MDM is a recently presented operator that controls the population dispersion in each iteration. Algorithms are selected from some well-established algorithms. Here, this operator is applied on Differential Evolution (DE), Particle Swarm Optimization (PSO), Genetic Algorithm (GA), Vibrating Particles System (VPS), Enhanced Vibrating Particles System (EVPS), Colliding Bodied Optimization (CBO) and Harmony Search (HS) and the performance of these algorithms are evaluated with and without this operator on three well-known structural optimization problems. The results show the performance of this operator on these algorithms for the best, the worst, average and average weight of the first quarter of answers.


Sign in / Sign up

Export Citation Format

Share Document