A fluid queueing model for link travel time moments

We analyze the moments of the random time required for a vehicle to traverse a transportation network link of arbitrary length when its speed is governed by a random environment. The problem is motivated by stochastic transportation network applications in which the estimation of travel time moments is of great importance. We analyze this random time in a transient and asymptotic sense by employing results from the field of fluid queues. The results are demonstrated on two example problems. © 2003 Wiley Periodicals, Inc. Naval Research Logistics, 2004     

面向仿真的C4ISR系统领域分析与需求复用研究

面向C4ISR系统需求开发中的仿真支持问题,将复用作为一种的C4ISR系统需求模型的构建方法,可以快速形成一个有效的领域需求模型支持系统仿真验证。本文研究了C4ISR系统需求的领域性与领域需求共性问题,在此基础上研究了C4ISR系统需求工程中的需求框架、需求本体以及需求组件等不同粒度的复用方法,分别对上述三种方法在领域应用中的不同作用进行了对比分析。     

装备保障需求开发方法

为解决装备保障需求开发规范化的问题,界定了装备保障需求的内涵,分析了装备保障需求开发的目标,提出了＂元任务＂的概念,阐述了＂任务确认-能力集成-能力开发＂的装备保障需求开发方法,并通过实例分析验证了方法的有效性,对于规范装备保障需求描述形式和完善装备保障需求开发机制具有一定的参考价值。     

目标航路捷径波动与雷达误差关系研究

在靶场对武器装备的试验鉴定中,必须进行试验设计,目标和目标航路参数是试验参数设计中重点考虑的内容之一,目标航路捷径的波动则直接影响试验参数设计和考核结论。通过分析武器装备中雷达误差来源,找出目标航路捷径波动与雷达误差之间的函数关系,并计算推导出航路捷径允许波动范围的数学模型;以靶场试验实例给出了航路捷径波动确定的基本原则,为靶场试验设计提供有价值的参考方法。     

Rectangles algorithm for generating normal variates

We propose an algorithm for generating normal random variates that is based on the acceptance–rejection method and uses a piecewise majorizing function. The piecewise function has 2048 equal‐area pieces, 2046 of which are constant, and the two extreme pieces are curves that majorize the tails. The proposed algorithm has not only good performance from correlation induction perspective, but also works well from a speed perspective. It is faster than the inversion method by Odeh and Evans and most other methods. © 2011 Wiley Periodicals, Inc. Naval Research Logistics, 2011     

基于随机脉宽调制技术的感应电机矢量控制系统研究

随机脉宽调制技术可以使逆变器输出电压的谐波成分均匀地分布在一个较宽的频率范围内,达到抑制噪声和机械振动的目的.把随机脉宽调制技术引入感应电机矢量控制系统中,保证了调速系统的高性能,同时也降低了电机的有色噪声和机械振动.     

Production‐inventory systems with imperfect advance demand information and updating

We consider a supplier with finite production capacity and stochastic production times. Customers provide advance demand information (ADI) to the supplier by announcing orders ahead of their due dates. However, this information is not perfect, and customers may request an order be fulfilled prior to or later than the expected due date. Customers update the status of their orders, but the time between consecutive updates is random. We formulate the production‐control problem as a continuous‐time Markov decision process and prove there is an optimal state‐dependent base‐stock policy, where the base‐stock levels depend upon the numbers of orders at various stages of update. In addition, we derive results on the sensitivity of the state‐dependent base‐stock levels to the number of orders in each stage of update. In a numerical study, we examine the benefit of ADI, and find that it is most valuable to the supplier when the time between updates is moderate. We also consider the impact of holding and backorder costs, numbers of updates, and the fraction of customers that provide ADI. In addition, we find that while ADI is always beneficial to the supplier, this may not be the case for the customers who provide the ADI. © 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     

Inventory control in divergent supply chains with time‐based dispatching and shipment consolidation

This article analyses a divergent supply chain consisting of a central warehouse and N nonidentical retailers. The focus is on joint evaluation of inventory replenishment and shipment consolidation effects. A time‐based dispatching and shipment consolidation policy is used at the warehouse in conjunction with real‐time point‐of‐sale data and centralized inventory information. This represents a common situation, for example, in various types of vendor managed inventory systems. The main contribution is the derivation of an exact recursive procedure for determining the expected inventory holding and backorder costs for the system, under the assumption of Poisson demand. Two heuristics for determining near optimal shipment intervals are also presented. The results are applicable both for single‐item and multiitem systems. © 2011 Wiley Periodicals, Inc. Naval Research Logistics 58: 59–71, 2011