分组坐标轮换法与机械优化设计

minimax 问题是工程优化设计中普遍存在的问题。本文首次采用分组坐标轮换法求解该问题,通过分析获得了该算法收敛的充分条件(如果收敛,还可计算最大轮换次数)。一些数值计算验证了文中的结论,本文还把该算法用于四连杆实现函数机构的优化设计.     

Exact algorithms for scheduling multiple families of jobs on parallel machines

In many practical manufacturing environments, jobs to be processed can be divided into different families such that a setup is required whenever there is a switch from processing a job of one family to another job of a different family. The time for setup could be sequence independent or sequence dependent. We consider two particular scheduling problems relevant to such situations. In both problems, we are given a set of jobs to be processed on a set of identical parallel machines. The objective of the first problem is to minimize total weighted completion time of jobs, and that of the second problem is to minimize weighted number of tardy jobs. We propose column generation based branch and bound exact solution algorithms for the problems. Computational experiments show that the algorithms are capable of solving both problems of medium size to optimality within reasonable computational time. © 2003 Wiley Periodicals, Inc. Naval Research Logistics 50: 823–840, 2003.     

Modified couple stress and thickness-stretching included formulation of a sandwich micro shell subjected to electro-magnetic load resting on elastic foundation

This paper studies electromagnetoelastic static investigation of a sandwich doubly curved microshell subjected to multi-field loading based on a new thickness stretching included refined higher order shear/normal deformable model. Modified-couple-stress-theory (MCST) is used for accounting small-scale-dependency. The numerical results are derived using an analytical method. The effect of small scale parameter in micro scale, initial electric and magnetic potentials and foundation parameters is studied on the electromagnetoelastic bending results. It is confirmed an enhancing in stiffness of small scale shell with an increase in micro length scale parameter.     

雷达目标识别的频域极小极大法

本文研究了雷达目标识别过程中关于目标的编码、分类特征的提取与选择等问题。提出了利用极小极大原则从频域中获取目标特征系数的方法,论述了它的数学框架以及寻求最佳解的算法步骤。利用实测的目标散射数据进行试验研究,结果表明了本文理论的正确性及其方法的有效性。     

某自行战车火控系统动态航路制定及软件实现

根据某型自行战车对空中目标作战的精度需求,为突破火控系统自带动态航路的局限性,提出了动态航路制定模型.在基准战车时目标起始点坐标进行测量的基础上,由连战斗队形配置确定全连其余战车相对基准车档坐标值,通过坐标转换计算,得到其余战车动态航路参数.采用面向对象的可视化编程语言C#2.0编写程序,设计动态航路制定软件.通过举例分析,证明了该方法的可行性,为有效提高自行战车的射击精度提供了一种较为科学的方法.     

基于最小最大决策的三站时差定位布阵优化

提出了一种基于最小最大决策的三站时差定位布阵优化方法,以提高系统对目标区域的整体定位精度。应用基于最小最大决策的最优化理论,建立布阵优化问题的数学模型。该模型以三站坐标为决策变量,以目标区域的最大水平定位误差最小为目标函数,然后运用基于最小最大决策的最优化算法,求解模型的最优解,并将此最优解作为三站时差定位系统的最优布阵。仿真结果与理论计算一致,验证了这种布阵优化结果的最优性。     

minimax问题的广义共轭向量法

本文按照共轭向量法的理论,针对非奇异对称矩阵提出了广义共轭向量的概念,并论述了它的三个重要性质(线性独立性、可寻驻点和可扩展性)。在此基础上,构造了极小极大(minimax)问题的广义共轭向量法。理论分析表明,该算法具有二次终止性质,且在每一维搜索时具有确定的寻优特征(求极小或求极大)。该算法为用拉格朗日乘子法求解数学规划提供了一个可能的途径。计算实例表明该算法是有效的。     

The one‐warehouse multiretailer problem with an order‐up‐to level inventory policy

We consider a two‐level system in which a warehouse manages the inventories of multiple retailers. Each retailer employs an order‐up‐to level inventory policy over T periods and faces an external demand which is dynamic and known. A retailer's inventory should be raised to its maximum limit when replenished. The problem is to jointly decide on replenishment times and quantities of warehouse and retailers so as to minimize the total costs in the system. Unlike the case in the single level lot‐sizing problem, we cannot assume that the initial inventory will be zero without loss of generality. We propose a strong mixed integer program formulation for the problem with zero and nonzero initial inventories at the warehouse. The strong formulation for the zero initial inventory case has only T binary variables and represents the convex hull of the feasible region of the problem when there is only one retailer. Computational results with a state‐of‐the art solver reveal that our formulations are very effective in solving large‐size instances to optimality. © 2010 Wiley Periodicals, Inc. Naval Research Logistics, 2010     

索的UL列式分析方法

通过求解索的微分方程边值问题 ,提出了分析索的收敛迭代公式。利用迭代解可顺利地确定索端位置坐标差、索力及索重之间的关系。算例表明 :本文计算索的方法 ,理论上可达到任意高的精度 ,可十分方便地用于含有索或索网混合复杂结构物的大变形分析 ,用这种方法能解决斜拉桥缆索应力松驰的计算问题。     

Formulations for dynamic lot sizing with service levels

In this article, we study deterministic dynamic lot‐sizing problems with a service‐level constraint on the total number of periods in which backlogs can occur over a finite planning horizon. We give a natural mixed integer programming formulation for the single item problem (LS‐SL‐I) and study the structure of its solution. We show that an optimal solution to this problem can be found in \begin{align*}\mathcal O(n^2\kappa)\end{align*} time, where n is the planning horizon and \begin{align*}\kappa=\mathcal O(n)\end{align*} is the maximum number of periods in which demand can be backlogged. Using the proposed shortest path algorithms, we develop alternative tight extended formulations for LS‐SL‐I and one of its relaxations, which we refer to as uncapacitated lot sizing with setups for stocks and backlogs. {We show that this relaxation also appears as a substructure in a lot‐sizing problem which limits the total amount of a period's demand met from a later period, across all periods.} We report computational results that compare the natural and extended formulations on multi‐item service‐level constrained instances. © 2013 Wiley Periodicals, Inc. Naval Research Logistics, 2013