具有动应力和动位移约束的离散变量结构拓扑优化设计方法

讨论了动应力、动位移约束下离散变量结构拓扑优化设计问题.首先给出问题的数学模型,然后用拟静力算法,将结构惯性力极值作为静载荷施加到结构上,求得结构的动位移和动内力,将考虑动应力约束和动位移约束的离散变量结构拓扑设计问题化为静应力和静位移约束的优化问题,然后利用两类变量统一考虑的离散变量结构拓扑优化设计的综合算法进行求解.     

离散变量结构优化设计的组合算法*

本文首先给出了离散变量优化设计局部最优解的定义,然后提出了一种综合的组合算法.该算法采用分级优化的方法,第一级优化首先采用计算效率很高且经过随机抽样性能实验表明性能较高的启发式算法─—相对差商法,求解离散变量结构优化设计问题近似最优解 X ;第二级采用组合算法,在 X 的离散邻集内建立离散变量结构优化设计问题的(-1,0.1)规划模型,再进一步将其化为(0,1)规划模型,应用定界组合算法或相对差商法求解该(0,1)规划模型,求得局部最优解.解决了采用启发式算法无法判断近似最优解是否为局部最优解这一长期未得到解决的问题,提高了计算精度,同时,由于相对差商法的高效率与高精度,以上综合的组合算法的计算效率也还是较高的.     

离散优化与连续优化的复杂性概念

问题的复杂性概念起源于离散的图灵计算机理论的研究,在离散优化问题的研究中被广泛的接受.近期连续优化领域的很多文章中提及NP难这个概念.从而来对比介绍离散优化和连续优化研究中这两个概念的差异.     

具有动应力、位移和稳定性约束的离散变量桁架结构布局优化设计算法

给出了在动应力、动位移和动稳定约束下离散变量结构布局优化设计问题的数学模型,用“拟静力”算法,将具有动应力约束、动位移约束和动稳定约束的离散变量结构布局优化设计问题化为静应力、静位移和静稳定约束的优化问题,然后利用两级优化算法求解该模型．优化过程由两级组成,拓扑级优化和形状级优化．在每一级,都使用了综合算法,并且在搜索过程中都根据两类设计变量的相对差商值进行搜索．对包含稳定约束和不包含稳定约束的优化结果做了比较,结果显示稳定性约束对优化结果产生较大的影响．     

基于多变量的Granger因果检验方法

针对既有的Granger因果检验方法只能处理两个变量间的因果关系问题,指出这种方法会导致间接因果与直接因果的混淆及由于数据同源而产生的伪因果问题,提出一种可以消除以上问题的多变量因果检验方法,该方法立足于原有的Granger因果检验,适用于短时相依的和平稳的时间序列数据,并根据蒙特卡罗方法给出了统计推断的检验量,设计了方法的实施步骤.最后,应用一个仿真的实例具体展示了方法的使用过程和方法的有效性。     

关于一类二阶矩阵方程的敏度分析

In this paper, the sensitivity of the solution for a class of quadratic matrix equation which arises in the analysis of structural systems and vibration problems is discussed. With Brouwer fixed piont theory, the perturbation of the quadratic matrix equation is analyzed and two computational perturbation bounds are derived. Then a Rice condition number of some kind of solutions is given using the analytic expansion method. Two examples are presented in the last part.     

结构拓扑优化中棋盘格抑制方法的研究

针对棋盘格过滤技术中单元权重系数的计算,对已有文献中的棋盘格抑制方法进行改进,提出了物理意义明确且更具一般性的公式.建立含应力约束的弹塑性拓扑优化模型,将改进的棋盘格抑制方法用于弹塑性结构拓扑优化,采用ESO(evolutionary structural optimization)法进行优化.编程实现了两个数值算例,对算例结果分析表明:改进的棋盘格抑制方法具有更好的抑制效果,且该方法并不局限于材料线性范围的拓扑优化,也适用于进行材料非线性的拓扑优化时棋盘格的抑制.     

Fredholm映射的集值紧摄动的拓扑度

Suppose that X is a paracompact oriented C` -Banach-Fredholm manifold, Ω is an open subset of X, E is a Banach space, f:Ω→E is a proper continuous map, f:Ω→E is an admissible (nonlinear) C′-Fredholm map of index zero,G:Ω→2^E is an upper semicontinuous compact set-valued map with compact convex values, p∈ E\(f-G)(?Ω). In this paper the degree deg(f-G,Ω,p) is defined.     

基于离散事件仿真的妇产科孕妇建卡接收规则优化

孕妇在怀孕九周后会选择一家医院申请建立孕妇档案卡(简称建大卡),管理者需决定是否接收。一旦该医院做出接收决策,孕妇将在该院接受妊娠期内的产检并在该医院分娩。孕妇在妊娠期内所需的医疗资源的多样化、尤其是对关键资源即病床需求时间及服务时间不确定性,增加了决策的难度,从而导致妇产科资源利用率分布不均衡,影响医疗服务质量。为了解决该问题,本文首先建立动态规划模型来最小化病床的空闲、加床和转院的惩罚成本。由于动态规划模型非常复杂,难以用解析方法来获取最优控制策略,因此本文建立离散事件仿真系统,以病床的空闲、加床和转院的惩罚成本最小化为目标,采用广域搜索对多种阈值控制策略进行参数优化。数值实验表明,本文提出的阈值策略比医院目前采用的阈值策略有显著改进,进一步进行了敏感度分析,发现随着到达率逐渐增大,期望成本首先逐渐降低然后在某一水平上波动,加床成本的上升对于期望成本的影响更大。     

油田注水系统拓扑布局优化的混合遗传算法

以投资最小为目标函数,建立了注水系统拓扑布局优化数学模型.根据模型特点,将优化问题分为两层,分别采用遗传算法和非线性优化方法进行求解.并对遗传算法的操作过程进行了改进,调整了适应函数,改进了交叉和变异操作,结合了模拟退火算法,在操作过程中使约束条件得到满足,减少了不可行解的产生,使遗传算法的优化性能得到了提高.优化算例说明了该方法的有效性.     

Multiple-Load Truss Topology and Sizing Optimization: Some Properties of Minimax Compliance

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.     

Generalized Surrogate Problem Methodology for Online Stochastic Discrete Optimization

We consider stochastic discrete optimization problems where the decision variables are nonnegative integers and propose a generalized surrogate problem methodology that modifies and extends previous work in Ref. 1. Our approach is based on an online control scheme which transforms the problem into a surrogate continuous optimization problem and proceeds to solve the latter using standard gradient-based approaches while simultaneously updating both the actual and surrogate system states. In contrast to Ref. 1, the proposed methodology applies to arbitrary constraint sets. It is shown that, under certain conditions, the solution of the original problem is recovered from the optimal surrogate state. Applications of this approach include solutions to multicommodity resource allocation problems; in these problems, exploiting the convergence speed of the method, one can overcome the obstacle posed by the presence of local optima.     

Discrete Filled Function Method for Discrete Global Optimization

A discrete filled function method is developed in this paper to solve discrete global optimization problems over strictly pathwise connected domains. Theoretical properties of the proposed discrete filled function are investigated and a solution algorithm is proposed. Numerical experiments reported in this paper on several test problems with up to 200 variables have demonstrated the applicability and efficiency of the proposed method.     

Primal-Dual Newton-Type Interior-Point Method for Topology Optimization

We consider the problem of minimization of energy dissipation in a conductive electromagnetic medium with a fixed geometry and a priori given lower and upper bounds for the conductivity. The nonlinear optimization problem is analyzed by using the primal-dual Newton interior-point method. The elliptic differential equation for the electric potential is considered as an equality constraint. Transforming iterations for the null space decomposition of the condensed primal-dual system are applied to find the search direction. The numerical experiments treat two-dimensional isotropic systems.     

On the Discrete Spectrum of a Family of Differential Operators

We consider a family A of differential operators in L ²(²) depending on a parameter 0. The operator A formally corresponds to the quadratic form

基于多点自由度约束的方向性保形拓扑优化设计方法

保持飞行器气动面、功能面等型面的精确外形是飞行器刚度设计的重要内容.为控制飞行器结构局部区域的翘曲变形模式,抑制特定方向上有害的翘曲变形,提出考虑结构方向性保形约束的拓扑优化设计新方法.一方面,引入由保形区域内有限控制点生成的人工附加弱单元(artificial weak elements,AWEs),使控制点各自由度位移通过多点自由度约束(multi-point constraints,MPCs)传递到AWEs上,约束AWEs的变形能可以实现对保形区域翘曲变形的抑制;另一方面,合理配置多点自由度约束,将需要抑制的特定方向上自由度耦合到AWEs上,从而实现方向性保形优化设计.数值算例证明所提出的优化设计方法能在结构刚度拓扑优化设计的基础上实现对局部保形区域在特定方向上翘曲变形的有效控制,与已有约束所有自由度翘曲变形的保形拓扑优化设计相比,方向性保形优化设计在变形控制效果上更加具有灵活性.     

Min-Max Optimization of Several Classical Discrete Optimization Problems

In this paper, we study discrete optimization problems with min-max objective functions. This type of problems has direct applications in the recent development of robust optimization. The following well-known classes of problems are discussed: minimum spanning tree problem, resource allocation problem with separable cost functions, and production control problem. Computational complexities of the corresponding min-max version of the above-mentioned problems are analyzed. Pseudopolynomial algorithms for these problems are provided under certain conditions.     

Online Surrogate Problem Methodology for Stochastic Discrete Resource Allocation Problems

We consider stochastic discrete optimization problems where the decision variables are nonnegative integers. We propose and analyze an online control scheme which transforms the problem into a surrogate continuous optimization problem and proceeds to solve the latter using standard gradient-based approaches, while simultaneously updating both the actual and surrogate system states. It is shown that the solution of the original problem is recovered as an element of the discrete state neighborhood of the optimal surrogate state. For the special case of separable cost functions, we show that this methodology becomes particularly efficient. Finally, convergence of the proposed algorithm is established under standard technical conditions; numerical results are included in the paper to illustrate the fast convergence of this approach.     

应力和位移约束下连续体结构拓扑优化

同时考滤应力和位移约束的连续体结构拓扑优化问题,很难用现有的均匀方法或变密度方法等求解。主要困难在于难以建立应力和位移约束与拓扑设计变量间显式关系式;即使建立了这种关系,也由于优化问题规模过大,利用常规的数学规划方法难以求解。隋允康、杨德庆曾提出了基于独立连续拓扑变量及映射变换（ＩＣＭ）的桁架结构拓扑优化模型。本文在此基础上,建立了以重量为目标,考虑应力和位移约束的连续体结构拓扑优化模型,并推导出     

离散单因素投资组合模型的对偶算法

本文研究金融优化中的离散单因素投资组合问题,该问题与传统投资组合模型的不同之处是决策变量为整数(交易手数),从而导致要求解一个二次整数规划问题．针对该模型的可分离性结构,我们提出了一种基于拉格朗日对偶和连续松弛的分枝定界算法。我们分别用美国股票市场的交易数据和随机产生的数据对算法进行了测试．数值结果表明该算法是有效的,可以求解多达150个风险证券的离散投资组合问题．