Multiple subset sum with inclusive assignment set restrictions

In a traditional multiple subset sum problem (MSSP), there is a given set of items and a given set of bins (or knapsacks) with identical capacities. The objective is to select a subset of the items and pack them into the bins such that the total weight of the selected items is maximized. However, in many applications of the MSSP, the bins have assignment restrictions. In this article, we study the subset sum problem with inclusive assignment set restrictions, in which the assignment set of one item (i.e., the set of bins that the item may be assigned to) must be either a subset or a superset of the assignment set of another item. We develop an efficient 0.6492‐approximation algorithm and test its effectiveness via computational experiments. We also develop a polynomial time approximation scheme for this problem. © 2011 Wiley Periodicals, Inc. Naval Research Logistics, 2011     

Production‐inventory systems with imperfect advance demand information and updating

We consider a supplier with finite production capacity and stochastic production times. Customers provide advance demand information (ADI) to the supplier by announcing orders ahead of their due dates. However, this information is not perfect, and customers may request an order be fulfilled prior to or later than the expected due date. Customers update the status of their orders, but the time between consecutive updates is random. We formulate the production‐control problem as a continuous‐time Markov decision process and prove there is an optimal state‐dependent base‐stock policy, where the base‐stock levels depend upon the numbers of orders at various stages of update. In addition, we derive results on the sensitivity of the state‐dependent base‐stock levels to the number of orders in each stage of update. In a numerical study, we examine the benefit of ADI, and find that it is most valuable to the supplier when the time between updates is moderate. We also consider the impact of holding and backorder costs, numbers of updates, and the fraction of customers that provide ADI. In addition, we find that while ADI is always beneficial to the supplier, this may not be the case for the customers who provide the ADI. © 2011 Wiley Periodicals, Inc. Naval Research Logistics, 2011     

一种基于球坐标系的四站三维时差定位算法

提出了一种在球坐标系下的无源时差定位算法,该算法解决了参变量法中难于解决的模糊和无解问题,计算量小,定位结果可信。当布站接近平面时,本算法可独立进行定位,当站址高度差较大时本算法可以与参变量法相配合解决模糊和无解问题,适合于工程应用。     

无源雷达菱形布站的定位精度分析

为了得到无源雷达菱形布站的最佳布站方案,分析了时差定位算法的基本原理,推导了定位精度的数学模型,考虑了影响定位精度的各种因素。通过计算机仿真实验对比了在不同主站位置、不同站间距离以及不同主站高度的情况下菱形布站的GDOP(geometric d ilution of precision)等值线分布,最终得出了定位精度与布站之间的联系,为无源雷达最优菱形布站提供了理论依据。     

末制导炮弹射表参数程控时间的研究

末制导炮弹属于制导武器,正是由于程控时间和激光开机时间的存在(需要人为给定)致使其弹道比较复杂.程控时间体现为惯性制导的开始,激光开机时间体现为激光末制导的开始,这两种制导的实现都是通过舵片的偏转来实现.从射表编拟的角度出发,通过仿真研究程控时间对末制导炮弹弹道参数的影响,给出了程控时间确定的一些原则,为编制高精度的射...     

自适应二阶滑模制导律

传统基于Lyapunov定理所设计的制导律无法保证制导系统的有限时间收敛.基于滑模控制理论,给出了一种二阶滑模有限时间收敛方法,并将该方法与机动目标拦截情形相结合,进行制导律的设计.该制导律首项使得视线转率趋于0,而扩展项可满足视线成型,滑模面的有限时间收敛等特性.针对2种典型的目标机动形式进行了仿真研究,结果表明该滑模制导律可以实现目标的有效拦截,满足上述特性.     

激光熔覆搭接过程残余应力应变的有限元计算

激光熔覆过程中产生的残余应力与应变对熔覆层的裂纹开裂倾向有重要影响。利用有限元法对激光多道搭接过程熔覆层的残余应力和应变进行计算,计算过程中主要考虑瞬时温度变化引起的热应力、σ-ε曲线、有限元网格、力学边界条件4个方面。热应力主要在温度场计算结果的基础上求得;σ-ε曲线采用的是线性强化材料的弹塑性曲线;有限元网格主要采用分区划分的形式进行。通过计算,得到了搭接后的熔覆层上关键点的残余应力和应变分别为1 400 MPa和2.2×10^-2。结果表明：搭接熔覆层交界处的点产生焊趾裂纹的倾向最大,第1道熔覆顶点处产生横向裂纹的倾向次之。     

T型坑道中爆炸冲击波传播规律的数值模拟

为了确定地下坑道中防护门上的冲击波荷载,首先需要弄清爆炸冲击波在坑道中的传播衰减规律.在模型坑道爆炸实验数据验证的基础上,应用数值模拟方法研究了T型坑道中爆炸冲击波的传播衰减规律.通过大量不同模型尺寸、不同炸药药量的数值模拟,得到了T型坑道中平面冲击波的形成位置,提出了爆炸冲击波通过T型坑道拐弯时新的冲击波压力衰减系数...     

某共享通讯塔加装天线后结构安全性校核

对某共享通讯铁塔加装天线后结构安全性进行校核,建立了基于不同梁杆单元及节点连接的通讯铁塔空间刚架和混合有限元模型,对其结构动态特性及静力分析结果进行了对比分析,指出两种不同模型的动态特性相差不大,采用刚架模型来复核偏于安全;对通讯塔在加装天线后在风荷载及塔自重作用下结构安全性评估,并对该铁塔底层塔段弦杆中点变形超限的特...     

战时交通运输路径优化研究

以战时交通运输路径优化问题为研究对象,分析问题特点,考虑多式联运,以运输时间代价、运输费用代价、路段和运输节点的危险性代价为优化目标,建立起广义运输代价最小的运输路径优化模型,并设计了蚁群算法来求解问题模型。给出的算例表明,文中模型符合战时交通运输的特点和实际需要,可为确定战时运输路径提供决策支持,而采用的蚁群算法是求解该问题的一种有效方法。