Structural Optimization of Building Materials Using Optimality Criteria Approach and its Realization in ANSYS

2011 ◽  
Vol 321 ◽  
pp. 55-58 ◽  
Author(s):  
Ruo Hong Zhao
Keyword(s):  
Structural Optimization ◽  
Optimization Algorithm ◽  
Design Variable ◽  
Building Materials ◽  
Iteration Process ◽  
Optimization Procedure ◽  
Optimality Criteria ◽  
Iteration Algorithm ◽  
Explicit Formulation ◽  
Key Points

In this paper, the structural optimization of building materials is discussed focusing on the explicit formulation of the constraints and the optimal iteration algorithm. The whole optimization procedure was realized by programming using the APDL provided by the commercial software ANSYS. Some key points in programming are discussed such as how to determine a design variable is active or inactive during optimization iteration process. Finally an example was illustrated to demonstrate the validation of the optimization algorithm and the programming method using APDL.

Structural Optimization of Composite Panel with Lamination Parameters and Equivalent Stiffness Laminate Method

2014 ◽  
Vol 496-500 ◽  
pp. 429-435
Author(s):  
Xiao Ping Zhong ◽  
Peng Jin
Keyword(s):  
Genetic Algorithm ◽  
Structural Optimization ◽  
Composite Structure ◽  
Optimization Procedure ◽  
Optimization Method ◽  
Composite Panel ◽  
Analysis Tool ◽  
Equivalent Stiffness ◽  
Lamination Parameters ◽  
Design Variables

Firstly, a two-level optimization procedure for composite structure is investigated with lamination parameters as design variables and MSC.Nastran as analysis tool. The details using lamination parameters as MSC.Nastran input parameters are presented. Secondly, with a proper equivalent stiffness laminate built to substitute for the lamination parameters, a two-level optimization method based on the equivalent stiffness laminate is proposed. Compared with the lamination parameters-based method, the layer thicknesses of the equivalent stiffness laminate are adopted as continuous design variables at the first level. The corresponding lamination parameters are calculated from the optimal layer thicknesses. At the second level, genetic algorithm (GA) is applied to identify an optimal laminate configuration to target the lamination parameters obtained. The numerical example shows that the proposed method without considering constraints of lamination parameters can obtain better optimal results.

Peloton Dynamics Optimization: Algorithm for Discrete Structural Optimization

2021 ◽  
Vol 147 (10) ◽  
pp. 04021164
Author(s):  
Gérard Jacques Poitras ◽  
Gabriel Cormier ◽  
Armel Stanislas Nabolle
Keyword(s):  
Structural Optimization ◽  
Optimization Algorithm

A New ERR and Strategy for Bi-Directional Evolutionary Structural Optimization

2012 ◽  
Vol 204-208 ◽  
pp. 4422-4428
Author(s):  
Da Ke Zhang ◽  
Wen Pan Zhang ◽  
Han He ◽  
Chong Wang
Keyword(s):  
Structural Optimization ◽  
Stress Level ◽  
Optimization Procedure ◽  
Optimal Process ◽  
Removal Ratio ◽  
Rejection Ratio ◽  
Evolutionary Structural Optimization ◽  
Rejection Criterion ◽  
Element Addition ◽  
Element Removal

The efficiency of the element removal or addition is of significance for evolutionary structural optimization (ESO) process. The key is to find an appropriate rejection criterion (RC) which allows to assess the contribution of each element to the specified behavior（stress, stiffness, displacement, etc.）of the structure, and to subsequently remove elements with least contribution. This paper proposed a varying elements removal ratio (VERR) method which uses a larger ERR (Element Rejection Ratio) value at early iterations where exist a lot of redundant material, and decreases the value of ERR in the optimal process to lessen the number of elements removed at later iterations. Meanwhile, this paper proposed a strategy for element addition based on stress level and the contribution of elements to the structure in order to decide which elements should be added to the model and the sequence of the element addition. With the proposed VERR and the strategy, the optimization procedure of the structure evolves more quickly and smoothly.

scholarly journals A Hybrid Backtracking Search Optimization Algorithm with Differential Evolution

2015 ◽  
Vol 2015 ◽  
pp. 1-16 ◽  
Author(s):  
Lijin Wang ◽  
Yiwen Zhong ◽  
Yilong Yin ◽  
Wenting Zhao ◽  
Binqing Wang ◽  
...  
Keyword(s):  
Differential Evolution ◽  
Optimization Algorithm ◽  
Iteration Process ◽  
Global Optimum ◽  
Backtracking Search ◽  
De Algorithm ◽  
Search Optimization ◽  
Backtracking Search Optimization Algorithm ◽  
Mutation Strategies ◽  
Multimodal Problems

The backtracking search optimization algorithm (BSA) is a new nature-inspired method which possesses a memory to take advantage of experiences gained from previous generation to guide the population to the global optimum. BSA is capable of solving multimodal problems, but it slowly converges and poorly exploits solution. The differential evolution (DE) algorithm is a robust evolutionary algorithm and has a fast convergence speed in the case of exploitive mutation strategies that utilize the information of the best solution found so far. In this paper, we propose a hybrid backtracking search optimization algorithm with differential evolution, called HBD. In HBD, DE with exploitive strategy is used to accelerate the convergence by optimizing one worse individual according to its probability at each iteration process. A suit of 28 benchmark functions are employed to verify the performance of HBD, and the results show the improvement in effectiveness and efficiency of hybridization of BSA and DE.

Cutter Location without Interference Based on Nine Points Optimization Algorithm

2013 ◽  
Vol 710 ◽  
pp. 325-328
Author(s):  
Li Han ◽  
Yue Zhang ◽  
You Jun Zhang ◽  
Tong Jiang
Keyword(s):  
Optimization Algorithm ◽  
Optimal Solution ◽  
Nc Machining ◽  
Iteration Algorithm ◽  
Search Range ◽  
Important Conclusion ◽  
Fast Calculation ◽  
Cutter Path ◽  
Point Set ◽  
Global Optimal

Cutter location without interference is the key question in complicated surface NC machining. Starting with the theory of minimum directed distance, this paper, aiming at the problem of cutter location path without interference in the NC machining, reaches an important conclusion that the nine points optimization algorithm based on change step and change search range can get the global optimal solution. Meanwhile, this algorithm solves the astringency problem in iteration algorithm, and avoids a number of point set calculations in the whole area. Due to its features of fast calculation, simple principal and so on, it turns out to be a very effective method to calculate cutter path in NC machining of complicated curved surface.

The Research of Information Retrieval Technology Based on Semantic Analysis

2014 ◽  
Vol 926-930 ◽  
pp. 2160-2163
Author(s):  
Ming Xu ◽  
Yun Ke
Keyword(s):  
Information Retrieval ◽  
Optimization Algorithm ◽  
Semantic Analysis ◽  
Retrieval Model ◽  
Common Information ◽  
Search Terms ◽  
Sorting Algorithms ◽  
Key Points ◽  
The Common ◽  
Semantic Expansion

The common information retrieval technology is mainly based on keyword matching and this kind of method only focuse on the optimization algorithm, ignoring the semantic research. This does not solve the fundamental semantic multiplicity, retrieve diversity, related web undetected, sort unstandardized. This paper is a study of these problems arise for the current proposed MIRSA information retrieval model based on semantic analysis. This model consists of the following four main key points: disambiguation method, semantic expansion algorithm, the search terms match strategy, web sorting algorithms. This model can effectively solve the problem of semantic multiplicity, avoid missed relevant pages and reasonably improve the sor of related pages.

AN ADAPTIVE RBF METHOD FOR DESIGN OPTIMIZATION OF BUILDING STRUCTURES

2020 ◽  
Vol 7 (1) ◽  
Author(s):  
Qian Wang ◽  
Lucas Schmotzer ◽  
Yongwook Kim
Keyword(s):  
Structural Optimization ◽  
Optimization Algorithm ◽  
Design Method ◽  
Building Structures ◽  
Design Constraint ◽  
Gradient Based ◽  
Structural Responses ◽  
Sample Points ◽  
Objective Function Values ◽  
Adaptive Metamodeling

Design of building structures has long been based on a trial-and-error iterative approach. Structural optimization provides practicing engineers an effective and efficient approach to replace the traditional design method. A numerical optimization algorithm, such as a gradient-based method or genetic algorithm (GA), can be applied, in conjunction with a finite element (FE) analysis program. The FE program is used to compute the structural responses, such as forces and displacements, which represent the design constraint functions. In this method, reading and writing the input/output files of the FE program and interface programming are required. Another method to perform structural optimization is to create an approximate constraint function, which involves implicit structural responses. This is referred to as a surrogate or metamodeling method. The structural responses can be expressed as approximate functions, based on a number of preselected sample points. In this study, an adaptive metamodeling method was studied and applied to a building structure. The FE analyses were first performed at the sample points, and metamodels were constructed. A gradient-based optimization algorithm was applied. Additional samples were generated and additional FE analyses were conducted so that the model accuracy could be improved, close to the optimal design points. This adaptive scheme was continued, until the objective function values converged. The method worked well and optimal designs were found within a few iterations.

Sign in / Sign up

Export Citation Format

Share Document