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.     

When are observed failures more informative than observed survivals?

A framework involving independent competing risks permits observing failures due to a specific cause and failures due to a competing cause, which constitute survival times from the cause of primary interest. Is observing more failures more informative than observing survivals? Intuitively, due to the definitiveness of failures, the answer seems to be the former. However, it has been shown before that this intuition holds when estimating the mean but not the failure rate of the exponential model with a gamma prior distribution for the failure rate. In this article, we address this question at a more general level. We show that for a certain class of distributions failures can be more informative than survivals for prediction of life length and vice versa for some others. We also show that for a large class of lifetime models, failure is less informative than survival for estimating the proportional hazards parameter with gamma, Jeffreys, and uniform priors. We further show that, for this class of lifetime models, on average, failure is more informative than survival for parameter estimation and for prediction. These results imply that the inferential purpose and properties of the lifetime distribution are germane for conducting life tests. © 2013 Wiley Periodicals, Inc. Naval Research Logistics, 2013     

一种复合制导的中末交班策略研究

针对复合制导中的中末制导交班问题,设计了一种可同时实现导引头和弹道交班的方案.中制导应用变结构控制理论设计了一种中制导律使导引头在中制导结束时指向目标;交接导引段实现比例系数的过渡,从而保证了弹道的平滑过渡.仿真结果证明了该方案能够适用于远距离制导的复合制导.     

基于混合智能算法的小型通信干扰装备分配优化

如何充分发挥小型通信干扰装备的作战效能是指挥员面临的棘手问题。本文将战术指标——干扰后的通信畅通区覆盖程度作为评估通信干扰装备分配优劣的指标,分别建立了单机和多部干扰时的通信干扰有效压制区和通信畅通区边界的计算模型,并给出了通信干扰有效压制区和通信畅通区面积的计算方法。构建了基于机会约束规划的空域频域通信干扰任务分配模型,并设计了混合蚁群算法和遗传算法的模型求解算法。最后进行了仿真实验,验证分析了模型和算法的合理性。研究成果为通信对抗战术计算和作战运用研究拓展了思路。     

Mixed rules in multi‐issue allocation situations

Multi‐issue allocation situations study problems where an estate must be divided among a group of agents. The claim of each agent is a vector specifying the amount claimed by each agent on each issue. We present a two‐stage rule. First, we divide the estate among the issues following the constrained equal awards rule. Second, the amount assigned to each issue is divided among the agents in proportion to their demands on this issue. We apply the rule to two real‐world problems: the distribution of natural resources between countries and the distribution of budget for education and research between universities.     

空空导弹随机最优导引规律的研究

通过建立导弹目标攻击简化数学模型 ,提出一种随机最优导引规律 ;运用卡尔曼滤波理论 ,引进了机动目标加速度和量测系统的不确定性。通过数字仿真 ,分别和传统比例导引规律、扩展比例导引规律相比较 ,表明了该规律的最优性     

耐久性及其在装备研制中的应用

机械产品在武器装备中占有较大的比例,机械产品的故障,有很多是由于疲劳、磨损、腐蚀、老化等渐变性的耗损过程造成的,寿命是机械产品可靠性中的重要问题。耐久性的提出为解决机械产品与寿命有关的问题提供了方法和工具。通过探讨耐久性的定义、极限状态、耐久性参数、耐久性分配与预计等有关耐久性的基本问题,给出了耐久性分配与预计的工程实例。     

A specially structured nonlinear integer resource allocation problem

We present an algorithm for solving a specially structured nonlinear integer resource allocation problem. This problem was motivated by a capacity planning study done at a large Health Maintenance Organization in Texas. Specifically, we focus on a class of nonlinear resource allocation problems that involve the minimization of a convex function over one general convex constraint, a set of block diagonal convex constraints, and bounds on the integer variables. The continuous variable problem is also considered. The continuous problem is solved by taking advantage of the structure of the Karush‐Kuhn‐Tucker (KKT) conditions. This method for solving the continuous problem is then incorporated in a branch and bound algorithm to solve the integer problem. Various reoptimization results, multiplier bounding results, and heuristics are used to improve the efficiency of the algorithms. We show how the algorithms can be extended to obtain a globally optimal solution to the nonconvex version of the problem. We further show that the methods can be applied to problems in production planning and financial optimization. Extensive computational testing of the algorithms is reported for a variety of applications on continuous problems with up to 1,000,000 variables and integer problems with up to 1000 variables. © 2003 Wiley Periodicals, Inc. Naval Research Logistics 50: 770–792, 2003.     

Discrete search allocation game with false contacts

This paper deals with a two‐person zero‐sum game called a search allocation game, where a searcher and a target participate, taking account of false contacts. The searcher distributes his search effort in a search space in order to detect the target. On the other hand, the target moves to avoid the searcher. As a payoff of the game, we take the cumulative amount of search effort weighted by the target distribution, which can be derived as an approximation of the detection probability of the target. The searcher's strategy is a plan of distributing search effort and the target's is a movement represented by a path or transition probability across the search space. In the search, there are false contacts caused by environmental noises, signal processing noises, or real objects resembling true targets. If they happen, the searcher must take some time for their investigation, which interrupts the search for a while. There have been few researches dealing with search games with false contacts. In this paper, we formulate the game into a mathematical programming problem to obtain its equilibrium point. © 2006 Wiley Periodicals, Inc. Naval Research Logistics, 2007     

Some probability functions in reliability and their applications

There has been much research on the general failure model recently. In the general failure model, when the unit fails at its age t, Type I failure (minor failure) occurs with probability 1 ? p(t) and Type II failure (catastrophic failure) occurs with probability p(t). In the previous research, some specific shapes (constant, non‐decreasing, or bathtub‐shape) on the probability function p(t) are assumed. In this article, general results on some probability functions are obtained and applied to study the shapes of p(t). The results are also applied to determining the optimal inspection and allocation policies in maintenance problems. © 2006 Wiley Periodicals, Inc. Naval Research Logistics, 2007