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

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

Dynamic pricing and inventory control with learning

Optimal operating policies and corresponding managerial insight are developed for the decision problem of coordinating supply and demand when (i) both supply and demand can be influenced by the decision maker and (ii) learning is pursued. In particular, we determine optimal stocking and pricing policies over time when a given market parameter of the demand process, though fixed, initially is unknown. Because of the initially unknown market parameter, the decision maker begins the problem horizon with a subjective probability distribution associated with demand. Learning occurs as the firm monitors the market's response to its decisions and then updates its characterization of the demand function. Of primary interest is the effect of censored data since a firm's observations often are restricted to sales. We find that the first‐period optimal selling price increases with the length of the problem horizon. However, for a given problem horizon, prices can rise or fall over time, depending on how the scale parameter influences demand. Further results include the characterization of the optimal stocking quantity decision and a computationally viable algorithm. © 2002 Wiley Periodicals, Inc. Naval Research Logistics 49: 303–325, 2002; Published online in Wiley InterScience (www.interscience.wiley.com). DOI 10.1002/nav.10013     

Inventory control under substitutable demand: A stochastic game application

Substitutable product inventory problem is analyzed using the concepts of stochastic game theory. It is assumed that there are two substitutable products that are sold by different retailers and the demand for each product is random. Game theoretic nature of this problem is the result of substitution between products. Since retailers compete for the substitutable demand, ordering decision of each retailer depends on the ordering decision of the other retailer. Under the discounted payoff criterion, this problem is formulated as a two‐person nonzero‐sum stochastic game. In the case of linear ordering cost, it is shown that there exists a Nash equilibrium characterized by a pair of stationary base stock strategies for the infinite horizon problem. This is the unique Nash equilibrium within the class of stationary base stock strategies. © 2002 Wiley Periodicals, Inc. Naval Research Logistics 49: 359–375, 2002; Published online in Wiley InterScience (www.interscience.wiley.com). DOI 10.1002/nav.10018     

信息发现元数据标准草案设计与研究

文中给出了标准元数据标准的整体框架,进行了信息元数据标准草案的设计,确定了发现元数据标准草案中核心元素,并采用UML对元数据元素进行了定义,对核心元素和修饰词的关系进行了描述。以RDF为描述语言实现了信息发现元数据的形式化描述。信息发现元数据的建设,将为数据工程建设提供基础支撑,为信息共享提供了新的途径。     

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

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

考虑刚度影响的双输入转矩分流式齿轮系统均载特性

为了对转矩分流齿轮系统均载特性进行更加深入的研究,建立系统非线性动力学模型,采用数值仿真方法计算系统的均载系数,分析联动轴扭转刚度、输出轴支撑刚度、输入转速以及轴位角对均载系数的影响规律,并对齿轮系统进行实验研究.研究结果表明:输出端的均载系数大于输入端的均载系数,高压输入端的均载系数大于低压输入端的均载系数;均载系数...     

Contractual agreements for coordination and vendor‐managed delivery under explicit transportation considerations

We consider the coordination problem between a vendor and a buyer operating under generalized replenishment costs that include fixed costs as well as stepwise freight costs. We study the stochastic demand, single‐period setting where the buyer must decide on the order quantity to satisfy random demand for a single item with a short product life cycle. The full order for the cycle is placed before the cycle begins and no additional orders are accepted by the vendor. Due to the nonrecurring nature of the problem, the vendor's replenishment quantity is determined by the buyer's order quantity. Consequently, by using an appropriate pricing schedule to influence the buyer's ordering behavior, there is an opportunity for the vendor to achieve substantial savings from transportation expenses, which are represented in the generalized replenishment cost function. For the problem of interest, we prove that the vendor's expected profit is not increasing in buyer's order quantity. Therefore, unlike the earlier work in the area, it is not necessarily profitable for the vendor to encourage larger order quantities. Using this nontraditional result, we demonstrate that the concept of economies of scale may or may not work by identifying the cases where the vendor can increase his/her profits either by increasing or decreasing the buyer's order quantity. We prove useful properties of the expected profit functions in the centralized and decentralized models of the problem, and we utilize these properties to develop alternative incentive schemes for win–win solutions. Our analysis allows us to quantify the value of coordination and, hence, to identify additional opportunities for the vendor to improve his/her profits by potentially turning a nonprofitable transaction into a profitable one through the use of an appropriate tariff schedule or a vendor‐managed delivery contract. We demonstrate that financial gain associated with these opportunities is truly tangible under a vendor‐managed delivery arrangement that potentially improves the centralized solution. Although we take the viewpoint of supply chain coordination and our goal is to provide insights about the effect of transportation considerations on the channel coordination objective and contractual agreements, the paper also contributes to the literature by analyzing and developing efficient approaches for solving the centralized problem with stepwise freight costs in the single‐period setting. © 2006 Wiley Periodicals, Inc. Naval Research Logistics, 2006     

Approximate dynamic programming methods for an inventory allocation problem under uncertainty

We propose two approximate dynamic programming methods to optimize the distribution operations of a company manufacturing a certain product at multiple production plants and shipping it to different customer locations for sale. We begin by formulating the problem as a dynamic program. Our first approximate dynamic programming method uses a linear approximation of the value function and computes the parameters of this approximation by using the linear programming representation of the dynamic program. Our second method relaxes the constraints that link the decisions for different production plants. Consequently, the dynamic program decomposes by the production plants. Computational experiments show that the proposed methods are computationally attractive, and in particular, the second method performs significantly better than standard benchmarks. © 2006 Wiley Periodicals, Inc. Naval Research Logistics, 2006     

Optimal pricing and inventory control policy in periodic‐review systems with fixed ordering cost and lost sales

This paper studies a periodic‐review pricing and inventory control problem for a retailer, which faces stochastic price‐sensitive demand, under quite general modeling assumptions. Any unsatisfied demand is lost, and any leftover inventory at the end of the finite selling horizon has a salvage value. The cost component for the retailer includes holding, shortage, and both variable and fixed ordering costs. The retailer's objective is to maximize its discounted expected profit over the selling horizon by dynamically deciding on the optimal pricing and replenishment policy for each period. We show that, under a mild assumption on the additive demand function, at the beginning of each period an (s,S) policy is optimal for replenishment, and the value of the optimal price depends on the inventory level after the replenishment decision has been done. Our numerical study also suggests that for a sufficiently long selling horizon, the optimal policy is almost stationary. Furthermore, the fixed ordering cost (K) plays a significant role in our modeling framework. Specifically, any increase in K results in lower s and higher S. On the other hand, the profit impact of dynamically changing the retail price, contrasted with a single fixed price throughout the selling horizon, also increases with K. We demonstrate that using the optimal policy values from a model with backordering of unmet demands as approximations in our model might result in significant profit penalty. © 2005 Wiley Periodicals, Inc. Naval Research Logistics, 2006     

Algorithms for the multi‐item multi‐vehicles dynamic lot sizing problem

We consider a two‐stage supply chain, in which multi‐items are shipped from a manufacturing facility or a central warehouse to a downstream retailer that faces deterministic external demand for each of the items over a finite planning horizon. The items are shipped through identical capacitated vehicles, each incurring a fixed cost per trip. In addition, there exist item‐dependent variable shipping costs and inventory holding costs at the retailer for items stored at the end of the period; these costs are constant over time. The sum of all costs must be minimized while satisfying the external demand without backlogging. In this paper we develop a search algorithm to solve the problem optimally. Our search algorithm, although exponential in the worst case, is very efficient empirically due to new properties of the optimal solution that we found, which allow us to restrict the number of solutions examined. Second, we perform a computational study that compares the empirical running time of our search methods to other available exact solution methods to the problem. Finally, we characterize the conditions under which each of the solution methods is likely to be faster than the others and suggest efficient heuristic solutions that we recommend using when the problem is large in all dimensions. © 2005 Wiley Periodicals, Inc. Naval Research Logistics, 2006.