IDENTIFYING ALTERNATE OPTIMAL SOLUTIONS TO THE DESIGN APPROXIMATION PROBLEM IN STOCK CUTTING

The design approximation problem is a well known problem in stock cutting, where, in order to facilitate the optimization techniques used in the cutting process, it is required to approximate complex designs by simpler ones. Although there are algorithms available to solve this problem, they all suffer from an undesirable feature that they only produce one optimal solution to the problem, and do not identify the complete set of all optimal solutions. The focus of this paper is to study this hitherto unexplored aspect of the problem: specifically, the case is considered in which both the design and the parent material are convex shapes, and some essential properties of all optimal solutions to the design approximation problem are ascertained. These properties are then used to devise two efficient schemes to identify the set of all optimal solutions to the problem. Finally, the recovery of a desired optimal approximation from the identified sets of optimal solutions, is discussed.     

STRUCTURAL OPTIMIZATION USING A NEW LOCAL APPROXIMATION METHOD

A new method for solving structural optimization problems using a local function approximation algorithm is proposed. This new algorithm, called the Generalized Convex Approximation (GCA), uses the design sensitivity information from the current and previous design points to generate a sequence of convex, separable subproblems. The paper contains the derivation of the parameters associated with the approximation and the formulation of the approximated problem. Numerical results from standard test problems solved using this method are presented. It is observed that this algorithm generates local approximations which lead to faster convergence for structural optimization problems.     

MULTIVARIATE HERMITE APPROXIMATION FOR DESIGN OPTIMIZATION

An approximation based on multiple function and gradient information is developed using Hermite interpolation concepts. The goal is to build a high-quality approximation for complex and multidisciplinary design optimization problems employing analysis such as aeroservoelasticity, structural control, probability, etc. The proposed multidimensional approximation utilizes exact analyses data generated during the course of iterative optimization. The approximation possesses the property of reproducing the function and gradient information of known data points. The accuracy of the new approach is compared with linear, reciprocal and other standard approximations. Because the proposed algorithm uses more data points, its efficiency has to be compared in the context of iterative optimization.     

冲击动力问题的混合积分并行算法及应用

为了提高冲击动力问题的计算效率和速度,在分布式MIMD并行环境下,构造了冲击动力问题的混合时间步长显式积分并行算法.基于区域分裂法,该算法按照单元时间积分步长的大小来划分各个子区域,再把具有不同时间步长的子区域分配到网络机群中的各结点机上,并采用子循环的方法使各子区域的计算达到同步,然后通过消息传递软件―PVM来传递各子区域间的信息.最后通过工程算例可以看出;带有子循环的混合积分并行算法能够显著的提高运算效率和并行加速比,缩短计算时间.     

A HEURISTIC FOR THE DYNAMIC FACILITY LAYOUT PROBLEM

This paper presents a heuristic for the dynamic facility layout problem. All existing methods for solving this problem require the use of a dynamic programming model, the optimal solution of the quadratic assignment problem, or both. The proposed heuristic is based on the steepest-descent pairwise-interchange procedure to develop layouts utilizing material handling cost data from varying lengths of forecast windows as well as the explicit consideration of the corresponding rearrangement costs. Numeric results indicate that it typically performs as well as any existing methodology and only slightly worse than optimal.     

基于球面三角网格逼近的等距曲面逼近算法

给出了一种基于球面三角网格逼近的等距曲面逼近新算法。利用三角网格逼近基球面,然后计算此三角网格按中心沿在曲面扫凉而成空间区域的边界作为等距曲面的逼近。该算法计算简单,方便地解决了整体误差问题,而且所得到的逼近曲面是与原曲面同次数的NURBS曲面。     

Ⅰ型裂纹面中心区受均布载荷作用下的非对称动态扩展问题

通过复变函数论的方法,对Ⅰ型裂纹面中心区受均布载荷作用下的非对称动态扩展问题进行研究。采用自相似函数的方法可以获得应力、位移和应力强度因子的解析解。应用该法可以很容易地将所讨论的问题转化为Riemann—Hilbert问题,然后应用Muskhelishvili方法就可以相当简单地得到问题的闭合解。利用这些解并采用叠加原理,就可以很容易地求得任意复杂问题的解。     

Ⅰ型裂纹面中心区受均布载荷作用下的非对称动态扩展问题

通过复变函数论的方法,对Ⅰ型裂纹面中心区受均布载荷作用下的非对称动态扩展问题进行研究.采用自相似函数的方法可以获得应力、位移和应力强度因子的解析解.应用该法可以很容易地将所讨论的问题转化为Riemann-Hilbert问题, 然后应用Muskhelishvili方法就可以相当简单地得到问题的闭合解.利用这些解并采用叠加原理,就可以很容易地求得任意复杂问题的解.     

MARKOV APPROXIMATION TO FATIGUE CRACK SIZE DISTRIBUTION

The distribution of the crack size during the fatigue crack propagation phenomenon is investigated. A Markovian modeling of the crack is introduced through the fatigue crack growth law, and the associated Fokker-Planck equation is written while special care is devoted to specifying its boundary conditions. This equation is solved by the method of separation of variables and the sought distribution function is obtained in the form of a convergent infinite series. An illustrative example, demonstrating the applicability of the approach, shows satisfactory agreement between theoretical results and experimental data.     

基于广义遗传算法的结构动力响应优化

为提高广义遗传算法的收敛效率,提出了防止遗传算法发生早熟收敛的异种机制,给出了一个判断种群近亲繁殖程度的判别式和两种选择异种的方法,并结合种群隔离机制、算术杂交、自适应随机变异等数值方法设计了新的广义遗传算法。将该算法应用于结构动力响应的支撑位置优化问题。数值算例表明:异种机制能够明显提高遗传算法的收敛效率,并有效防止早熟收敛;带有异种机制的新广义遗传算法能够解决具有抗弯刚度的结构动力响应支撑位置优化问题,对于求解复杂的结构动力响应支撑位置优化具有较强的适用性。     

一种新的拱坝形状优化方法

虚拟层合单元可以应用于结构的形状优化.这一单元的主要思想在于引入了弹性模量等于零即无实际材料的虚拟层,基于这一特点,单元内层的厚度被取作设计变量,而决定外部边界的单元节点坐标在优化过程中却始终保持不变.于是,有限元网格只在优化初始生成一次,优化过程无需改变原始数据,由此避免了通常形状优化方法所需要的单元网格重新划分.拱坝形状优化过程中利用有限元法作为结构分析方法,而不是通常的拱梁分载法.1型拱坝的算例说明了这一方法的有效性和实用性.     

有限元法求解广义热弹耦合一维热冲击问题

为了避免积分变换方法在求解Lord-Shulman(L-S)型广义热弹性耦合问题时由于数值反变换所引起的计算精度降低的问题,该文应用直接有限元方法,求解了基于L-S型广义热弹性理论的窄条薄板受热冲击作用的动态响应问题,结果表明,该方法对求解L-S型广义热弹性耦合的一维问题具有很高的精度。该文给出了L-S型广义热弹性理论下的热弹耦合的控制方程,建立了L-S型的广义热弹性问题的虚位移原理,推导得到了相应的有限元方程。计算得到了窄条薄板中无量纲温度、无量纲位移及无量纲应力的分布规律,从温度分布图上可以清晰地观察到热波波前的特有属性,即热波波前处存在明显的温度梯度的突变。     

飞行器动态数据存储测试系统的可靠性分析

本文针对某回收式飞行器动态数据存储测试系统,从可靠性设计理论出发,在建立元器件可靠性模型及分析了飞行器测试系统的应用环境、构成系统可靠性关键元器件工作环境的基础上,对飞行器测试系统进行了详细可靠性预计计算,预测系统是否能达到要求的可靠性指标。在分析了一种可靠性分配算法的基础上,进行可靠性分配,将系统的可靠性指标分配到构成系统的电路单元上。     

A RESULT APPLICABLE TO A PARTICULAR CLASS OF BRANCHED OPTIMIZATION PROBLEMS

Branched trajectory optimization problems can exhibit peculiar properties In the normal formulation of such problems, it is generally assumed that one should always include all trajectory segments after the branch point in the solution. In this paper, it is shown that for a certain important class of branched optimization problems, the inclusion of all trajectory segments after the branch can sometimes lead to non-optimal results     

用Kissinger方法测定非晶材料晶化激活能时应注意的问题

应用Ｋｉｓｓｉｎｇｅｒ方法测定非晶材料晶化激活能时应确保所选温度对应的晶化分数相差不大，否则将会引入较大误差。以ＮｉＴｉ非晶薄膜为例对此作了讨论。     

A DYNAMIC PROGRAMMING APPROACH TO THE ECONOMIC DESIGN OF X-CHARTS

Recent technological advances have rendered dynamic process control a viable alternative. A dynamic programming approach is proposed for the modeling and cost minimization of statistical process control activities. The decision parameters of the control chart are allowed to change dynamically as new information about the process becomes available. This general approach has been known as a theoretical possibility for many years, but its practical performance is explicitly investigated in this paper. It is shown with numerical examples that the dynamic programming solution can be much more economical than the conventional static solution with fixed control chart parameters. The substantial potential cost savings and the feasibility of a dynamic control procedure suggest that dynamic process control should replace standard statistical or economic design of control charts as the preferred method in automated production processes.     

多个移动车辆作用下简支梁的动力响应分析

将简支梁桥简化为欧拉-伯努利梁模型,考虑四自由度车辆移动系统与结构表面接触处不平顺产生的随机激励,建立了多个移动车辆振动系统与梁的耦合动力效应模型。在数值算例中,计算了不同模态截断阶数情况下由动力效应产生的挠曲线;讨论了移动速度变化时,在梁上作用不同荷载组合情况下冲击系数的变化规律;并讨论了跨径变化时冲击系数的变化规律;最后比较了在不同等级平整度情况下梁的动弯矩、动剪力的结果。     

两相介质大变形动力问题的数值模拟

基于Biot理论和u-p列式,推导了两相介质动力问题的控制方程。固相的位移和液相孔隙压力是两个基本的未知量。采用更新的Lagrangian方法和Jaumann应力对这一耦合问题进行了大变形分析。用建议的方法,对一饱和土柱在静力和动力荷载作用下的反应进行了数值模拟,并对大、小变形理论下的计算结果进行了对比。