指标融合和隐马尔可夫模型的舰船装备技术状态评估

科学合理的技术状态评估技术是保障舰船安全性和任务完好性的有效途径之一,针对目前舰船装备技术状态评估缺乏动态性以及评估指标过多的问题,构建舰船装备技术状态多指标融合模型,结合技术状态评估指标融合模型和隐马尔可夫模型所具有双随机性和严谨数学推理能力的特点,建立基于指标融合模型和隐马尔可夫模型的舰船装备技术状态动态评估模型。最后通过案例分析验证了所提出的方法能够有效体现技术状态评估中的动态性,为舰船装备技术状态评估提供新的途径。     

战斗机突防效能模型研究

对战斗机作为突防机突防防守方远程拦截机、高射导弹、高炮阵地问题进行了研究.突防机突防远程拦截机运用齐次马尔科夫链模型,高射导弹防空区和高炮防空区均属于高射武器防空区,将两者作为一个统一的整体进行研究,根据突防飞机数的多少分两种情况分别进行了研究.仿真结果证明了所选用模型的正确性和所采用方法的实用性和有效性.     

Free riding in a multi‐channel supply chain

Free riding in a multichannel supply chain occurs when one retail channel engages in the customer service activities necessary to sell a product, while another channel benefits from those activities by making the final sale. Although free riding is, in general, considered to have a negative impact on supply chain performance, certain recent industry practices suggest an opposite view: a manufacturer may purposely induce free riding by setting up a high‐cost, customer service‐oriented direct store to allow consumers to experience the product, anticipating their purchase at a retail store. This article examines how the free riding phenomenon affects a manufacturer's supply chain structure decision when there are fixed plus incremental variable costs for operating the direct store. We consider factors such as the effort required to find and buy the product at a retail store after visiting the direct store, the existence of competing products in the market, and the extent of consumer need to obtain direct‐store service. © 2009 Wiley Periodicals, Inc. Naval Research Logistics, 2009     

多核异构冗余模型设计与可靠性分析

为进行电磁仿生研究,提高复杂电磁环境下控制系统运行的可靠性,在一种新型计算机系统结构框架的基础上,提出了多核异构冗余模型,设计了互关总线协议,实现了相应的容错策略,进而进行了异构双机冗余系统的实验,并利用马尔可夫过程模型分析了系统的电磁抗扰能力。实验表明,该模型能够有效地提高系统可靠性,满足相关仿生研究的设计要求。     

On the reduction of total‐cost and average‐cost MDPs to discounted MDPs

This article provides conditions under which total‐cost and average‐cost Markov decision processes (MDPs) can be reduced to discounted ones. Results are given for transient total‐cost MDPs with transition rates whose values may be greater than one, as well as for average‐cost MDPs with transition probabilities satisfying the condition that there is a state such that the expected time to reach it is uniformly bounded for all initial states and stationary policies. In particular, these reductions imply sufficient conditions for the validity of optimality equations and the existence of stationary optimal policies for MDPs with undiscounted total cost and average‐cost criteria. When the state and action sets are finite, these reductions lead to linear programming formulations and complexity estimates for MDPs under the aforementioned criteria.© 2017 Wiley Periodicals, Inc. Naval Research Logistics 66:38–56, 2019     

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.     

Maintaining systems with heterogeneous spare parts

We consider the problem of optimally maintaining a stochastically degrading, single‐unit system using heterogeneous spares of varying quality. The system's failures are unannounced; therefore, it is inspected periodically to determine its status (functioning or failed). The system continues in operation until it is either preventively or correctively maintained. The available maintenance options include perfect repair, which restores the system to an as‐good‐as‐new condition, and replacement with a randomly selected unit from the supply of heterogeneous spares. The objective is to minimize the total expected discounted maintenance costs over an infinite time horizon. We formulate the problem using a mixed observability Markov decision process (MOMDP) model in which the system's age is observable but its quality must be inferred. We show, under suitable conditions, the monotonicity of the optimal value function in the belief about the system quality and establish conditions under which finite preventive maintenance thresholds exist. A detailed computational study reveals that the optimal policy encourages exploration when the system's quality is uncertain; the policy is more exploitive when the quality is highly certain. The study also demonstrates that substantial cost savings are achieved by utilizing our MOMDP‐based method as compared to more naïve methods of accounting for heterogeneous spares.     

Technical note: A computationally efficient algorithm for undiscounted Markov decision processes with restricted observations

We present a computationally efficient procedure to determine control policies for an infinite horizon Markov Decision process with restricted observations. The optimal policy for the system with restricted observations is a function of the observation process and not the unobservable states of the system. Thus, the policy is stationary with respect to the partitioned state space. The algorithm we propose addresses the undiscounted average cost case. The algorithm combines a local search with a modified version of Howard's (Dynamic programming and Markov processes, MIT Press, Cambridge, MA, 1960) policy iteration method. We demonstrate empirically that the algorithm finds the optimal deterministic policy for over 96% of the problem instances generated. For large scale problem instances, we demonstrate that the average cost associated with the local optimal policy is lower than the average cost associated with an integer rounded policy produced by the algorithm of Serin and Kulkarni Math Methods Oper Res 61 (2005) 311–328. © 2008 Wiley Periodicals, Inc. Naval Research Logistics 2009     

Design and control of agile automated CONWIP production lines

In this article, we study the design and control of manufacturing cells with a mix of manual and automated equipment, operating under a CONWIP pull protocol, and staffed by a single agile (cross‐trained) worker. For a three‐station line with one automated station, we fully characterize the structure of the optimal control policy for the worker and show that it is a static priority policy. Using analytical models and extensive simulation experiments, we also evaluate the effectiveness of practical heuristic control policies and provide managerial insights on automation configuration design of the line. This characterization of the worker control policy enables us to develop managerial insights into the design issues of how best to locate and concentrate automation in the line. Finally, we show that, in addition to ease of control and greater design flexibility, the CONWIP protocol also offers higher efficiency and robustness than does the push protocol. © 2008 Wiley Periodicals, Inc. Naval Research Logistics 2009     

基于马尔可夫更新过程的装甲装备使用可用度模型

针对在装甲装备使用可用度评估中,采用统计评估法存在统计周期长和不能用于研制阶段的缺点,利用马尔可夫更新过程,建立了考虑工作时间、修复性维修时间、延误时间和预防性维修时间的装甲装备的稳态可用度模型,并进行了示例应用。该模型可以在装备研制阶段,根据装备各项时间参数的分布,来估计装甲装备的使用可用度,可为装备设计、装备维修间隔期规划等提供理论和方法指导。