Structured maintenance policies on interior sample paths

We examine the problem of adaptively scheduling perfect observations and preventive replacements for a multi‐state, Markovian deterioration system with silent failures such that total expected discounted cost is minimized. We model this problem as a partially observed Markov decision process and show that the structural properties of the optimal policy hold for certain non‐extreme sample paths. © 2007 Wiley Periodicals, Inc. Naval Research Logistics, 2007     

残差GM（1，1）模型在恒加试验中的应用

介绍了目前恒加试验中,正常应力水平下特征寿命点估计的数据统计分析方法及其不足。针对恒加试验的特点和所需解决的问题,基于灰色预测理论的残差GM(1,1)模型,给出了一种新的求解方法。最后分别运用三种不同的方法对给出的应用实例进行正常应力水平下特征寿命值的求解,证明了本文所给出的方法确实可行。     

基于GERT的武器装备维修备件订货间隔期预测

由于武器装备维修备件的需求是随机波动的,订货间隔期的准确预测就成为了一个难点。针对这样一个随机波动的需求系统,提出了利用GERT随机网络模型对其进行描述,进而求出随机波动需求的订货间隔期的解析表达式,解决了不确定性需求的订货间隔期的预测问题,为武器装备维修备件的科学管理提供数据支持。通过实例验证表明,GERT随机网络模型是解决武器装备维修备件订货间隔期的一种有效手段和方法。     

服役工况下镍基单晶高温合金的损伤机制研究进展

为提高镍基单晶叶片服役寿命、解决发动机和燃气轮机的关键核心技术,近年来国内外持续开展了大量针对镍基单晶高温合金服役情况下损伤与失效机制的研究。从实际服役条件出发,总结了镍基单晶高温合金疲劳、蠕变和热机械疲劳损伤机制等研究成果与进展。此外,针对大量实验造成的时间与成本增加问题,还总结了近年来在镍基单晶高温合金的寿命预测方法方面的研究工作与成果,并提出了目前在镍基单晶高温合金寿命评估与失效分析研究方面所面临的困难和挑战。     

基于GSPN的编队网络化防空指挥流程研究

为了提高编队指挥员在信息化海战中的作战指挥效率和应变能力,利用广义随机Petri网与马尔可夫链的等价关系,得到一种Petri网与马尔可夫链理论相结合的指挥流程时间性能分析的新方法,通过对模型进行分析与求解,得出了舰艇编队网络化防空作战指挥流程活动的准确作战周期,从而为指挥流程的优化提供有力的支撑,对评估系统效能水平也具有重要指导意义。     

水中兵器延寿样本的装载可靠度鉴定试验方案

针对延寿样本子样少,按经典GJB899法对装载可靠度鉴定需要较长的试验时间这一实际情况,提出了一种减少试验时间的Bayes方法.该方法通过挖掘延寿前装载失效率信息,确定先验分布,再开展陆上加速装载试验以增加装载信息,并结合实际装载信息制定了装载可靠度鉴定试验新方案.实例计算表明:在确保鉴定效果的前提下,新方法可在较小的延寿样本条件下快速完成装载可靠度鉴定工作,满足水中兵器延寿工程的实际需要.     

A stochastic approximation algorithm to compute bid prices for joint capacity allocation and overbooking over an airline network

In this article, we develop a stochastic approximation algorithm to find good bid price policies for the joint capacity allocation and overbooking problem over an airline network. Our approach is based on visualizing the total expected profit as a function of the bid prices and searching for a good set of bid prices by using the stochastic gradients of the total expected profit function. We show that the total expected profit function that we use is differentiable with respect to the bid prices and derive a simple expression that can be used to compute its stochastic gradients. We show that the iterates of our stochastic approximation algorithm converge to a stationary point of the total expected profit function with probability 1. Our computational experiments indicate that the bid prices computed by our approach perform significantly better than those computed by standard benchmark strategies and the performance of our approach is relatively insensitive to the frequency with which we recompute the bid prices over the planning horizon. © 2011 Wiley Periodicals, Inc. Naval Research Logistics, 2011     

Signature based analysis of m‐Consecutive‐k‐out‐of‐n: F systems with exchangeable components

In this article, we study reliability properties of m‐consecutive‐k‐out‐of‐n: F systems with exchangeable components. We deduce exact formulae and recurrence relations for the signature of the system. Closed form expressions for the survival function and the lifetime distribution as a mixture of the distribution of order statistics are established as well. These representations facilitate the computation of several reliability characteristics of the system for a given exchangeable joint distribution or survival function. Finally, we provide signature‐based stochastic ordering results for the system's lifetime and investigate the IFR preservation property under the formulation of m‐consecutive‐k‐out‐of‐n: F systems. © 2011 Wiley Periodicals, Inc. Naval Research Logistics, 2011     

Improving series and parallel systems through mixtures of duplicated dependent components

We discuss suitable conditions such that the lifetime of a series or of a parallel system formed by two components having nonindependent lifetimes may be stochastically improved by replacing the lifetimes of each of the components by an independent mixture of the individual components' lifetimes. We also characterize the classes of bivariate distributions where this phenomenon arises through a new weak dependence notion. © 2011 Wiley Periodicals, Inc. Naval Research Logistics, 2011     

Annealing adaptive search,cross‐entropy,and stochastic approximation in global optimization

The Annealing Adaptive Search (AAS) algorithm for global optimization searches the solution space by sampling from a sequence of Boltzmann distributions. For a class of optimization problems, it has been shown that the complexity of AAS increases at most linearly in the problem dimension. However, despite its desirable property, sampling from a Boltzmann distribution at each iteration of the algorithm remains a practical challenge. Prior work to address this issue has focused on embedding Markov chain‐based sampling techniques within the AAS framework. In this article, based on ideas from the recent Cross‐Entropy method and Model Reference Adaptive Search, we propose an algorithm, called Model‐based Annealing Random Search (MARS), that complements prior work by sampling solutions from a sequence of surrogate distributions that iteratively approximate the target Boltzmann distributions. We establish a novel connection between MARS and the well‐known Stochastic Approximation method. By exploiting this connection, we prove the global convergence of MARS and characterize its asymptotic convergence rate behavior. Our empirical results indicate promising performance of the algorithm in comparison with some of the existing methods. © 2011 Wiley Periodicals, Inc. Naval Research Logistics, 2011