APPROXIMATE DISCRETE VARIABLE OPTIMIZATION OF FRAME STRUCTURES WITH DUAL METHODS

The purpose of this work is to present an efficient method for optimum design of frame structures, using approximation concepts. A dual strategy in which the design variables can be considered as discrete variables is used. A two-level approximation concept is used. In the first level, all the structural response quantities such as forces and displacements are approximated as functions of some intermediate variables. Then the second level approximation is employed to convert the first-level approximation problem into a series of problems of separable forms, which can be solved easily by dual methods with discrete variables. In the second-level approximation, the objective function and the approximate constraints are linearized. The objective of the first-level approximation is to reduce the number of structural analyses required in the optimization problem and the second level approximation reduces the computational cost of the optimization technique. A portal frame and a single layer grid are used as design examples to demonstrate the efficiency of the proposed method.     

An efficient algorithm for the optimum design of trusses with discrete variables

A method to efficiently solve the problem of minimum weight design of plane and space trusses with discrete or mixed variables is developed. The method can also be applied to continuous variables. The original formulation leads to a non-linear constrained minimization problem with inequality constraints, which is solved by means of a sequence of approximate problems using dual techniques. In the dual space, the objective function is to be maximized, depends on continuous variables, is concave and has first and second order discontinuities. In addition, the constraints deal simply with restricting the dual variables to be non-negative. To solve the problem an ad hoc algorithm from mathematical programming has been adapted. Some examples have been developed to show the effectiveness of the method.     

Structural optimization of uncertain dynamical systems considering mixed-design variables

In this paper attention is directed to the reliability-based optimization of uncertain structural systems under stochastic excitation involving discrete-continuous sizing type of design variables. The reliability-based optimization problem is formulated as the minimization of an objective function subject to multiple reliability constraints. The probability that design conditions are satisfied within a given time interval is used as a measure of system reliability. The problem is solved by a sequential approximate optimization strategy cast into the framework of conservative convex and separable approximations. To this end, the objective function and the reliability constraints are approximated by using a hybrid form of linear, reciprocal and quadratic approximations. The approximations are combined with an effective sensitivity analysis of the reliability constraints in order to generate explicit expressions of the constraints in terms of the design variables. The explicit approximate sub-optimization problems are solved by an appropriate discrete optimization technique. The optimization scheme exhibits monotonic convergence properties. Two numerical examples showing the effectiveness of the approach reported herein are presented.     

MIXED INTEGER PROGRAMMING FOR THE OPTIMAL (LEAST COST) DESIGN OF ECCENTRICALLY LOADED MASONRY BEARING WALLS:Part II. High Eccentricities

A mixed integer approach for the least cost design of structural masonry walls with high eccentricities is developed. The integer variables in the approach are used to select the optimum values from a range of discrete block sizes, discrete grouting conditions, and discrete reinforcement levels. The structural constraints in the model are based upon the requirements of the Transformed Section type of analysis for masonry walls. The non-linear functions representing the relationships for determining the resisting capacities of the masonry element are approximated by linear functions which come very close in form and results to the original curves. Application of the model to an example problem demonstrates that in spite of the integer requirements, the approach is easily and efficiently solved using a standard software package.     

On sequential approximate simultaneous analysis and design in classical topology optimization

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.     

基于变频率区间约束的结构材料优化设计

针对频率约束的结构材料优化问题,基于结构拓扑优化思想,提出变频率区间约束的结构材料优化方法。借鉴均匀化及ICM(独立、连续、映射)方法,以微观单元拓扑变量倒数为设计变量,导出宏观单元等效质量矩阵及导数,进而获得频率一阶近似展开式。结合变频率区间约束思想,获得以结构质量为目标函数、频率为约束条件的连续体微结构拓扑优化近似模型;采用对偶方法求解。通过算例验证该方法的有效性及可行性,表明考虑质量矩阵变化影响所得优化结果更合理。     

An engineering method for complex structural optimization involving both size and topology design variables

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.     

离散变量结构优化设计的最优综合效能法

针对结构优化问题的位移约束,引入关键约束的界约参数,提出了结构位移统一约束的缩减形式,从而简化了结构优化模型。根据离散变量结构优化问题的特点,提出了效能系数的概念,它衡量设计变量在离散邻域范围内变化对目标函数与约束函数值的影响,并研究了基于效能系数取值分类的四种主要调整方式。根据结构应力和位移约束的影响区域属性,以综合效能最大化为引导,提出了求解离散变量结构优化问题的最优综合效能法。算例结果显示该算法具有良好的优化效率,可求得问题的最优解或获得历史上的最优记录。     

Optimal structural design under stochastic uncertainty by stochastic linear programming methods

In the optimal plastic design of mechanical structures one has to minimize a certain cost function under the equilibrium equation, the yield condition and some additional simple constraints, like box constraints. A basic problem is that the model parameters and the external loads are random variables with a certain probability distribution. In order to get reliable/robust optimal designs with respect to random parameter variations, by using stochastic optimization methods, the original random structural optimization problem must be replaced by an appropriate deterministic substitute problem. Starting from the equilibrium equation and the yield condition, the problem can be described in the framework of stochastic (linear) programming problems with ‘complete fixed recourse’. The main properties of this class of substitute problems are discussed, especially the ‘dual decomposition’ data structure which enables the use of very efficient special purpose LP-solvers.     

Continuum structural topological optimizations with stress constraints based on an active constraint technique

Stress‐related problems have not been given the same attention as the minimum compliance topological optimization problem in the literature. Continuum structural topological optimization with stress constraints is of wide engineering application prospect, in which there still are many problems to solve, such as the stress concentration, an equivalent approximate optimization model and etc. A new and effective topological optimization method of continuum structures with the stress constraints and the objective function being the structural volume has been presented in this paper. To solve the stress concentration issue, an approximate stress gradient evaluation for any element is introduced, and a total aggregation normalized stress gradient constraint is constructed for the optimized structure under the r?th load case. To obtain stable convergent series solutions and enhance the control on the stress level, two p‐norm global stress constraint functions with different indexes are adopted, and some weighting p‐norm global stress constraint functions are introduced for any load case. And an equivalent topological optimization model with reduced stress constraints is constructed,being incorporated with the rational approximation for material properties, an active constraint technique, a trust region scheme, and an effective local stress approach like the qp approach to resolve the stress singularity phenomenon. Hence, a set of stress quadratic explicit approximations are constructed, based on stress sensitivities and the method of moving asymptotes. A set of algorithm for the one level optimization problem with artificial variables and many possible non‐active design variables is proposed by adopting an inequality constrained nonlinear programming method with simple trust regions, based on the primal‐dual theory, in which the non‐smooth expressions of the design variable solutions are reformulated as smoothing functions of the Lagrange multipliers by using a novel smoothing function. Finally, a two‐level optimization design scheme with active constraint technique, i.e. varied constraint limits, is proposed to deal with the aggregation constraints that always are of loose constraint (non active constraint) features in the conventional structural optimization method. A novel structural topological optimization method with stress constraints and its algorithm are formed, and examples are provided to demonstrate that the proposed method is feasible and very effective. © 2016 The Authors. International Journal for Numerical Methods in Engineering published by John Wiley & Sons Ltd.     

离散变量结构优化的拟满应力设计方法

本文以满应力设计思想为基础,提出了适用于离散变量结构优化设计计算的拟满应力设计方法。该方法能直接计算具有应力约束和截面尺寸约柬的离散变量结构优化设计问题,也能处理同时具有稳定性约束和位移约束的多工况、多约束、多变量的离散变量结构优化设计问题。算例结果表明,拟满应力设计方法对于离散变量结构优化计算是非常有效的。     

A SIMPLEX-BASED APPROACH TO A CLASS OF PROBLEMS ASSOCIATED WITH TRUSS DESIGN

Determination of the cross-sectional areas of the members of a structural truss in order to minimize structural weight, subject to performance constraints, gives rise to a discrete non-linear mathematical programming problem. A Lagrangian scheme for the solution of this type of problem is described and an effective simplex-based method developed for solving the Lagrangian dual subproblems that thus arise. Structure inherent in the problem permits the use of simplex tableaux which are very much reduced in size, thereby enabling subproblems to be solved quickly. Moreover, the ideas developed here have potential for more general application.     

Dual methods for discrete structural optimization problems

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.     

离散变量结构优化设计的拟满应力遗传算法

以力学准则法为基础,提出了一种求解离散变量结构优化设计的拟满应力方法;这种方法能直接求解具有应力约束和几何约束的离散变量结构优化设计问题.通过在遗传算法中定义拟满应力算子,建立了一种离散变量结构优化设计的混合遗传算法拟满应力遗传算法.算例表明;这种混合遗传算法对于离散变量结构优化设计问题具有较高的计算效率.     

A PROCEDURE TO SELECT THE BEST MATERIAL COMBINATIONS AND OPTIMALLY DESIGN HYBRID COMPOSITE PLATES FOR MINIMUM WEIGHT AND COST

The optimal layup with least weight or cost for a symmetrically laminated plate subject to a buckling load is determined using a hybrid composite construction. A hybrid construction provides further tailoring capabilities and can meet the weight, cost and strength constraints while a non-hybrid construction may fail to satisfy the design requirements. The objective of the optimization is to minimize either the weight or cost of the plate using the ply angles, layer thicknesses and material combinations as design variables. As the optimization problem contains a large number of continuous (ply angles and thicknesses) and discrete (material combinations) design variables, a -sequential solution procedure is devised in which the optimal variables are computed in different stages. The proposed design method is illustrated using graphite, kevlar and glass epoxy combinations and the efficiencies of the hybrid designs over the non-hybrid ones are computed.     

A sequential approximation method using neural networks for engineering design optimization problems

There are three characteristics in engineering design optimization problems: (1) the design variables are often discrete physical quantities; (2) the constraint functions often cannot be expressed analytically in terms of design variables; (3) in many engineering design applications, critical constraints are often ‘pass–fail’, ‘0–1’ type binary constraints. This paper presents a sequential approximation method specifically for engineering optimization problems with the three characteristics. In this method a back-propagation neural network is trained to simulate a rough map of the feasible domain formed by the constraints using a few representative training data. A training data point consists of a discrete design point and whether this design point is feasible or infeasible. Function values of the constraints are not required. A search algorithm then searches for the optimal point in the feasible domain simulated by the neural network. This new design point is checked against the true constraints to see whether it is feasible, and is then added to the training set. The neural network is trained again with this added information, in the hope that the network will better simulate the boundary of the feasible domain of the true optimization problem. Then a further search is made for the optimal point in this new approximated feasible domain. This process continues in an iterative manner until the approximate model locates the same optimal point in consecutive iterations. A restart strategy is also employed so that the method may have a better chance to reach a global optimum. Design examples with large discrete design spaces and implicit constraints are solved to demonstrate the practicality of this method.     

Evolutionary Algorithm Integrating Stress Heuristics for Truss Optimization

The optimal truss design using problem-oriented evolutionary algorithm is presented in the paper. The minimum weight structures subjected to stress and displacement constraints are searched. The discrete design variables are areas of members, selected from catalogues of available sections. The integration of the problem specific knowledge into the optimization procedure is proposed. The heuristic rules based on the concept of fully stressed design are introduced through special genetic operators, which use the information concerning the stress distribution of structural members. Moreover, approximated solutions obtained by deterministic, sequential discrete optimization methods are inserted into the initial population. The obtained hybrid evolutionary algorithm is specialized for truss design. Benchmark problems are calculated in numerical examples. The knowledge about the problem integrated into the evolutionary algorithm can enhance considerably the effectiveness of the approach and improve significantly the convergence rate and the quality of the results. The advantages and drawbacks of the proposed method are discussed.     

Non‐convex dual forms based on exponential intervening variables,with application to weight minimization

We study the weight minimization problem in a dual setting. We propose new dual formulations for non‐linear multipoint approximations with diagonal approximate Hessian matrices, which derive from separable series expansions in terms of exponential intervening variables. These, generally, nonconvex approximations are formulated in terms of intervening variables with negative exponents, and are therefore applicable to the solution of the weight minimization problem in a sequential approximate optimization (SAO) framework. Problems in structural optimization are traditionally solved using SAO algorithms, like the method of moving asymptotes, which require the approximate subproblems to be strictly convex. Hence, during solution, the nonconvex problems are approximated using convex functions, and this process may in general be inefficient. We argue, based on Falk's definition of the dual, that it is possible to base the dual formulation on nonconvex approximations. To this end we reintroduce a nonconvex approach to the weight minimization problem originally due to Fleury, and we explore certain convex and nonconvex forms for subproblems derived from the exponential approximations by the application of various methods of mixed variables. We show in each case that the dual is well defined for the form concerned, which may consequently be of use to the future code developers. Copyright © 2009 John Wiley & Sons, Ltd.     

Reliability based design optimization using response surfaces in application to multidisciplinary systems

Traditionally, reliability based design optimization (RBDO) is formulated as a nested optimization problem. For these problems the objective is to minimize a cost function while satisfying the reliability constraints. The reliability constraints are usually formulated as constraints on the probability of failure corresponding to each of the failure modes or a single constraint on the system probability of failure. The probability of failure is usually estimated by performing a reliability analysis. The difficulty in evaluating reliability constraints comes from the fact that modern reliability analysis methods are themselves formulated as an optimization problem. Solving such nested optimization problems is extremely expensive for large scale multidisciplinary systems which are likewise computationally intensive. In this research, a framework for performing reliability based multidisciplinary design optimization using approximations is developed. Response surface approximations (RSA) of the limit state functions are used to estimate the probability of failure. An outer loop is incorporated to ensure that the approximate RBDO converges to the actual most probable point of failure. The framework is compared with the exact RBDO procedure. In the proposed methodology, RSAs are employed to significantly reduce the computational expense associated with traditional RBDO. The proposed approach is implemented in application to multidisciplinary test problems, and the computational savings and benefits are discussed.     

用序列二次规划作复合材料结构的优化设计

本文介绍用序列二次规划进行金属与复合材料的薄壁混合结构在给定拓朴、几何外形和材料组成条件下的最轻结构设计.以有限元素法为分析手段,元素为金属及复材的杆膜元,取板厚、杆截面尺寸及复材的各向铺层的层数为设计变量.这里主要介绍位移及工艺尺寸约束下的最轻重量设计,对于其它复杂约束其基本原理和方法是类似的.序列二次规划作结构设计的主要优点在其工程应用价值.它的重分析次数少,从本文的实例中可以看出它比最佳准则法解大型的命题重分析次数约少40～50%;并且可以统一处理各种不同类型的约束,这对大型复材飞机结构的优化设计,无疑有着很大的经济效益.