共查询到20条相似文献,搜索用时 15 毫秒
1.
C. S. Jog 《International journal for numerical methods in engineering》2001,50(7):1607-1618
Dual optimization algorithms for the topology optimization of continuum structures in discrete variables are gaining popularity in recent times since, in topology design problems, the number of constraints is small in comparison to the number of design variables. Good topologies can be obtained for the minimum compliance design problem when the perimeter constraint is imposed in addition to the volume constraint. However, when the perimeter constraint is relaxed, the dual algorithm tends to give bad results, even with the use of higher‐order finite element models as we demonstrate in this work. Since, a priori, one does not know what a good value of the perimeter to be specified is, it is essential to have an algorithm which generates good topologies even in the absence of the perimeter constraint. We show how the dual algorithm can be made more robust so that it yields good designs consistently in the absence of the perimeter constraint. In particular, we show that the problem of checkerboarding which is frequently observed with the use of lower‐order finite elements is eliminated. Copyright © 2001 John Wiley & Sons, Ltd. 相似文献
2.
C. S. Jog 《International journal for numerical methods in engineering》2009,77(4):502-517
Dual algorithms are ideally suited for the purpose of topology optimization since they work in the space of Lagrange multipliers associated with the constraints. To date, dual algorithms have been applied only for linear structures. Here we extend this methodology to the case of non‐linear structures. The perimeter constraint is used to make the topology problem well‐posed. We show that the proposed algorithm yields a value of perimeter that is close to that specified by the user. We also address the issue of manufacturability of these designs, by proposing a variant of the standard dual algorithm, which generates designs that are two‐dimensional although the loading and the geometry are three‐dimensional. Copyright © 2008 John Wiley & Sons, Ltd. 相似文献
3.
It is well known that the structural performance of lightweight cellular solids depends greatly on the design of the representative volume element (RVE). In this article, an integrated topology optimization procedure is developed for the global stiffness maximization of 2D periodic and cyclic-symmetry cellular solids. A design variable linking technique and a superelement method are applied to model the structural periodicity and to reduce the computing time. In order to prevent the numerical instabilities associated with checkerboards in the design process, the quadratic perimeter constraint is used. Finally, the topology optimization problem is solved by the dual optimization algorithm. Several numerical examples are used to test the efficiency of the optimization procedure. Results show that the optimal topology of the RVE is not unique. It greatly depends on the size of the RVE. The computing efficiency can be greatly improved by means of the superelement technique. Also, for the optimal solution, the equivalent torsional rigidity has been compared with what is in the literature, to check the structural efficiency of the obtained topology. It has been observed that the current topology solution has the strongest rigidity when the same volume fraction of solid-phase materials is used. 相似文献
4.
Daisuke Murai Atsushi Kawamoto Tsuguo Kondoh 《International journal for numerical methods in engineering》2020,121(10):2246-2261
This article describes a numerical solution to the topology optimization problem using a time-evolution equation. The design variables of the topology optimization problem are defined as a mathematical scalar function in a given design domain. The scalar function is projected to the normalized density function. The adjoint variable method is used to determine the gradient defined as the ratio of the variation of the objective function or constraint function to the variation of the design variable. The variation of design variables is obtained using the solution of the time-evolution equation in which the source term and Neumann boundary condition are given as a negative gradient. The distribution of design variables yielding an optimal solution is obtained by time integration of the solution of the time-evolution equation. By solving the topology optimization problem using the proposed method, it is shown that the objective function decreases when the constraints are satisfied. Furthermore, we apply the proposed method to the thermal resistance minimization problem under the total volume constraint and the mean compliance minimization problem under the total volume constraint. 相似文献
5.
Techniques to suppress intermediate density in topology optimization of compliant mechanisms 总被引:1,自引:0,他引:1
Discrete topological problems are often relaxed with continuous design variables so that they can be solved using continuous
mathematical programming. Such practice prevails because large-scale discrete 0–1 mathematical programming is not generally
available. Although the relaxed problems become tractable, they may cause the appearance of intermediate density in the optimum
topologies, especially those of structures and compliant mechanisms. Various penalty schemes have been proposed to suppress
the intermediate density. Most of the past works assumed that the same penalty schemes could be effectively applied to both
problems of stiffest structure design and compliant mechanism design. Differences in nature between the problems are generally
neglected. This work distinguished the two problems, and observed that complaint mechanism (CM) problem does not suffer intermediate
density as seriously as minimum compliance (MC) problem does. Besides allocating more material, explicit and implicit penalties
were pursued to suppress intermediate density. To ensure mesh-independence and not to complicate the nonconvex objective function
in CM problem, a new technique using a constraint of explicit penalty with variable bound is proposed to suppress intermediate
density in topology optimization of compliant mechanisms. Together with a perimeter constraint, the new technique is also
applied to MC problem.
Received 13 March 2000 相似文献
6.
Albert A. Groenwold L. F. P. Etman 《International journal for numerical methods in engineering》2008,73(3):297-316
We study the ‘classical’ topology optimization problem, in which minimum compliance is sought, subject to linear constraints. Using a dual statement, we propose two separable and strictly convex subproblems for use in sequential approximate optimization (SAO) algorithms. Respectively, the subproblems use reciprocal and exponential intermediate variables in approximating the non‐linear compliance objective function. Any number of linear constraints (or linearly approximated constraints) are provided for. The relationships between the primal variables and the dual variables are found in analytical form. For the special case when only a single linear constraint on volume is present, we note that application of the ever‐popular optimality criterion (OC) method to the topology optimization problem, combined with arbitrary values for the heuristic numerical damping factor η proposed by Bendsøe, results in an updating scheme for the design variables that is identical to the application of a rudimentary dual SAO algorithm, in which the subproblems are based on exponential intermediate variables. What is more, we show that the popular choice for the damping factor η=0.5 is identical to the use of SAO with reciprocal intervening variables. Finally, computational experiments reveal that subproblems based on exponential intervening variables result in improved efficiency and accuracy, when compared to SAO subproblems based on reciprocal intermediate variables (and hence, the heuristic topology OC method hitherto used). This is attributed to the fact that a different exponent is computed for each design variable in the two‐point exponential approximation we have used, using gradient information at the previously visited point. Copyright © 2007 John Wiley & Sons, Ltd. 相似文献
7.
Muriel Beckers 《International journal for numerical methods in engineering》2000,48(12):1761-1784
The purpose of this paper is to present a mathematical programming method developed to solve structural optimization problems involving discrete variables. We work in the following context: the structural responses are computed by the finite elements method and convex and separable approximation schemes are used to generate a sequence of explicit approximate subproblems.Each of them is solved in the dual space with a subgradient‐based algorithm (or with a variant of it) specially developed to maximize the not everywhere differentiable dual function. To show that the application field is large, the presented applications are issued from different domains of structural design, such as sizing of thin‐walled structures, geometrical configuration of trusses, topology optimization of membrane or 3‐D structures and welding points numbering in car bodies. The main drawback of using the dual approach is that the obtained solution is generally not the global optimum. This is linked to the presence of a duality gap, due to the non‐convexity of the primal discrete subproblems. Fortunately, this gap can be quantified: a maximum bound on its value can be computed. Moreover, it turns out that the duality gap is decreasing for higher number of variables; the maximum bound on the duality gap is generally negligible in the treated applications. The developed algorithms are very efficient for 2‐D and 3‐D topology optimization, where applications involving thousands of binary design variables are solved in a very short time. Copyright © 2000 John Wiley & Sons, Ltd. 相似文献
8.
9.
Simultaneous optimal design of structural topology, actuator locations and control parameters for a plate structure 总被引:1,自引:0,他引:1
Simultaneous optimization with respect to the structural topology, actuator locations and control parameters of an actively
controlled plate structure is investigated in this paper. The system consists of a clamped-free plate, a H
2 controller and four surface-bonded piezoelectric actuators utilized for suppressing the bending and torsional vibrations
induced by external disturbances. The plate is represented by a rectangular design domain which is discretized by a regular
finite element mesh and for each element the parameter indicating the presence or absence of material is used as a topology
design variable. Due to the unavailability of large-scale 0–1 optimization algorithms, the binary variables of the original
topology design problem are relaxed so that they can take all values between 0 and 1. The popular techniques in the topology
optimization area including penalization, filtering and perimeter restriction are also used to suppress numerical problems
such as intermediate thickness, checkerboards, and mesh dependence. Moreover, since it is not efficient to treat the structural
and control design variables equally within the same framework, a nested solving approach is adopted in which the controller
syntheses are considered as sub processes included in the main optimization process dealing with the structural topology and
actuator locations. The structural and actuator variables are solved in the main optimization by the method of moving asymptotes,
while the control parameters are designed in the sub optimization processes by solving the Ricatti equations. Numerical examples
show that the approach used in this paper can produce systems with clear structural topology and high control performance.
Received 16 November 2001 / Accepted 26 February 2002 相似文献
10.
Dianzi Liu Vassili Toropov 《International Journal for Computational Methods in Engineering Science and Mechanics》2016,17(1):22-35
Multipoint approximation method (MAM) focuses on the development of metamodels for the objective and constraint functions in solving a mid-range optimization problem within a trust region. To develop an optimization technique applicable to mixed integer-continuous design optimization problems in which the objective and constraint functions are computationally expensive and could be impossible to evaluate at some combinations of design variables, a simple and efficient algorithm, coordinate search, is implemented in the MAM. This discrete optimization capability is examined by the well established benchmark problem and its effectiveness is also evaluated as the discreteness interval for discrete design variables is increased from 0.2 to 1. Furthermore, an application to the optimization of a lattice composite fuselage structure where one of design variables (number of helical ribs) is integer is also presented to demonstrate the efficiency of this capability. 相似文献
11.
基于梯度的优化方法对复合材料层合板进行了变刚度铺层优化设计。在优化过程中需确定铺层中各单元的密度以及角度。为了使优化结果具有可制造性,优化结果需满足制造工艺约束并且铺层角度需从预定角度中选取。为了避免在优化问题中引入过多的约束并减少设计变量的数目,提出密度分布曲线法(DDCM)对层合板中各单元的密度进行参数化。根据各单元的密度以及角度设计变量并基于Bi-value Coding Parameterization(BCP)方法中的插值公式确定各单元的弹性矩阵。优化过程中以结构柔顺度作为优化目标,结构体积作为约束,优化算法采用凸规划对偶算法。对碳纤维复合材料的算例结果表明:采用DDCM可得到较理想的优化结果,并且收敛速率较快。 相似文献
12.
On sequential approximate simultaneous analysis and design in classical topology optimization 下载免费PDF全文
Dirk Munro Albert A. Groenwold 《International journal for numerical methods in engineering》2017,110(3):227-247
We study the simultaneous analysis and design (SAND) formulation of the ‘classical’ topology optimization problem subject to linear constraints on material density variables. Based on a dual method in theory, and a primal‐dual method in practice, we propose a separable and strictly convex quadratic Lagrange–Newton subproblem for use in sequential approximate optimization of the SAND‐formulated classical topology design problem. The SAND problem is characterized by a large number of nonlinear equality constraints (the equations of equilibrium) that are linearized in the approximate convex subproblems. The availability of cheap second‐order information is exploited in a Lagrange–Newton sequential quadratic programming‐like framework. In the spirit of efficient structural optimization methods, the quadratic terms are restricted to the diagonal of the Hessian matrix; the subproblems have minimal storage requirements, are easy to solve, and positive definiteness of the diagonal Hessian matrix is trivially enforced. Theoretical considerations reveal that the dual statement of the proposed subproblem for SAND minimum compliance design agrees with the ever‐popular optimality criterion method – which is a nested analysis and design formulation. This relates, in turn, to the known equivalence between rudimentary dual sequential approximate optimization algorithms based on reciprocal (and exponential) intervening variables and the optimality criterion method. Copyright © 2016 John Wiley & Sons, Ltd. 相似文献
13.
受到可制造性的约束,拓扑优化技术目前多用于结构的概念设计,因此,研究直接面向加工制造的拓扑优化方法很有必要。该文基于启发式BESO(Bi-directional Evolutionary Structural Optimization)算法,提出了一种高效的可精确控制结构最小尺寸的拓扑优化方法。通过灵敏度插值,细化边界单元,改进BESO算法,解决边界不光滑问题;采用拓扑细化方法,提取拓扑结构的骨架构型;以此为基础,判定结构中不满足最小尺寸约束的部位,基于改进的BESO算法,实现拓扑优化结构的最小尺寸精确控制;此外,在优化过程中,通过松弛施加最小尺寸约束的方法,有效避免优化早熟问题。数值算例表明了该拓扑优化方法的有效性。 相似文献
14.
O. Hasançebi 《工程优选》2013,45(6):737-756
This article reports and investigates the application of evolution strategies (ESs) to optimize the design of truss bridges. This is a challenging optimization problem associated with mixed design variables, since it involves identification of the bridge’s shape and topology configurations in addition to the sizing of the structural members for minimum weight. A solution algorithm to this problem is developed by combining different variable-wise versions of adaptive ESs under a common optimization routine. In this regard, size and shape optimizations are implemented using discrete and continuous ESs, respectively, while topology optimization is achieved through a discrete version coupled with a particular methodology for generating topological variations. In the study, a design domain approach is employed in conjunction with ESs to seek the optimal shape and topology configuration of a bridge in a large and flexible design space. It is shown that the resulting algorithm performs very well and produces improved results for the problems of interest. 相似文献
15.
Hai Huang Haichao An Haibo Ma Shenyan Chen 《International journal for numerical methods in engineering》2019,117(3):291-315
This work presents an engineering method for optimizing structures made of bars, beams, plates, or a combination of those components. Corresponding problems involve both continuous (size) and discrete (topology) variables. Using a branched multipoint approximate function, which involves such mixed variables, a series of sequential approximate problems are constructed to make the primal problem explicit. To solve the approximate problems, genetic algorithm (GA) is utilized to optimize discrete variables, and when calculating individual fitness values in GA, a second-level approximate problem only involving retained continuous variables is built to optimize continuous variables. The solution to the second-level approximate problem can be easily obtained with dual methods. Structural analyses are only needed before improving the branched approximate functions in the iteration cycles. The method aims at optimal design of discrete structures consisting of bars, beams, plates, or other components. Numerical examples are given to illustrate its effectiveness, including frame topology optimization, layout optimization of stiffeners modeled with beams or shells, concurrent layout optimization of beam and shell components, and an application in a microsatellite structure. Optimization results show that the number of structural analyses is dramatically decreased when compared with pure GA while even comparable to pure sizing optimization. 相似文献
16.
鉴于拓扑优化和遗传算法在结构损伤识别中各自的优点,本文将遗传算法、有限元和拓扑优化三种方法相结合,提出了一种用于二维结构多损伤识别的新方法。这种方法将拓扑优化的设计变量和遗传算法的参数统一化,将拓扑优化中的目标函数和约束方程与遗传算法的适应度函数联系起来,并以拓扑优化的约束方程作为控制条件参与整个遗传运算的控制。采用二进制编码遗传算法代替连续变量拓扑优化的方式对发生孔洞损伤形式的二维结构进行损伤识别,避免了利用连续变量拓扑优化进行损伤识别时参数阈值的确定可能给识别结果带来的不良影响。通过对两个二维结构模型的多损伤识别仿真计算,结果显示本方法能够很好地识别二维结构中多个位置的损伤,对于仅用拓扑优化法很难识别的轻微孔洞损伤情况,该方法也能得出与实际情况吻合良好的结果。 相似文献
17.
18.
General topology optimization method with continuous and discrete orientation design using isoparametric projection 下载免费PDF全文
Tsuyoshi Nomura Ercan M. Dede Jaewook Lee Shintaro Yamasaki Tadayoshi Matsumori Atsushi Kawamoto Noboru Kikuchi 《International journal for numerical methods in engineering》2015,101(8):571-605
A general topology optimization method, which is capable of simultaneous design of density and orientation of anisotropic material, is proposed by introducing orientation design variables in addition to the density design variable. In this work, the Cartesian components of the orientation vector are utilized as the orientation design variables. The proposed method supports continuous orientation design, which is out of the scope of discrete material optimization approaches, as well as design using discrete angle sets. The advantage of this approach is that vector element representation is less likely to fail into local optima because it depends less on designs of former steps, especially compared with using the angle as a design variable (Continuous Fiber Angle Optimization) by providing a flexible path from one angle to another with relaxation of orientation design space. An additional advantage is that it is compatible with various projection or filtering methods such as sensitivity filters and density filters because it is free from unphysical bound or discontinuity such as the one at θ = 2π and θ = 0 seen with direct angle representation. One complication of Cartesian component representation is the point‐wise quadratic bound of the design variables; that is, each pair of element values has to reside in a given circular bound. To overcome this issue, we propose an isoparametric projection method, which transforms box bounds into circular bounds by a coordinate transformation with isoparametric shape functions without having the singular point that is seen at the origin with polar coordinate representation. A new topology optimization method is built by taking advantage of the aforementioned features and modern topology optimization techniques. Several numerical examples are provided to demonstrate its capability. Copyright © 2014 John Wiley & Sons, Ltd. 相似文献
19.
Yaguang Wang Zhan Kang 《International journal for numerical methods in engineering》2017,111(13):1252-1273
This paper presents a level set‐based shape and topology optimization method for conceptual design of cast parts. In order to be successfully manufactured by the casting process, the geometry of cast parts should satisfy certain moldability conditions, which poses additional constraints in the shape and topology optimization of cast parts. Instead of using the originally point‐wise constraint statement, we propose a casting constraint in the form of domain integration over a narrowband near the material boundaries. This constraint is expressed in terms of the gradient of the level set function defining the structural shape and topology. Its explicit and analytical form facilitates the sensitivity analysis and numerical implementation. As compared with the standard implementation of the level set method based on the steepest descent algorithm, the proposed method uses velocity field design variables and combines the level set method with the gradient‐based mathematical programming algorithm on the basis of the derived sensitivity scheme of the objective function and the constraints. This approach is able to simultaneously account for the casting constraint and the conventional material volume constraint in a convenient way. In this method, the optimization process can be started from an arbitrary initial design, without the need for an initial design satisfying the cast constraint. Numerical examples in both 2D and 3D design domain are given to demonstrate the validity and effectiveness of the proposed method. Copyright © 2017 John Wiley & Sons, Ltd. 相似文献