首页 | 本学科首页   官方微博 | 高级检索  
相似文献
 共查询到20条相似文献,搜索用时 31 毫秒
1.
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  相似文献   

2.
Recently, numerous modified versions of immune algorithms (IAs) have been adopted in both theoretical and practical applications. However, few have been proposed for solving structural topology optimization problems. In addition, the design connectivity handling and one‐node connected hinge prevention, which are vital in the application of population‐based methods with binary representation for structural topology optimization, have not been applied to IAs in the literature. A stress‐enhanced clonal selection algorithm (SECSA) incorporating an IA with a dominance‐based constraint‐handling technique and a new stress‐enhanced hypermutation operator is proposed to rectify those deficiencies. To demonstrate the high viability of the presented method, comparisons between the presented SECSA and genetic algorithm‐based methods were made on minimum compliance and minimum weight benchmark structural topology design problems in two‐dimensional, three‐dimensional, and multiloading cases. In each case, SECSA was shown to be competitive in terms of convergence speed and solution quality. The main goal of this study is not only to further explore the capabilities of IAs, but also to show that an IA with appropriate enhancements can lead to the development of attractive computational tools for global search in structural topology optimization. Copyright © 2011 John Wiley & Sons, Ltd.  相似文献   

3.
Unlike the traditional topology optimization approach that uses the same discretization for finite element analysis and design optimization, this paper proposes a framework for improving multiresolution topology optimization (iMTOP) via multiple distinct discretizations for: (1) finite elements; (2) design variables; and (3) density. This approach leads to high fidelity resolution with a relatively low computational cost. In addition, an adaptive multiresolution topology optimization (AMTOP) procedure is introduced, which consists of selective adjustment and refinement of design variable and density fields. Various two‐dimensional and three‐dimensional numerical examples demonstrate that the proposed schemes can significantly reduce computational cost in comparison to the existing element‐based approach. Copyright © 2012 John Wiley & Sons, Ltd.  相似文献   

4.
The paper presents a gradient‐based topology optimization formulation that allows to solve acoustic–structure (vibro‐acoustic) interaction problems without explicit boundary interface representation. In acoustic–structure interaction problems, the pressure and displacement fields are governed by Helmholtz equation and the elasticity equation, respectively. Normally, the two separate fields are coupled by surface‐coupling integrals, however, such a formulation does not allow for free material re‐distribution in connection with topology optimization schemes since the boundaries are not explicitly given during the optimization process. In this paper we circumvent the explicit boundary representation by using a mixed finite element formulation with displacements and pressure as primary variables (a u /p‐formulation). The Helmholtz equation is obtained as a special case of the mixed formulation for the elastic shear modulus equating to zero. Hence, by spatial variation of the mass density, shear and bulk moduli we are able to solve the coupled problem by the mixed formulation. Using this modelling approach, the topology optimization procedure is simply implemented as a standard density approach. Several two‐dimensional acoustic–structure problems are optimized in order to verify the proposed method. Copyright © 2006 John Wiley & Sons, Ltd.  相似文献   

5.
In spite of the success of the element‐density‐based topology optimization method in many problems including multiphysics design problems, some numerical difficulties, such as temperature undershooting, still remain. In this work, we develop an element connectivity parameterization (ECP) formulation for the topology optimization of multiphysics problems in order to avoid the numerical difficulties and yield improved results. In the proposed ECP formulation, finite elements discretizing a given design domain are not connected directly, but through sets of one‐dimensional zero‐length links simulating elastic springs, electric or thermal conductors. The discretizing finite elements remain solid during the whole analysis, and the optimal layout is determined by an optimal distribution of the inter‐element connectivity degrees that are controlled by the stiffness values of the links. The detailed procedure for this new formulation for multiphysics problems is presented. Using one‐dimensional heat transfer models, the problem of the element‐density‐based method is explained and the advantage of the ECP method is addressed. Copyright © 2005 John Wiley & Sons, Ltd.  相似文献   

6.
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.  相似文献   

7.
This paper proposes a level‐set based topology optimization method incorporating a boundary tracking mesh generating method and nonlinear programming. Because the boundary tracking mesh is always conformed to the structural boundary, good approximation to the boundary is maintained during optimization; therefore, structural design problems are solved completely without grayscale material. Previously, we introduced the boundary tracking mesh generating method into level‐set based topology optimization and updated the design variables by solving the level‐set equation. In order to adapt our previous method to general structural optimization frameworks, the incorporation of the method with nonlinear programming is investigated in this paper. To successfully incorporate nonlinear programming, the optimization problem is regularized using a double‐well potential. Furthermore, the sensitivities with respect to the design variables are strictly derived to maintain consistency in mathematical programming. We expect the investigation to open up a new class of grayscale‐free topology optimization. The usefulness of the proposed method is demonstrated using several numerical examples targeting two‐dimensional compliant mechanism and metallic waveguide design problems. Copyright © 2014 John Wiley & Sons, Ltd.  相似文献   

8.
We present a method for finding solutions of large‐scale binary programming problems where the calculation of derivatives is very expensive. We then apply this method to a topology optimization problem of weight minimization subject to compliance and buckling constraints. We derive an analytic expression for the derivative of the stress stiffness matrix with respect to the density of an element in the finite‐element setting. Results are presented for a number of two‐dimensional test problems.Copyright © 2012 John Wiley & Sons, Ltd.  相似文献   

9.
We present a versatile high‐level programming‐language implementation of non‐linear topology optimization. Our implementation is based on the commercial software package FEMLAB, and it allows a wide range of optimization objectives to be dealt with easily. We exemplify our method by studies of steady‐state Navier–Stokes flow problems, thus extending the work by Borrvall and Petersson on topology optimization of fluids in Stokes flow (Int. J. Num. Meth. Fluids 2003; 41 :77–107). We analyse the physical aspects of the solutions and how they are affected by different parameters of the optimization algorithm. A complete example of our implementation is included as FEMLAB code in an appendix. Copyright © 2005 John Wiley & Sons, Ltd.  相似文献   

10.
The paper introduces a novel multiresolution scheme to topology optimization in the framework of the isogeometric analysis. A new variable parameter space is added to implement multiresolution topology optimization based on the Solid Isotropic Material with Penalization approach. Design density variables defined in the variable space are used to approximate the element analysis density by the bivariate B‐spline basis functions, which are easily obtained using k‐refinement strategy in the isogeometric analysis. While the nonuniform rational B‐spline basis functions are used to exactly describe geometric domains and approximate unknown solutions in finite element analysis. By applying a refined sensitivity filter, optimized designs include highly discrete solutions in terms of solid and void materials without using any black and white projection filters. The Method of Moving Asymptotes is used to solve the optimization problem. Various benchmark test problems including plane stress, compliant mechanism inverter, and 2‐dimensional heat conduction are examined to demonstrate the effectiveness and robustness of the present method.  相似文献   

11.
As in the case of two‐dimensional topology design optimization, numerical instability problems similar to the formation of two‐dimensional checkerboard patterns occur if the standard eight‐node conforming brick element is used. Motivated by the recent success of the two‐dimensional non‐conforming elements in completely eliminating checkerboard patterns, we aim at investigating the performance of three‐dimensional non‐conforming elements in controlling the patterns that are estimated overly stiff by the brick elements. To this end, we will investigate how accurately the non‐conforming elements estimate the stiffness of the patterns. The stiffness estimation is based on the homogenization method by assuming the periodicity of the patterns. To verify the superior performance of the elements, we consider three‐dimensional compliance minimization and compliant mechanism design problems and compare the results by the non‐conforming element and the standard 8‐node conforming brick element. Copyright © 2005 John Wiley & Sons, Ltd.  相似文献   

12.
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.  相似文献   

13.
The aerodynamic performance of a compressor is highly sensitive to uncertain working conditions. This paper presents an efficient robust aerodynamic optimization method on the basis of nondeterministic computational fluid dynamic (CFD) simulation and multi‐objective genetic algorithm (MOGA). A nonintrusive polynomial chaos method is used in conjunction with an existing well‐verified CFD module to quantify the uncertainty propagation in the flow field. This method is validated by comparing with a Monte Carlo method through full 3D CFD simulations on an axial compressor (National Aeronautics and Space Administration rotor 37). On the basis of the validation, the nondeterministic CFD is coupled with a surrogate‐based MOGA to search for the Pareto front. A practical engineering application is implemented to the robust aerodynamic optimization of rotor 37 under random outlet static pressure. Two curve angles and two sweep angles at tip and hub are used as design variables. Convergence analysis shows that the surrogate‐based MOGA can obtain the Pareto front properly. Significant improvements of both mean and variance of the efficiency are achieved by the robust optimization. The comparison of the robust optimization results with that of the initial design, and a deterministic optimization demonstrate that the proposed method can be applied to turbomachinery successfully. Copyright © 2012 John Wiley & Sons, Ltd.  相似文献   

14.
This article presents an evolutionary topology optimization method for compliance minimization of structures under design-dependent pressure loads. In traditional density based topology optimization methods, intermediate values of densities for the solid elements arise along the iterations. Extra boundary parametrization schemes are demanded when these methods are applied to pressure loading problems. An alternative methodology is suggested in this article for handling this type of load. With an extended bi-directional evolutionary structural optimization method associated with a partially coupled fluid–structure formulation, pressure loads are modelled with hydrostatic fluid finite elements. Due to the discrete nature of the method, the problem is solved without any need of pressure load surfaces parametrization. Furthermore, the introduction of a separate fluid domain allows the algorithm to model non-constant pressure fields with Laplace's equation. Three benchmark examples are explored in order to show the achievements of the proposed method.  相似文献   

15.
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.  相似文献   

16.
With the fast development of additive manufacturing technology, topology optimization involving multiple materials has received ever increasing attention. Traditionally, this kind of optimization problem is solved within the implicit solution framework by using the Solid Isotropic Material with Penalization or level set method. This treatment, however, will inevitably lead to a large number of design variables especially when many types of materials are involved and 3‐dimensional (3D) problems are considered. This is because for each type of material, a corresponding density field/level function defined on the entire design domain must be introduced to describe its distribution. In the present paper, a novel approach for topology optimization with multiple materials is established based on the Moving Morphable Component framework. With use of this approach, topology optimization problems with multiple materials can be solved with much less numbers of design variables and degrees of freedom. Numerical examples provided demonstrate the effectiveness of the proposed approach.  相似文献   

17.
The computational bottleneck of topology optimization is the solution of a large number of linear systems arising in the finite element analysis. We propose fast iterative solvers for large three‐dimensional topology optimization problems to address this problem. Since the linear systems in the sequence of optimization steps change slowly from one step to the next, we can significantly reduce the number of iterations and the runtime of the linear solver by recycling selected search spaces from previous linear systems. In addition, we introduce a MINRES (minimum residual method) version with recycling (and a short‐term recurrence) to make recycling more efficient for symmetric problems. Furthermore, we discuss preconditioning to ensure fast convergence. We show that a proper rescaling of the linear systems reduces the huge condition numbers that typically occur in topology optimization to roughly those arising for a problem with constant density. We demonstrate the effectiveness of our solvers by solving a topology optimization problem with more than a million unknowns on a fast PC. Copyright © 2006 John Wiley & Sons, Ltd.  相似文献   

18.
In topology optimization, it is customary to use reciprocal‐like approximations, which result in monotonically decreasing approximate objective functions. In this paper, we demonstrate that efficient quadratic approximations for topology optimization can also be derived, if the approximate Hessian terms are chosen with care. To demonstrate this, we construct a dual SAO algorithm for topology optimization based on a strictly convex, diagonal quadratic approximation to the objective function. Although the approximation is purely quadratic, it does contain essential elements of reciprocal‐like approximations: for self‐adjoint problems, our approximation is identical to the quadratic or second‐order Taylor series approximation to the exponential approximation. We present both a single‐point and a two‐point variant of the new quadratic approximation. Copyright © 2009 John Wiley & Sons, Ltd.  相似文献   

19.
Genetic algorithms (GAs) have become a popular optimization tool for many areas of research and topology optimization an effective design tool for obtaining efficient and lighter structures. In this paper, a versatile, robust and enhanced GA is proposed for structural topology optimization by using problem‐specific knowledge. The original discrete black‐and‐white (0–1) problem is directly solved by using a bit‐array representation method. To address the related pronounced connectivity issue effectively, the four‐neighbourhood connectivity is used to suppress the occurrence of checkerboard patterns. A simpler version of the perimeter control approach is developed to obtain a well‐posed problem and the total number of hinges of each individual is explicitly penalized to achieve a hinge‐free design. To handle the problem of representation degeneracy effectively, a recessive gene technique is applied to viable topologies while unusable topologies are penalized in a hierarchical manner. An efficient FEM‐based function evaluation method is developed to reduce the computational cost. A dynamic penalty method is presented for the GA to convert the constrained optimization problem into an unconstrained problem without the possible degeneracy. With all these enhancements and appropriate choice of the GA operators, the present GA can achieve significant improvements in evolving into near‐optimum solutions and viable topologies with checkerboard free, mesh independent and hinge‐free characteristics. Numerical results show that the present GA can be more efficient and robust than the conventional GAs in solving the structural topology optimization problems of minimum compliance design, minimum weight design and optimal compliant mechanisms design. It is suggested that the present enhanced GA using problem‐specific knowledge can be a powerful global search tool for structural topology optimization. Copyright © 2005 John Wiley & Sons, Ltd.  相似文献   

20.
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.  相似文献   

设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号