The minmax multidimensional knapsack problem with application to a chance‐constrained problem

In this paper we present a new combinatorial problem, called minmax multidimensional knapsack problem (MKP), motivated by a military logistics problem. The logistics problem is a two‐period, two‐level, chance‐constrained problem with recourse. We show that the MKP is NP‐hard and develop a practically efficient combinatorial algorithm for solving it. We also show that under some reasonable assumptions regarding the operational setting of the logistics problem, the chance‐constrained optimization problem is decomposable into a series of MKPs that are solved separately. © 2007 Wiley Periodicals, Inc. Naval Research Logistics, 2007     

Parallel machine scheduling with eligibility constraints: A composite dispatching rule to minimize total weighted tardiness

We study a parallel machine scheduling problem, where a job j can only be processed on a specific subset of machines M_j, and the M_j subsets of the n jobs are nested. We develop a two‐phase heuristic for minimizing the total weighted tardiness subject to the machine eligibility constraints. In the first phase, we compute the factors and statistics that characterize a problem instance. In the second phase, we propose a new composite dispatching rule, the Apparent Tardiness Cost with Flexibility considerations (ATCF) rule, which is governed by several scaling parameters of which the values are determined by the factors obtained in the first phase. The ATCF rule is a generalization of the well‐known ATC rule which is very widely used in practice. We further discuss how to improve the dispatching rule using some simple but powerful properties without requiring additional computation time, and the improvement is quite satisfactory. We apply the Sequential Uniform Design Method to design our experiments and conduct an extensive computational study, and we perform tests on the performance of the ATCF rule using a real data set from a large hospital in China. We further compare its performance with that of the classical ATC rule. We also compare the schedules improved by the ATCF rule with what we believe are Near Optimal schedules generated by a general search procedure. The computational results show that especially with a low due date tightness, the ATCF rule performs significantly better than the well‐known ATC rule generating much improved schedules that are close to the Near Optimal schedules. © 2017 Wiley Periodicals, Inc. Naval Research Logistics 64: 249–267, 2017     

带三维落角约束的寻的导弹制导与姿控系统设计

针对带三维落角约束的寻的导弹制导与姿态控制系统设计问题,提出一种基于终端滑模控制和扩张状态观测器的六自由度制导控制系统设计方法。建立包含模型不确定项的寻的导弹六自由度质心与绕质心模型,设计内外双层环路六自由度制导控制系统框架;基于弹-目三维相对运动模型和坐标系转移矩阵建立以攻角和侧滑角为输入的三维全耦合导引方程,利用终端滑模控制方法和扩展状态观测器得到期望的攻角和侧滑角并将其转化为对应的俯仰、偏航和滚转角指令;根据线性形式的寻的导弹绕质心动力学方程,设计与俯仰、偏航和滚转角相关的滑模面向量,并利用终端滑模控制方法和扩张状态观测器得到寻的导弹的副翼偏角、方向舵偏角和俯仰舵偏角指令。六自由度数值仿真结果验证了该方法的有效性和鲁棒性,并证明了该制导控制系统设计方法能以较少的控制设计参数完成预设的制导控制任务。     

平流层飞艇抗风场干扰约束Unscented卡尔曼滤波算法设计与应用

为了提高风场干扰环境下飞艇的导航精度,研究飞艇抗风场干扰导航算法。在建立风场干扰条件下飞艇速度误差约束模型的基础上,设计抗风场干扰的约束Unscented卡尔曼滤波算法。确定风场干扰条件下飞艇的速度误差约束量,将该约束与Unscented卡尔曼滤波算法相结合,对速度误差进行估计和补偿,以减小风场对飞艇定位精度的影响;证明该算法的状态估计量不仅是无偏的,而且协方差小于标准Unscented卡尔曼滤波的协方差;将提出的算法应用于捷联惯导/天文/合成孔径雷达组合导航系统中进行仿真验证,并与自适应扩展卡尔曼滤波和抗差自适应Unscented卡尔曼滤波算法进行比较。结果表明:提出的约束Unscented卡尔曼滤波算法的滤波性能明显优于自适应扩展卡尔曼滤波和抗差自适应Unscented卡尔曼滤波算法,能够有效抑制风场对飞艇定位精度的影响,提高飞艇的导航定位精度。     

考虑弹体动态特性的机动效率约束导引律

针对考虑交会角和过载约束导引律在大机动时能量损失大的问题,提出一种考虑导弹机动效率的多约束制导律。应用最优二次型原理推导出考虑一阶弹体延迟的时变导引系数闭环次优制导形式,将导弹机动时刻阻力系数引入时变权系数,并通过迭代确定机动效率约束边界。将时变约束表示成剩余时间与弹体延迟时间的函数,代入制导指令,进行弹道仿真。结果表明,对于常值与机动目标,文中制导律与过载约束导引律同只考虑交会角约束的导引律相比,对目标均能实现末端弹道成型要求,而考虑机动效率的制导指令分配更为合理,在避免指令加速度饱和的同时有效降低了拦截末端速度损耗,提高制导精度与毁伤效果。且该制导律中时变权系数无须配平求解,在保证精度的同时极大地提高了迭代速度。     

仿生机器人运动建模与控制研究进展

综述了几何方法在仿生机器人运动建模和控制中应用的最新成果,探讨了在统一框架下处理多种机器人运动问题的可行性.     

Short‐term capacity allocation problem with tool and setup constraints

We consider a short‐term capacity allocation problem with tool and setup constraints that arises in the context of operational planning in a semiconductor wafer fabrication facility. The problem is that of allocating the available capacity of parallel nonidentical machines to available work‐in‐process (WIP) inventory of operations. Each machine can process a subset of the operations and a tool setup is required on a machine to change processing from one operation to another. Both the number of tools available for an operation and the number of setups that can be performed on a machine during a specified time horizon are limited. We formulate this problem as a degree‐constrained network flow problem on a bipartite graph, show that the problem is NP‐hard, and propose constant factor approximation algorithms. We also develop constructive heuristics and a greedy randomized adaptive search procedure for the problem. Our computational experiments demonstrate that our solution procedures solve the problem efficiently, rendering the use of our algorithms in real environment feasible. © 2005 Wiley Periodicals, Inc. Naval Research Logistics, 2005     

A bidirectional heuristic for maximizing the net present value of large‐scale projects subject to limited resources

We consider the scheduling of large‐scale projects to maximize the project net present value given temporal and resource constraints. The net present value objective emphasizes the financial aspects of project management. Temporal constraints between the start times of activities make it possible to handle practical problem assumptions. Scarce resources are an expression of rising cost. Since optimization techniques are not expedient to solve such problems and most heuristic methods known from literature cannot deal with general temporal constraints, we propose a new bidirectional priority‐rule based method. Scheduling activities with positive cash flows as early and activities with negative cash flows as late as possible results in a method which is completed by unscheduling techniques to cope with scarce resources. In a computational experiment, we compare the well‐known serial generation scheme where all activities are scheduled as early as possible with the proposed bidirectional approach. On the basis of a comprehensive data set known from literature containing instances with up to 1002 activities, the efficiency of the new approach is demonstrated. © 2003 Wiley Periodicals, Inc. Naval Research Logistics, 2003     

一种多约束条件下高超声速导弹对地攻击的三维最优变结构制导律

针对高超声速空地导弹多约束高精度末制导的基本需求,在三维解耦的俯仰平面和转弯平面上分别设计制导律。在综合考虑脱靶量、落角、入射角等多种约束条件后,运用最优控制构造的最优制导律设计了一种三维最优变结构制导律,接着利用梯度自适应下降法和T-S模型改进了速度约束控制。最后通过典型弹道的结果显示该制导律能够满足多约束高精度制导的需要,具有良好的弹道性能。     

Fully sequential procedures for comparing constrained systems via simulation

We consider the problem of finding the system with the best primary performance measure among a finite number of simulated systems in the presence of a stochastic constraint on a single real‐valued secondary performance measure. Solving this problem requires the identification and removal from consideration of infeasible systems (Phase I) and of systems whose primary performance measure is dominated by that of other feasible systems (Phase II). We use indifference zones in both phases and consider two approaches, namely, carrying out Phases I and II sequentially and carrying out Phases I and II simultaneously, and we provide specific example procedures of each type. We present theoretical results guaranteeing that our approaches (general and specific, sequential and simultaneous) yield the best system with at least a prespecified probability, and we provide a portion of an extensive numerical study aimed at evaluating and comparing the performance of our approaches. The experimental results show that both new procedures are useful for constrained ranking and selection, with neither procedure showing uniform superiority over the other.© 2010 Wiley Periodicals, Inc. Naval Research Logistics, 2010