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 velocity field level set method for shape and topology optimization

In this paper, we propose a new implementation of the level set shape and topology optimization, the velocity field level set method. Therein, the normal velocity field is constructed with specified basis functions and velocity design variables defined on a given set of points that are independent of the finite element mesh. A general mathematical programming algorithm can be employed to find the optimal normal velocities on the basis of the sensitivity analysis. As compared with conventional level set methods, mapping the variational boundary shape optimization problem into a finite‐dimensional design space and the use of a general optimizer makes it more efficient and straightforward to handle multiple constraints and additional design variables. Moreover, the level set function is updated by the Hamilton‐Jacobi equation using the normal velocity field; thus, the inherent merits of the implicit representation is retained. Therefore, this method combines the merits of both the general mathematical programming and conventional level set methods. Integrated topology optimization of structures with embedded components of designable geometries is considered to show the capability of this method to deal with general design variables. Several numerical examples in 2D or 3D design domains illustrate the robustness and efficiency of the method using different basis functions.     

Reliability‐based topology optimization of structures under stress constraints

In this paper, we propose an approach for reliability‐based design optimization where a structure of minimum weight subject to reliability constraints on the effective stresses is sought. The reliability‐based topology optimization problem is formulated by using the performance measure approach, and the sequential optimization and reliability assessment method is employed. This strategy allows for decoupling the reliability‐based topology optimization problem into 2 steps, namely, deterministic topology optimization and reliability analysis. In particular, the deterministic structural optimization problem subject to stress constraints is addressed with an efficient methodology based on the topological derivative concept together with a level‐set domain representation method. The resulting algorithm is applied to some benchmark problems, showing the effectiveness of the proposed approach.     

Explicit level‐set‐based topology optimization using an exact Heaviside function and consistent sensitivity analysis

This paper presents a level‐set‐based topology optimization method based on numerically consistent sensitivity analysis. The proposed method uses a direct steepest‐descent update of the design variables in a level‐set method; the level‐set nodal values. An exact Heaviside formulation is used to relate the level‐set function to element densities. The level‐set function is not required to be a signed‐distance function, and reinitialization is not necessary. Using this approach, level‐set‐based topology optimization problems can be solved consistently and multiple constraints treated simultaneously. The proposed method leads to more insight in the nature of level‐set‐based topology optimization problems. The level‐set‐based design parametrization can describe gray areas and numerical hinges. Consistency causes results to contain these numerical artifacts. We demonstrate that alternative parameterizations, level‐set‐based or density‐based regularization can be used to avoid artifacts in the final results. The effectiveness of the proposed method is demonstrated using several benchmark problems. The capability to treat multiple constraints shows the potential of the method. Furthermore, due to the consistency, the optimizer can run into local minima; a fundamental difficulty of level‐set‐based topology optimization. More advanced optimization strategies and more efficient optimizers may increase the performance in the future. Copyright © 2012 John Wiley & Sons, Ltd.     

Level‐set topology optimization with many linear buckling constraints using an efficient and robust eigensolver

Linear buckling constraints are important in structural topology optimization for obtaining designs that can support the required loads without failure. During the optimization process, the critical buckling eigenmode can change; this poses a challenge to gradient‐based optimization and can require the computation of a large number of linear buckling eigenmodes. This is potentially both computationally difficult to achieve and prohibitively expensive. In this paper, we motivate the need for a large number of linear buckling modes and show how several features of the block Jacobi conjugate gradient (BJCG) eigenvalue method, including optimal shift estimates, the reuse of eigenvectors, adaptive eigenvector tolerances and multiple shifts, can be used to efficiently and robustly compute a large number of buckling eigenmodes. This paper also introduces linear buckling constraints for level‐set topology optimization. In our approach, the velocity function is defined as a weighted sum of the shape sensitivities for the objective and constraint functions. The weights are found by solving an optimization sub‐problem to reduce the mass while maintaining feasibility of the buckling constraints. The effectiveness of this approach in combination with the BJCG method is demonstrated using a 3D optimization problem. Copyright © 2016 John Wiley & Sons, Ltd.     

A level set–based method for stress-constrained multimaterial topology optimization of minimizing a global measure of stress

In multimaterial topology optimization of minimizing a global measure of stress, the maximum stresses in different materials may not satisfy the strength design requirements simultaneously if stress constraints for different materials are not considered. In this paper, a level set–based method is presented to handle the stress-constrained multimaterial topology optimization of minimizing a global stress measure. Specifically, a multimaterial level set model is adopted to describe the structural topology, and a stress interpolation scheme is introduced for stress evaluation. Then, a stress penalty-based topology optimization model is presented. Meanwhile, an adaptive adjusting scheme of the stress penalty factor is employed to improve the control of the local stress level. To solve the stress-constrained multimaterial topology optimization problem minimizing the global measure of stress, the parametric level set method is employed, and the sensitivity analysis is carried out. Numerical examples are provided to demonstrate the effectiveness of the presented method. Results indicate that multimaterial structures with optimized global stress can be gained, and stress constraints for different materials can be satisfied simultaneously.     

Undercut and overhang angle control in topology optimization: A density gradient based integral approach

We present an approach for controlling the undercut and the minimal overhang angle in density based topology optimization, which are useful for reducing support structures in additive manufacturing. We cast both the undercut control and the minimal overhang angle control that are inherently constraints on the boundary shape into a domain integral of Heaviside projected density gradient. Such a Heaviside projection based integral of density gradient leads to a single constraint for controlling the undercut or controlling the overhang angle in the optimization. It effectively corresponds to a constraint on the projected perimeter that has undercut or has slope smaller than the prescribed overhang angle. In order to prevent trivial solutions of intermediate density to satisfy the density gradient constraints, a constraint on density grayness is also incorporated into the formulations. Numerical results on Messerschmitt–Bolkow–Blohm beams, cantilever beams, and 2D and 3D heat conduction problems demonstrate the proposed formulations are effective in controlling the undercut and the minimal overhang angle in the optimized designs. Copyright © 2016 John Wiley & Sons, Ltd.     

A level set approach for topology optimization with local stress constraints

The purpose of this work is to present a level set‐based approach for the structural topology optimization problem of mass minimization submitted to local stress constraints. The main contributions are threefold. First, the inclusion of local stress constraints by means of an augmented Lagrangian approach within the level set context. Second, the proposition of a constraint procedure that accounts for a continuous activation/deactivation of a finite number of local stress constraints during the optimization sequence. Finally, the proposition of a logarithmic scaling of the level set normal velocity as an additional regularization technique in order to improve the minimization sequence. A set of benchmark tests in two dimensions achieving successful numerical results assesses the good behavior of the proposed method. In these examples, it is verified that the algorithm is able to identify stress concentrations and drive the design to a feasible local minimum. Copyright © 2014 John Wiley & Sons, Ltd.     

Robust compliance topology optimization based on the topological derivative concept

In this paper, we present an approach for robust compliance topology optimization under volume constraint. The compliance is evaluated considering a point‐wise worst‐case scenario. Analogously to sequential optimization and reliability assessment, the resulting robust optimization problem can be decoupled into a deterministic topology optimization step and a reliability analysis step. This procedure allows us to use topology optimization algorithms already developed with only small modifications. Here, the deterministic topology optimization problem is addressed with an efficient algorithm based on the topological derivative concept and a level‐set domain representation method. The reliability analysis step is handled as in the performance measure approach. Several numerical examples are presented showing the effectiveness of the proposed approach. Copyright © 2015 John Wiley & Sons, Ltd.     

Heaviside projection–based aggregation in stress‐constrained topology optimization

The paper introduces an approach to stress‐constrained topology optimization through Heaviside projection–based constraint aggregation. The aggregation is calculated by integrating Heaviside projected local stresses over the design domain, and then, it is normalized over the total material volume. Effectively, the normalized integral measures the volume fraction of the material that has violated the stress constraint. Hence, with the Heaviside aggregated constraint, we can remove the stress failed material from the final design by constraining the integral to a threshold value near zero. An adaptive strategy is developed to select the threshold value for ensuring that the optimized design is conservative. By adding a stress penalty factor to the integrand, the Heaviside aggregated constraint can further penalize high stresses and becomes more stable and less sensitive to the selection of the threshold value. Our two‐dimensional and three‐dimensional numerical experiments demonstrate that the single Heaviside aggregated stress constraint can efficiently control the local stress level. Compared with the traditional approaches based on the Kreisselmeier‐Steinhauser and p‐norm aggregations, the Heaviside aggregation–based single constraint can substantially reduce computational cost on sensitivity analysis. These advantages make it possible to apply the proposed approach to large‐scale stress‐constrained problems.     

On the Pareto optimum sensitivity analysis in multicriteria optimization

To analyse the trade‐off relations among the set of criteria in multicriteria optimization, Pareto optimum sensitivity analysis is systematically studied in this paper. Original contributions cover two parts: theoretical demonstrations are firstly made to validate the gradient projection method in Pareto optimum sensitivity analysis. It is shown that the projected gradient direction evaluated at a given Pareto optimum in the design variable space rigorously corresponds to the tangent direction of the Pareto curve/surface at that point in the objective space. This statement holds even for the change of the set of active constraints in the perturbed problem. Secondly, a new active constraint updating strategy is proposed, which permits the identification of the active constraint set change, to determine the influence of this change upon the differentiability of the Pareto curve and finally to compute directional derivatives in non‐differentiable cases. This work will highlight some basic issues in multicriteria optimization. Some numerical problems are solved to illustrate these novelties. Copyright © 2003 John Wiley & Sons, Ltd.     

Radial basis functions and level set method for structural topology optimization

Level set methods have become an attractive design tool in shape and topology optimization for obtaining lighter and more efficient structures. In this paper, the popular radial basis functions (RBFs) in scattered data fitting and function approximation are incorporated into the conventional level set methods to construct a more efficient approach for structural topology optimization. RBF implicit modelling with multiquadric (MQ) splines is developed to define the implicit level set function with a high level of accuracy and smoothness. A RBF–level set optimization method is proposed to transform the Hamilton–Jacobi partial differential equation (PDE) into a system of ordinary differential equations (ODEs) over the entire design domain by using a collocation formulation of the method of lines. With the mathematical convenience, the original time dependent initial value problem is changed to an interpolation problem for the initial values of the generalized expansion coefficients. A physically meaningful and efficient extension velocity method is presented to avoid possible problems without reinitialization in the level set methods. The proposed method is implemented in the framework of minimum compliance design that has been extensively studied in topology optimization and its efficiency and accuracy over the conventional level set methods are highlighted. Numerical examples show the success of the present RBF–level set method in the accuracy, convergence speed and insensitivity to initial designs in topology optimization of two‐dimensional (2D) structures. It is suggested that the introduction of the radial basis functions to the level set methods can be promising in structural topology optimization. Copyright © 2005 John Wiley & Sons, Ltd.     

Topology optimization of fluid problems using genetic algorithm assisted by the Kriging model

A non‐gradient‐based approach for topology optimization using a genetic algorithm is proposed in this paper. The genetic algorithm used in this paper is assisted by the Kriging surrogate model to reduce computational cost required for function evaluation. To validate the non‐gradient‐based topology optimization method in flow problems, this research focuses on two single‐objective optimization problems, where the objective functions are to minimize pressure loss and to maximize heat transfer of flow channels, and one multi‐objective optimization problem, which combines earlier two single‐objective optimization problems. The shape of flow channels is represented by the level set function. The pressure loss and the heat transfer performance of the channels are evaluated by the Building‐Cube Method code, which is a Cartesian‐mesh CFD solver. The proposed method resulted in an agreement with previous study in the single‐objective problems in its topology and achieved global exploration of non‐dominated solutions in the multi‐objective problems. © 2016 The Authors International Journal for Numerical Methods in Engineering Published by John Wiley & Sons Ltd     

基于等几何裁剪分析的拓扑与形状集成优化

提出了将设计和分析、拓扑与形状优化集成的思想,探索了基于等几何裁剪分析的拓扑与形状集成优化设计算法,该方法统一了结构优化的计算机辅助设计、计算机辅助工程分析和优化设计的模型,基于B样条的等几何裁剪分析既能准确表达几何形状,又可以用裁剪面分析方便处理任意复杂拓扑优化问题,由裁剪选择标准确定合理的拓扑结构变动方向,结构变动时无需重新划分网格,设计结果突破初始设计空间的限制,还可方便优化形状。建立了等几何裁剪灵敏度分析的计算方法,给出了等几何裁剪分析拓扑与形状集成优化算法,通过典型实例表明所用方法的正确性和有效性。     

A level set method for shape and topology optimization of large‐displacement compliant mechanisms

A parameterization level set method is presented for structural shape and topology optimization of compliant mechanisms involving large displacements. A level set model is established mathematically as the Hamilton–Jacobi equation to capture the motion of the free boundary of a continuum structure. The structural design boundary is thus described implicitly as the zero level set of a level set scalar function of higher dimension. The radial basis function with compact support is then applied to interpolate the level set function, leading to a relaxation and separation of the temporal and spatial discretizations related to the original partial differential equation. In doing so, the more difficult shape and topology optimization problem is now fully parameterized into a relatively easier size optimization of generalized expansion coefficients. As a result, the optimization is changed into a numerical process of implementing a series of motions of the implicit level set function via an existing efficient convex programming method. With the concept of the shape derivative, the geometrical non‐linearity is included in the rigorous design sensitivity analysis to appropriately capture the large displacements of compliant mechanisms. Several numerical benchmark examples illustrate the effectiveness of the present level set method, in particular, its capability of generating new holes inside the material domain. The proposed method not only retains the favorable features of the implicit free boundary representation but also overcomes several unfavorable numerical considerations relevant to the explicit scheme, the reinitialization procedure, and the velocity extension algorithm in the conventional level set method. Copyright © 2008 John Wiley & Sons, Ltd.     

Shape optimization using time evolution equations

In this study, we deal with a numerical solution based on time evolution equations to solve the optimization problem for finding the shape that minimizes the objective function under given constraints. The design variables of the shape optimization problem are defined on a given original domain on which the boundary value problems of partial differential equations are defined. The variations of the domain are obtained by the time integration of the solution to derive the time evolution equations defined in the original domain. The shape gradient with respect to the domain variations are given as the Neumann boundary condition defined on the original domain boundary. When the constraints are satisfied, the decreasing property of the objective function is guaranteed by the proposed method. Furthermore, the proposed method is used to minimize the heat resistance under a total volume constraint and to solve the minimization problem of mean compliance under a total volume constraint.     

基于骨架提取的拓扑优化最小尺寸精确控制

受到可制造性的约束,拓扑优化技术目前多用于结构的概念设计,因此,研究直接面向加工制造的拓扑优化方法很有必要。该文基于启发式BESO(Bi-directional Evolutionary Structural Optimization)算法,提出了一种高效的可精确控制结构最小尺寸的拓扑优化方法。通过灵敏度插值,细化边界单元,改进BESO算法,解决边界不光滑问题;采用拓扑细化方法,提取拓扑结构的骨架构型;以此为基础,判定结构中不满足最小尺寸约束的部位,基于改进的BESO算法,实现拓扑优化结构的最小尺寸精确控制;此外,在优化过程中,通过松弛施加最小尺寸约束的方法,有效避免优化早熟问题。数值算例表明了该拓扑优化方法的有效性。     

Algorithm developments for optimization problems with joint reliability constraints

We propose an algorithm for optimization under uncertainty with joint reliability constraints. Most existing research formulates constraints of random variables/parameters in probabilistic forms such that the probability of individual constraint satisfaction must be higher than a reliability target. However, engineering problems generally define reliability as the probability of satisfying constraints ‘jointly’ rather than individually. Calculating a joint reliability value requires a multiple integration over the feasible domain. This calculation is in most realistic cases impractical by use of exact methods and has become the major challenge in optimization. In this research we propose a filter‐based sequential quadratic programming algorithm with joint reliability constraints approximated by their upper bounds. This upper bound can be obtained analytically by considering the current design location, the reliability of satisfying each constraint, and the angles between every constraint pair. To further improve the efficiency of the algorithm, active‐set strategies are implemented such that intense reliability calculations only required for constraints that are likely to be active. The rest of the constraints are approximated to the level needed to understand whether constraints might become active in the next iteration. The efficiency of the proposed method enables the applications to general complex engineering problems. Copyright © 2010 John Wiley & Sons, Ltd.     

Solution to the topology optimization problem using a time-evolution equation

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.