A partial characterization of the optimal ordering/rationing policy for a periodic review system with two demand classes and backordering

We consider a finite horizon periodic review, single product inventory system with a fixed setup cost and two stochastic demand classes that differ in their backordering costs. In each period, one must decide whether and how much to order, and how much demand of the lower class should be satisfied. We show that the optimal ordering policy can be characterized as a state dependent (s,S) policy, and the rationing structure is partially obtained based on the subconvexity of the cost function. We then propose a simple heuristic rationing policy, which is easy to implement and close to optimal for intensive numerical examples. We further study the case when the first demand class is deterministic and must be satisfied immediately. We show the optimality of the state dependent (s,S) ordering policy, and obtain additional rationing structural properties. Based on these properties, the optimal ordering and rationing policy for any state can be generated by finding the optimal policy of only a finite set of states, and for each state in this set, the optimal policy is obtained simply by choosing a policy from at most two alternatives. An efficient algorithm is then proposed. © 2010 Wiley Periodicals, Inc. Naval Research Logistics, 2010     

Approximation results for min‐max path cover problems in vehicle routing

This article studies a min‐max path cover problem, which is to determine a set of paths for k capacitated vehicles to service all the customers in a given weighted graph so that the largest path cost is minimized. The problem has wide applications in vehicle routing, especially when the minimization of the latest service completion time is a critical performance measure. We have analyzed four typical variants of this problem, where the vehicles have either unlimited or limited capacities, and they start from either a given depot or any depot of a given depot set. We have developed approximation algorithms for these four variants, which achieve approximation ratios of max{3 ‐ 2/k,2}, 5, max{5 ‐ 2/k,4}, and 7, respectively. We have also analyzed the approximation hardness of these variants by showing that, unless P = NP , it is impossible for them to achieve approximation ratios less than 4/3, 3/2, 3/2, and 2, respectively. We have further extended the techniques and results developed for this problem to other min‐max vehicle routing problems.© 2010 Wiley Periodicals, Inc. Naval Research Logistics, 2010     

VC++和MATCOM结合在飞机基本飞行性能程序开发中的应用

简要分析了Matlab语言在科学工程计算中的优缺点;针对飞机飞行性能计算过程中的一些问题,介绍了一种调用Matcom语言对M文件进行编译,从而与VC 结合编程的新方法.并用实例说明该方法在飞机飞行性能科学计算和计算结果图形绘制中的应用,拓展了软件的应用范围和使用价值.     

装备采购与部署的系统动力学模型

在研究装备采办全过程的基础上,利用系统动力学仿真方法和“龙格-库塔”(Runge-Kutta)基本算法,重点对采购与部署子系统进行了建模和计算机仿真,在具体仿真结果输出的基础上,分析了影响装备采购与部署效率的因素,对装备如何尽快形成新的战斗力进行了简要的分析。     

DOS环境下双机实时火控系统软件设计

在舰载作战指挥与火力控制系统中,基于Multibus总线的计算机系统常配置成双机或多机工作方式,该文以某型火控系统为例介绍一种DOS环境下双机实时系统软件设计方法．     

紧固件拆装时间预计模型

紧固件拆装作业时间是影响机械产品维修性的主要因素之一,占机械产品维修作业时间的70％～80％。因此,探讨紧固件拆装作业时间的预计方法,对研究、设计机械产品的维修性,将是十分必要的。通过分析紧固件拆装作业过程,探索出了影响拆装作业时间的诸因素,并对所有的影响因素进行分析、权衡和回归,建立紧固件拆装作业时间的预计模型。将此模型在某型履带式车辆上进行了实际验证,证明了模型的正确性及通用性。     

空空导弹三维实时动态数字仿真

主要论述了某型空空导弹实现３维实时动态数字仿真的思路和方法,首先建立３维空战模型,然后通过一定的计算方法和编程技巧实现了数字仿真的实时性。在数字仿真实时性的基础上,实现了导弹攻击目标过程的３维动态图形显示。     

导弹电子设备电源线传导敏感度测试研究

采用ＣＳ０１测试法对导弹武器系统的电子设备进行电源线传导敏感度测试,由于测试指标和测试方法的限定要求,将不仅影响受试电子设备的正常工作,而且还会对ＣＳ０１设备本身产生不利影响。在分析产生上述影响原因的同时,有针对性地提出了有效的解决措施,使由于限定要求带来的不利影响降低到最低限度,以使导弹电子设备电源线传导敏感度测试能按国军标规定要求正常进行。     

面向GPU的非结构网格有限体积计算流体力学的图染色方法优化

采用图染色方法解决通量累加和局部最大压力计算引起的两种典型资源竞争问题,并通过共享内存的使用、体编号和面编号的重排、面数据的重排三种策略优化图染色方法。针对应用在空气动力学多种规模的三维网格,分别采用双精度和单精度操作数,在Nvidia Tesla V100和K80 GPU上,展开性能测试。结果表明:共享内存的优化效果不明显;体编号和面编号重排降低了图染色方法的计算性能;面数据重排可以有效地优化图染色方法;计算性能在V100上提高20%左右,在K80上提高15%左右。     

空空导弹测试性验证方法探讨

本文对空空导弹的测试性验证的主要内容、参数以及测试性的验证方法进行了探讨。根据空空导弹的特点,提出了以数据收集为主,以测试性验证试验为辅的方法,并对验证方法进行了详细阐述。