A branch and bound algorithm for computing optimal replacement policies in consecutive k‐out‐of‐n‐systems

This paper presents a branch and bound algorithm for computing optimal replacement policies in a discrete‐time, infinite‐horizon, dynamic programming model of a binary coherent system with n statistically independent components, and then specializes the algorithm to consecutive k‐out‐of‐n systems. The objective is to minimize the long‐run expected average undiscounted cost per period. (Costs arise when the system fails and when failed components are replaced.) An earlier paper established the optimality of following a critical component policy (CCP), i.e., a policy specified by a critical component set and the rule: Replace a component if and only if it is failed and in the critical component set. Computing an optimal CCP is a optimization problem with n binary variables and a nonlinear objective function. Our branch and bound algorithm for solving this problem has memory storage requirement O(n) for consecutive k‐out‐of‐n systems. Extensive computational experiments on such systems involving over 350,000 test problems with n ranging from 10 to 150 find this algorithm to be effective when n ≤ 40 or k is near n. © 2002 Wiley Periodicals, Inc. Naval Research Logistics 49: 288–302, 2002; Published online in Wiley InterScience (www.interscience.wiley.com). DOI 10.1002/nav.10017     

纤维对混凝土早期热膨胀系数的影响

在混凝土中分别掺加相同质量的碳纤维和聚酯纤维,采用平板加热器对不同类型的混凝土试件循环加热,测试了其浇筑后5～29 d的温度变形情况,计算了其热膨胀系数。龄期达到29 d,聚酯纤维混凝土热膨胀系数下降约8%,碳纤维混凝土热膨胀系数下降约20%。结果表明,纤维的掺入能有效降低混凝土的早期热膨胀系数;纤维质量相同时,弹性模量高的碳纤维较弹性模量低的聚酯纤维能更显著地降低混凝土的早期热膨胀系数。     

工龄更换策略下的备件库存决策研究

针对单部件系统工龄更换策略下备件需求的特点,建立了工龄更换策略与备件库存控制的联合优化模型。该模型通过分析一个订购期内工龄更换间隔期T及备件最大库存水平S对系统寿命分布的影响,建立了工龄更换间隔期、订购间隔期及最大库存水平与单位时间总费用（包括维修费用和库存费用）的关系,然后以单位时间总费用最小为目标,优化工龄更换间隔期T、订购间隔期t0及最大库存水平S。最后,基于案例,运用Matlab对模型进行数值计算,结果表明模型能有效地降低单位时间的总费用。     

面向信息化战争模拟的体系对抗交互模型研究

从研究信息化战争模拟体系对抗交互模型的有关问题入手,界定了体系对抗交互概念,分析了体系对抗交互的复杂性特征及体系对抗交互作用的主要途径.在探讨体系对抗交互仿真建模内容以及与之相适应的新型建模方法的基础上,对体系对抗总体交互建模、实体交互建模、交互效果建模等问题进行了研究,并给出了有关交互模型的实例.     

Bayesian inference based on partial monitoring of components with applications to preventive system maintenance

Consider a binary, monotone system of n components. The assessment of the parameter vector, θ, of the joint distribution of the lifetimes of the components and hence of the reliability of the system is often difficult due to scarcity of data. It is therefore important to make use of all information in an efficient way. For instance, prior knowledge is often of importance and can indeed conveniently be incorporated by the Bayesian approach. It may also be important to continuously extract information from a system currently in operation. This may be useful both for decisions concerning the system in operation as well as for decisions improving the components or changing the design of similar new systems. As in Meilijson [12], life‐monitoring of some components and conditional life‐monitoring of some others is considered. In addition to data arising from this monitoring scheme, so‐called autopsy data are observed, if not censored. The probabilistic structure underlying this kind of data is described, and basic likelihood formulae are arrived at. A thorough discussion of an important aspect of this probabilistic structure, the inspection strategy, is given. Based on a version of this strategy a procedure for preventive system maintenance is developed and a detailed application to a network system presented. All the way a Bayesian approach to estimation of θ is applied. For the special case where components are conditionally independent given θ with exponentially distributed lifetimes it is shown that the weighted sum of products of generalized gamma distributions, as introduced in Gåsemyr and Natvig [7], is the conjugate prior for θ. © 2001 John Wiley & Sons, Inc. Naval Research Logistics 48: 551–577, 2001.     

一种双参数批更换系统的优化问题

研究了一种在更换时间有限的情况下 ,基于交替更新过程的双参数批更换系统的优化问题 ,这一问题的目标是平均费用率的极小化。给出了一种特殊情况的讨论结果。     

油罐惰化置换时间的数学计算与模拟实验

基于对油罐惰化置换过程的假设和简化,得到惰化置换时间的计算公式,然后通过对计算公式的修正,完成了对油罐惰化置换时间的计算。最后通过对3次不同流量条件下模拟实验数据的非线性拟合,分别计算出3次实验气体扩散系数的取值,得到O2体积分数与置换时间之间的完整表达式。数学计算和实验的方法与结论将为进一步研究油罐油气的惰化置换规律提供有价值的参考。     

Asymptotic properties of imperfect repair models and estimation of repair efficiency

The aim of this articles is to study the asymptotic behavior of two imperfect repair models, called Arithmetic Reduction of Intensity and Arithmetic Reduction of Age models. These models have been proposed by Doyen and Gaudoin (Reliab Eng Syst Safe 84 (2004) 45–56) and include many usual virtual age models. First, it is proved that the failure intensity of these models is asymptotically almost surely equivalent to a deterministic increasing function with a cumulative error proportional to a logarithm. Second, the almost sure convergence and asymptotic normality of several estimators of repair efficiency are derived, when the wear‐out process without repair is known. Finally, the coverage rate of the asymptotic confidence intervals issued from those estimators is empirically studied. © 2010 Wiley Periodicals, Inc. Naval Research Logistics, 2010     

A bivariate optimal replacement policy for a cold standby repairable system with repair priority

In this article, an optimal replacement policy for a cold standby repairable system consisting of two dissimilar components with repair priority is studied. Assume that both Components 1 and 2, after repair, are not as good as new, and the main component (Component 1) has repair priority. Both the sequence of working times and that of the components'repair times are generated by geometric processes. We consider a bivariate replacement policy (T,N) in which the system is replaced when either cumulative working time of Component 1 reaches T, or the number of failures of Component 1 reaches N, whichever occurs first. The problem is to determine the optimal replacement policy (T,N)* such that the long run average loss per unit time (or simply the average loss rate) of the system is minimized. An explicit expression of this rate is derived, and then optimal policy (T,N)* can be numerically determined through a two‐dimensional‐search procedure. A numerical example is given to illustrate the model's applicability and procedure, and to illustrate some properties of the optimal solution. We also show that if replacements are made solely on the basis of the number of failures N, or solely on the basis of the cumulative working time T, the former class of policies performs better than the latter, albeit only under some mild conditions. © 2010 Wiley Periodicals, Inc. Naval Research Logistics, 2010     

求解武器目标分配问题的改进粒子群算法

在建立多种类型武器目标分配模型的基础上,提出了一种求解该模型的改进粒子群算法。首先,定义粒子聚焦距离变化率,使惯性权重依据聚焦距离变化率自适应调整;其次,采用速度最大值线性递减的策略平衡算法收敛精度与全局寻优能力之间的矛盾;最后,粒子替换策略使算法改善了因自适应惯性权重的引入而造成收敛速度变慢的问题。仿真结果表明,提出模型和算法合理有效,算法收敛快,适合求解各种种群规模的武器目标分配问题。