虚拟维修仿真数据编辑系统研究

为有效解决虚拟维修系统中仿真数据编辑技术不通用的问题,在深入研究虚拟维修数据模型、交互任务分析、仿真数据管理等关键技术的基础上,设计开发了具有工程应用价值的虚拟维修仿真数据编辑系统.在分析系统设计需求的基础上,设计了系统总体结构,基于S1000D设计了虚拟维修数据模型,基于UML分析了维修样机编辑和维修规程编辑过程中的交互任务,基于XML实现了仿真数据的编辑、存储与发布.该系统应用于某型复杂装备虚拟维修,验证了系统的各项功能和应用效果.     

战时装备保障阵地选址不确定决策方法

针对战时选址属性信息为区间数的情形,提出了一种基于模糊偏序关系的装备保障阵地选址决策方法.首先,建立战时装备保障点选址的评估值模型,并对其进行预处理;然后建立了模糊偏序关系模型,将混合型评估值模型转化为评估关系模型,得到各备选点之间的偏序关系;最后,对偏序关系进行集结,得到全序关系,从而获取方案的优劣排序.这为战时装备保障阵地选址提供了一种新的有效途径.     

美军“爱国者”导弹武器系统维修保障研究

美国及其他军事强国都将导弹武器系统维修保障作为每年国防投入的重点内容之一,维修保障也已成为国外军工企业拓展军品产业链、保障企业持续获得收入的重要业务之一。“爱国者”导弹武器系统作为美军防空的主战装备,研究维修保障主要做法能够揭示美军导弹武器系统维修保障状况。从“爱国者”导弹武器系统的两级维修体制、陆军延寿计划两大方面分析其维修保障的主要做法及未来发展趋势,对于持续提升我军导弹武器系统维修保障水平具有重要参考价值。     

AHP-Bayes及Bootstrap方法在战损装备维修工作量统计建模中的应用

提出了一种小样本条件下数据分析和分布规律统计的AHP-Bayes及Bootstrap方法,并以某型火箭炮战损维修工作量分布规律统计为实例进行了应用。该方法为准确预计战时装备维修保障需求,科学制定战时装备维修保障方案提供了定量分析支撑。     

基于最大保障时间的战时装备维修任务调度模型

战时维修机构承担的维修任务比较繁重,合理、科学地安排维修任务可以有效地提高作战部队的战斗力.对此,分析了战时维修任务调度的特点,建立了基于最大保障时间的维修任务静态、动态调度模型,并提出了相应的模型求解方法.利用本方法在满足作战单元最大保障时间前提下,可使得装备维修效益最大,并可以实现实时动态维修任务调度,有效地解决了一种战时维修任务调度问题.     

Bayesian enhanced decision making for deteriorating repairable systems with preventive maintenance

Since a system and its components usually deteriorate with age, preventive maintenance (PM) is often performed to restore or keep the function of a system in a good state. Furthermore, PM is capable of improving the health condition of the system and thus prolongs its effective age. There has been a vast amount of research to find optimal PM policies for deteriorating repairable systems. However, such decisions involve numerous uncertainties and the analyses are typically difficult to perform because of the scarcity of data. It is therefore important to make use of all information in an efficient way. In this article, a Bayesian decision model is developed to determine the optimal number of PM actions for systems which are maintained according to a periodic PM policy. A non‐homogeneous Poisson process with a power law failure intensity is used to describe the deteriorating behavior of the repairable system. It is assumed that the status of the system after a PM is somewhere between as good as new for a perfect repair and as good as old for a minimal repair, and for failures between two preventive maintenances, the system undergoes minimal repairs. Finally, a numerical example is given and the results of the proposed approach are discussed after performing sensitivity analysis. © 2007 Wiley Periodicals, Inc. Naval Research Logistics, 2008     

美军联合作战战场电磁频谱管理研究

针对当前战场电磁频谱管理热点问题,详细论述了在复杂电磁环境下美军联合作战各级指挥机构中频谱管理机构的职责、频谱管理方法,以及频谱管理方案的制定程序、内容等问题,并归纳总结了美军进行战场电磁频谱管理的经验,为未来联合作战中的战场电磁频谱相关问题提供积极的参考。     

C2组织指挥控制关系的形式化描述*

针对C2组织的指挥控制关系目前还缺少很好地形式化描述方法,其量化研究比较困难,从C2组织的实体及实体之间的关系出发,形式化描述C2组织指挥(纵向)关系、横向关系、资源配置关系、执行关系等四种关系,最终构建出一个指挥控制关系网,为运用复杂网络理论以及图论等方法对指挥控制关系的量化分析研究提供基础。     

基于随机网络的平均维修保障服务时间分析

利用随机网络建模方法在随机工程项目分析中的优越性,建立了不同保障方式下的维修保障过程模型。重点对网络活动中的维修等待时间和维修等待概率进行了分析,利用随机网络的解析算法,确定了维修力量的平均维修保障服务时间分析模型。最后将该方法应用于伴随修理过程,对其平均维修保障服务时间进行了案例分析。     

Multi‐period maintenance scheduling of tree networks with minimum flow disruption

We introduce a multi‐period tree network maintenance scheduling model and investigate the effect of maintenance capacity restrictions on traffic/information flow interruptions. Network maintenance refers to activities that are performed to keep a network operational. For linear networks with uniform flow between every pair of nodes, we devise a polynomial‐time combinatorial algorithm that minimizes flow disruption. The spiral structure of the optimal maintenance schedule sheds insights into general network maintenance scheduling. The maintenance problem on linear networks with a general flow structure is strongly NP‐hard. We formulate this problem as a linear integer program, derive strong valid inequalities, and conduct a polyhedral study of the formulation. Polyhedral analysis shows that the relaxation of our linear network formulation is tight when capacities and flows are uniform. The linear network formulation is then extended to an integer program for solving the tree network maintenance scheduling problem. Preliminary computations indicate that the strengthened formulations can solve reasonably sized problems on tree networks and that the intuitions gained from the uniform flow case continue to hold in general settings. Finally, we extend the approach to directed networks and to maintenance of network nodes. © 2011 Wiley Periodicals, Inc. Naval Research Logistics, 2011