共查询到15条相似文献,搜索用时 0 毫秒
1.
Multiple-Load Truss Topology and Sizing Optimization: Some Properties of Minimax Compliance 总被引:1,自引:0,他引:1
This paper considers the mathematical properties of discrete or discretized mechanical structures under multiple loadings which are optimal w.r.t. maximal stiffness. We state a topology and/or sizing problem of maximum stiffness design in terms of element volumes and displacements. Multiple loads are handled by minimizing the maximum of compliance of all load cases, i.e., minimizing the maximal sum of displacements along an applied force. Generally, the problem considered may contain constraints on the design variables. This optimization problem is first reformulated in terms of only design variables. Elastic equilibrium is hidden in potential energy terms. It is shown that this transformed objective function is convex and continuous, including infinite values. We deduce that maximum stiffness structures are dependent continuously on the bounds of the element volumes as parameters. Consequently, solutions to sizing problems with small positive lower bounds on the design variables can be considered as good approximations of solutions to topology problems with zero lower bounds. This justifies heuristic approaches such as the well-known stress-rationing method for solving truss topology problems. 相似文献
2.
提出了形成三维Michell桁架的有限元方法.采用正交异性纤维增强复合材料模型模拟Michell桁架.纤维在节点处的密度和方向作为基本设计变量.根据有限元分析得到节点位置的应力和应变.采用迭代方法,将纤维方向调整到主应力方向;根据纤维方向的应变改变纤维密度. 仅需少量迭代即可得到满足Michell准则的应变场和类桁架连续体.最后根据节点处的纤维方向用连续线表示出Michell桁架.几个算例表明了算法的有效性和计算效率. 相似文献
3.
Path-following (load incrementation) methods are studied in this paper for elastostatic analysis problems with unilateral contact relations in the framework of a large displacement theory by means of the parametric optimization techniques. Finite element discretization yields sparse polynomial optimization problems with equality and inequality constraints. For such sparse problems generically appearing singularities along the path of solutions are completely classified. Perturbations involving only a minimal number of parameters are shown to be sufficient to guarantee these generic situations. This clarifies stability and uniqueness questions for the solution along the examined path. 相似文献
4.
Wolfgang Achtziger 《Computational Optimization and Applications》2000,15(1):69-96
We discuss the minimization of a continuous function on a subset of Rn subject to a finite set of continuous constraints. At each point, a given set-valued map determines the subset of constraints considered at this point. Such problems arise e.g. in the design of engineering structures.After a brief discussion on the existence of solutions, the numerical treatment of the problem is considered. It is briefly motivated why standard approaches generally fail. A method is proposed approximating the original problem by a standard one depending on a parameter. It is proved that by choosing this parameter large enough, each solution to the approximating problem is a solution to the original one. In many applications, an upper bound for this parameter can be computed, thus yielding the equivalence of the original problem to a standard optimization problem.The proposed method is applied to the problem of optimally designing a loaded truss subject to local buckling conditions. To our knowledge this problem has not been solved before. A numerical example of reasonable size shows the proposed methodology to work well. 相似文献
5.
本文讨论Robust桁架拓扑设计(TTD)问题,即桁架结构设计问题,使其在固定重量的情况下,具有最佳的承载能力.本文陈述了几种应用锥优化解Robust TTD问题的方法,并简介了锥优化最新的领域.同时,本文给出了一个单负荷的线性模型和一个多负荷的半正定优化模型以及Robust TTD问题.文中所有的模型均有例证.例证显示通过应用对偶性这些模型的规模能被充分的减小. 相似文献
6.
桁架振动优化设计可描述为:在给定振动系统最低频率的约束条件下,设计用材最省的桁架结构. 本文针对具有某种结构对称性的桁架,利用有限群描述这一特性,在已有桁架设计的半正定规划模型基 础上,运用最近提出的矩阵代数方法对半正定规划问题的决策变量和数据进行降维,给出了构造有限群 表示的两个充分条件,并实现了一类群对称桁架振动优化设计的半正定模型降维.基于问题的实际背景, 我们又考虑了一个具有八根弹性棒的桁架设计实例,进一步说明在实际问题中根据群对称构造群表示以 及对应不可约表示的具体方法. 相似文献
7.
Bo Jiang Ning Wang Liping Wang 《Communications in Nonlinear Science & Numerical Simulation》2013,18(11):3134-3145
This paper proposes particle swarm optimization with age-group topology (PSOAG), a novel age-based particle swarm optimization (PSO). In this work, we present a new concept of age to measure the search ability of each particle in local area. To keep population diversity during searching, we separate particles to different age-groups by their age and particles in each age-group can only select the ones in younger groups or their own groups as their neighbourhoods. To allow search escape from local optima, the aging particles are regularly replaced by new and randomly generated ones. In addition, we design an age-group based parameter setting method, where particles in different age-groups have different parameters, to accelerate convergence. This algorithm is applied to nonlinear function optimization and data clustering problems for performance evaluation. In comparison against several PSO variants and other EAs, we find that the proposed algorithm provides significantly better performances on both the function optimization problems and the data clustering tasks. 相似文献
8.
The recently proposed random cost method is applied to the topology optimization of trusses. Its performance is compared to previous genetic algorithm and evolution strategy simulations. Random cost turns out to be an optimization method with attractive features. In comparison to the genetic algorithm approach of Hajela, Lee and Lin, random cost turns out to be simpler and more efficient. Furthermore it is found that in contrast to evolution strategy, the random cost strategy's ability to find optima, is independent of the initial structure. This characteristic is related to the important capacity of escaping from local optima. 相似文献
9.
The aim of this paper is to propose a variational piecewise constant level set method for solving elliptic shape and topology optimization problems. The original model is approximated by a two-phase optimal shape design problem by the ersatz material approach. Under the piecewise constant level set framework, we first reformulate the two-phase design problem to be a new constrained optimization problem with respect to the piecewise constant level set function. Then we solve it by the projection Lagrangian method. A gradient-type iterative algorithm is presented. Comparisons between our numerical results and those obtained by level set approaches show the effectiveness, accuracy and efficiency of our algorithm. 相似文献
10.
We consider the combination of a network design and graph partitioning model in a multilevel framework for determining the optimal network expansion and the optimal zonal configuration of zonal pricing electricity markets, which is an extension of the model discussed in Grimm et al. (2019) that does not include a network design problem. The two classical discrete optimization problems of network design and graph partitioning together with nonlinearities due to economic modeling yield extremely challenging mixed-integer nonlinear multilevel models for which we develop two problem-tailored solution techniques. The first approach relies on an equivalent bilevel formulation and a standard KKT transformation thereof including novel primal-dual bound tightening techniques, whereas the second is a tailored generalized Benders decomposition. For the latter, we strengthen the Benders cuts of Grimm et al. (2019) by using the structure of the newly introduced network design subproblem. We prove for both methods that they yield global optimal solutions. Afterward, we compare the approaches in a numerical study and show that the tailored Benders approach clearly outperforms the standard KKT transformation. Finally, we present a case study that illustrates the economic effects that are captured in our model. 相似文献
11.
A class of distributed-parameter optimal design problems is treated, in which the design variable appears as a coefficient in a partial differential operator. Formal sensitivity analysis techniques that are in common use in the engineering literature are studied and made technically precise. Operator theoretic techniques and Frechet differentiation theory are employed to develop a rigorous sensitivity analysis for static and vibrating elastic structures. Two examples involving fourth-order ordinary and partial differential operators, commonly encountered in treating beam and plate elements, are analyzed. 相似文献
12.
In a recent work, we introduced a finite element approximation for the shape optimization of an elastic structure in sliding contact with a rigid foundation where the contact condition (Signorini’s condition) is approximated by Nitsche’s method and the shape gradient is obtained via the adjoint state method. The motivation of this work is to propose an a priori convergence analysis of the numerical approximation of the variables of the shape gradient (displacement and adjoint state) and to show some numerical results in agreement with the theoretical ones. The main difficulty comes from the non-differentiability of the contact condition in the classical sense which requires the notion of conical differentiability. 相似文献
13.
Efficient topology optimization of thermo-elasticity problems using coupled field adjoint sensitivity analysis method 总被引:1,自引:0,他引:1
We develop a unified and efficient adjoint design sensitivity analysis (DSA) method for weakly coupled thermo-elasticity problems. Design sensitivity expressions with respect to thermal conductivity and Young's modulus are derived. Besides the temperature and displacement adjoint equations, a coupled field adjoint equation is defined regarding the obtained adjoint displacement field as the adjoint load in the temperature field. Thus, the computing cost is significantly reduced compared to other sensitivity analysis methods. The developed DSA method is further extended to a topology design optimization method. For the topology design optimization, the design variables are parameterized using a bulk material density function. Numerical examples show that the DSA method developed is extremely efficient and the optimal topology varies significantly depending on the ratio of mechanical and thermal loadings. 相似文献
14.
Implementation of scatter search for multi-objective optimization: a comparative study 总被引:2,自引:0,他引:2
Interest in the design of efficient meta-heuristics for the application to combinatorial optimization problems is growing
rapidly. The optimal design of water distribution networks is an important optimization problem which consists of finding
the best way of conveying water from the sources to the users, thus satisfying their requirements. The efficient design of
looped networks is a much more complex problem than the design of branched ones, but their greater reliability can compensate
for the increase in cost when closing some loops. Mathematically, this is a non-linear optimization problem, constrained to
a combinatorial space, since the diameters are discrete and it has a very large number of local solutions. Many works have
dealt with the minimization of the cost of the network but few have considered their cost and reliability simultaneously.
The aim of this paper is to evaluate the performance of an implementation of Scatter Search in a multi-objective formulation
of this problem. Results obtained in three benchmark networks show that the method here proposed performs accurately well
in comparison with other multi-objective approaches also implemented. 相似文献
15.
B. L. Karihaloo 《Journal of Optimization Theory and Applications》1979,27(3):449-461
The paper presents the optimal (maximum transverse stiffness) design of an elastic, simply supported member of given volume that is to serve as a beam or as a column at different times during its design life. The optimal design can be interpreted in two ways. It is the design that has the maximum Euler buckling load in column action, subject to a prescribed maximum deflection in beam action under a uniformly distributed load; it is also the design that has the least deflection at midspan under a uniformly distributed load, subject to a lower limit on its buckling load in column action. The effectiveness of the optimal design is judged by comparing it with a prismatic bar of the same volume.The author is grateful to Professor W. Prager for suggesting several improvements to an earlier version of the paper. 相似文献