Distribution free bounds for service constrained (Q,r) inventory systems

A classical and important problem in stochastic inventory theory is to determine the order quantity (Q) and the reorder level (r) to minimize inventory holding and backorder costs subject to a service constraint that the fill rate, i.e., the fraction of demand satisfied by inventory in stock, is at least equal to a desired value. This problem is often hard to solve because the fill rate constraint is not convex in (Q, r) unless additional assumptions are made about the distribution of demand during the lead‐time. As a consequence, there are no known algorithms, other than exhaustive search, that are available for solving this problem in its full generality. Our paper derives the first known bounds to the fill‐rate constrained (Q, r) inventory problem. We derive upper and lower bounds for the optimal values of the order quantity and the reorder level for this problem that are independent of the distribution of demand during the lead time and its variance. We show that the classical economic order quantity is a lower bound on the optimal ordering quantity. We present an efficient solution procedure that exploits these bounds and has a guaranteed bound on the error. When the Lagrangian of the fill rate constraint is convex or when the fill rate constraint does not exist, our bounds can be used to enhance the efficiency of existing algorithms. © 2000 John Wiley & Sons, Inc. Naval Research Logistics 47: 635–656, 2000     

Exact analysis of (R,s, S) inventory control systems with lost sales and zero lead time

We study an (R, s, S) inventory control policy with stochastic demand, lost sales, zero lead‐time and a target service level to be satisfied. The system is modeled as a discrete time Markov chain for which we present a novel approach to derive exact closed‐form solutions for the limiting distribution of the on‐hand inventory level at the end of a review period, given the reorder level (s) and order‐up‐to level (S). We then establish a relationship between the limiting distributions for adjacent values of the reorder point that is used in an efficient recursive algorithm to determine the optimal parameter values of the (R, s, S) replenishment policy. The algorithm is easy to implement and entails less effort than solving the steady‐state equations for the corresponding Markov model. Point‐of‐use hospital inventory systems share the essential characteristics of the inventory system we model, and a case study using real data from such a system shows that with our approach, optimal policies with significant savings in inventory management effort are easily obtained for a large family of items.     

共享经济视域下的军事训练场地整合

军改以来,"军委管总、战区主战、军种主建"的格局打破了原有军事训练场地的建设、管理和使用模式,训练场地需求旺盛,缺口较大,急需构建适应新体制新机制的新型训练场地建设管理体系,满足训练需求。本文分析了当前军事训练场地建设管理中存在的问题,提出了基于共享经济模式整合军事训练场地资源的对策措施。     

基于纠缠交换的量子安全通信协议

基于纠缠交换和Einstein-Podolsky-Rosen纠缠对,提出一种量子安全直接通信协议和一种多方量子秘密共享协议。量子安全直接通信协议利用光子分组传输方法,与现有协议不同的是通信方可以直接将秘密消息编码为四个Bell态之一,从而不需要在保证量子信道的安全之后再对秘密消息编码。在多方量子秘密共享协议中,通信方以一定的概率选择检测模式和编码模式。协议的实现只需要Einstein-Podolsky-Rosen对而不需要制备多粒子纠缠态。与已有的协议相比较,该协议不需要局域幺正操作,协议的效率得到了显著提高。两个协议的安全性均等同于BBM92协议的安全性。     

基于区块链的地学大数据管理

随着地理观测技术、计算机网络和地理信息系统、社会调查统计的迅速发展,具有空间位置的自然环境数据正在急剧增长,上升到大数据级别。而传统的数据库已经无法满足现有地学大数据的规模和增长速度。在资源访问方面,人们更加担心数据安全与隐私保护问题。由于数据交易的双方和交易中介都是互不信任的,这显然不利于数据的共享与流通,将阻碍地学大数据产业的发展。常用地学数据管理系统主要由单一机构进行维护管理,在多方用户参与的情形下,由于无法信任数据库中的数据,每一方用户都需要一个专用数据库,这样不同数据库之间数据的差异将产生繁琐的争议。区块链的到来却给这一问题的解决带来了希望,区块链技术实现了不完全可信网络环境中的可信数据管理,具有去中心化、防篡改、不可抵赖、完整性等特性,从而为解决目前依靠中心或第三方机构存在的高成本低效率和信息安全问题提供了切实的方法。本文从区块链的共识机制、智能合约、身份验证、数据溯源等方面进行阐述,并重点分析区块链如何解决流通和共享数据的问题,让地学大数据真正得以广泛应用。     

Decomposing inventory routing problems with approximate value functions

We present a time decomposition for inventory routing problems. The methodology is based on valuing inventory with a concave piecewise linear function and then combining solutions to single‐period subproblems using dynamic programming techniques. Computational experiments show that the resulting value function accurately captures the inventory's value, and solving the multiperiod problem as a sequence of single‐period subproblems drastically decreases computational time without sacrificing solution quality. © 2010 Wiley Periodicals, Inc. Naval Research Logistics, 2010     

Stability of information‐sharing alliances in a three‐level supply chain

In their recent article, Leng and Parlar (L&P) (2009) analyze information‐sharing alliances in a three‐level supply chain (consisting of a manufacturer, a distributor, and a retailer) that faces a nonstationary end demand. Supply chain members can share demand information, which reduces information distortion and thus decreases their inventory holding and shortage costs. We expand the results from L&P by considering dynamic (farsighted) stability concepts. We use two different allocation rules and show that under some reasonable assumptions there should always be some information sharing in this supply chain. We also identify conditions under which the retailer in a stable outcome shares his demand information with the distributor, with the manufacturer, or with both remaining supply chain members. © 2010 Wiley Periodicals, Inc. Naval Research Logistics, 2010     

库存控制条件下弹药供应链稳定性研究

由于弹药供应链系统中存在牛鞭效应问题,为了减少牛鞭效应对弹药供应系统的影响,研究系统的稳定性,建立了一阶弹药供应链系统。分析了弹药供应链系统的构成,对系统进行了数学建模分析与仿真验证分析。分析得出,决策参数调整系数β对弹药供应链系统稳定性的影响明显,部队需求量变化及订货量决策参数安全系数α影响较弱。并得出系统稳定时或系统出现震荡、混沌现象时调整系数β的取值范围。     

Inventory policies for a make‐to‐order system with a perishable component and fixed ordering cost

We consider a make‐to‐order production system where two major components, one nonperishable (referred to as part 1) and one perishable (part 2), are needed to fulfill a customer order. In each period, replenishment decisions for both parts need to be made jointly before demand is realized and a fixed ordering cost is incurred for the nonperishable part. We show that a simple (s_n,S,S) policy is optimal. Under this policy, S along with the number of backorders at the beginning of a period if any and the availability of the nonperishable part (part 1) determines the optimal order quantity of the perishable part (part 2), while (s_n,S) guide when and how much of part 1 to order at each state. Numerical study demonstrates that the benefits of using the joint replenishment policy can be substantial, especially when the unit costs are high and/or the profit margin is low. © 2009 Wiley Periodicals, Inc. Naval Research Logistics, 2009     

联邦滤波器在INS/GPS/DVS组合导航系统中的新应用

针对某机载导航系统不能满足高精度导航定位需要的问题,采用了动态信息分配系数方法,提出了一种新的基于联邦滤波器的INS/GPS/DVS组合导航方案,通过对各子滤波器的信息分配系数进行优化,增强了组合系统的导航性能.仿真结果表明,该方案充分提取了导航传感器的信息,有效地提高了组合导航系统的精度和故障检测能力.