A dynamic allocation heuristic for centralized safety stock

An inventory system that consists of a depot (central warehouse) and retailers (regional warehouses) is considered. The system is replenished regularly on a fixed cycle by an outside supplier. Most of the stock is direct shipped to the retailer locations but some stock is sent to the central warehouse. At the beginning of any one of the periods during the cycle, the central stock can then be completely allocated out to the retailers. In this paper we propose a heuristic method to dynamically (as retailer inventory levels change with time) determine the appropriate period in which to do the allocation. As the optimal method is not tractable, the heuristic's performance is compared against two other approaches. One presets the allocation period, while the other provides a lower bound on the expected shortages of the optimal solution, obtained by assuming that we know ahead of time all of the demands, period by period, in the cycle. The results from extensive simulation experiments show that the dynamic heuristic significantly outperforms the “preset” approach and its performance is reasonably close to the lower bound. Moreover, the logic of the heuristic is appealing and the calculations, associated with using it, are easy to carry out. Sensitivities to various system parameters (such as the safety factor, coefficient of variation of demand, number of regional warehouses, external lead time, and the cycle length) are presented. © 2005 Wiley Periodicals, Inc. Naval Research Logistics, 2005.     

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     

Optimal control of a capacitated inventory system with multiple demand classes

This article studies the optimal control of a periodic‐review make‐to‐stock system with limited production capacity and multiple demand classes. In this system, a single product is produced to fulfill several classes of demands. The manager has to make the production and inventory allocation decisions. His objective is to minimize the expected total discounted cost. The production decision is made at the beginning of each period and determines the amount of products to be produced. The inventory allocation decision is made after receiving the random demands and determines the amount of demands to be satisfied. A modified base stock policy is shown to be optimal for production, and a multi‐level rationing policy is shown to be optimal for inventory allocation. Then a heuristic algorithm is proposed to approximate the optimal policy. The numerical studies show that the heuristic algorithm is very effective. © 2011 Wiley Periodicals, Inc. Naval Research Logistics 58: 43–58, 2011     

Fashion products with asymmetric sales horizons

In this study, we explore an inventory model for a wholesaler who sells a fashion product through two channels with asymmetric sales horizons. The wholesaler can improve profitability by employing joint procurement and inventory reallocation as a recourse action in response to the dynamics of sales. In this research, a simple stochastic programming model is analyzed to specify the properties of the optimal inventory decisions. © 2011 Wiley Periodicals, Inc. Naval Research Logistics, 2011     

辐射时间和能量限制下雷达最优脉冲积累研究

为了限制雷达辐射,提高雷达的隐蔽性,研究了给定雷达辐射时间和能量限制下的雷达最优脉冲积累检测问题,提出了一种最优脉冲积累数的选择模型,分别得出了确知脉冲串相参积累、随机相位脉冲串积累、随机振幅相位脉冲串积累情况下单脉冲信噪比与最优脉冲积累数的对应关系。研究结果对给定辐射时间和能量限制下提高雷达目标检测数目及跟踪精度有一定的理论和实际意义。     

基于作战效能的武器装备可靠性指标评估方法

装备可靠性的评估是装备管理使用中面临的重要课题.在总结前人的研究基础上,提出了一种基于武器装备作战效能的可靠性评估方法:建立非线性指标聚合的武器效能指标体系,通过主客观评分效果对底层指标进行打分,经过非线性指标聚合等手段获取装备效能的归一化评估指数,通过多次评估获取装备效能评估指数数据集,以此为基础对装备的可靠性进行评估.最后给出了评估仿真实例,实验结果表明所提方法的有效性、可行性.     

多孔介质中气体流量对流动阻力影响的实验研究

对空气在多孔介质(Pd/SiO2颗粒催化剂)中的流动阻力特性进行了冷态实验,研究了气体流量对流动阻力的影响.结果表明:催化剂厚度一定时,随着气体流量增大,多孔介质中的流动阻力也逐渐增大.经过与经典阻力计算公式对比,分析了偏差影响因素.最后,结合实验数据拟合出了适合管式反应器中流动阻力计算的半经验公式,能精确地预测颗粒填...     

网络化弹药协同作战效能研究

首先分析了网络化弹药协同作战的过程,提出了网络化弹药作战效能的评估方法及定义,并对影响作战效能的因素进行了分析。针对作战方案在实战或仿真推演过程中反映战场态势等方面的特征,相应地提出了网络化弹药作战的效能指标:目标识别率、目标杀伤率、假目标攻击率、效费比,然后利用作战仿真法,验证了不同影响因素下协同作战和非协同作战的效能。仿真结果表明了网络化弹药协同作战具有较高的作战效能。     

基于声望模型的无线Mesh网络多信道MAC协议

文章针对现有多信道动态接入协议在数据信道接入中存在冲突概率较大,数据报文传输成功率较低的问题,提出了一种基于声望模型的信道分配算法。该算法通过引入遗忘因子来反映历史经验对当前信道选择的影响,并根据链路接收方节点中可用信道的声望值大小,选取出期望传输成功率最高的信道。仿真表明该算法在相同网络环境中,能有效提高数据报文传输的成功率,增加网络的整体吞吐量。     

基于SEAS方法的C4ISR系统效能评价

首先介绍了SEA及SEAS方法,分析了SEA在C4ISR系统效能评价方面的不足,指出了SEAS方法更适合用于评价C4ISR系统的效能;接着提出了利用SEAS方法对C4ISR系统效能评价的三种任务模式:单一任务模式,交战任务模式,规模作战任务模式;之后结合具体案例论述了SEAS方法评价C4ISR系统的过程;最后给出了SEAS评价结果及分析方法.