基于遗传算法的战时维修保障系统优化研究

分析了战时维修保障系统的结构功能,给出了维修保障系统的解析模型,提出了维修保障系统的可控参数及指标;为了使维修保障系统发挥最佳效能,以最小二乘准则作为系统的优化准则,建立了维修保障系统的优化模型,采用遗传算法对优化模型进行求解,给出了计算方法,并以计算实例验证了方法的可行性。     

On‐line parameter estimation for a partially observable system subject to random failure

In this paper, we study the on‐line parameter estimation problem for a partially observable system subject to deterioration and random failure. The state of the system evolves according to a continuous time homogeneous Markov process with a finite state space. The system state is not observable, except for the failure state. The information related to the system state is available at discrete times through inspections. A recursive maximum likelihood (RML) algorithm is proposed for the on‐line parameter estimation of the model. The RML algorithm proposed in the paper is considerably faster and easier to apply than other RML algorithms in the literature, because it does not require projection into the constraint domain and calculation of the gradient on the surface of the constraint manifolds. The algorithm is illustrated by an example using real vibration data. © 2006 Wiley Periodicals, Inc. Naval Research Logistics, 2006     

CORBA在舰船远程技术保障信息管理系统中的应用

鉴于舰船远程技术保障信息化面临的网络化、异构化的形势,设计基于CORBA和W eb的3层远程技术保障信息管理系统模型,利用CORBA所具有的与平台及语言无关的特点,屏蔽平台间差异,实现异构平台间通信,并结合实例给出它在实际中的应用。     

导弹系统安全性分析中的引发事件鉴别方法

引发事件鉴别是基于事故机理安全性分析的首要任务。鉴别结果是否全面、完整直接影响最终分析结果的有效性。导弹系统安全风险涉及面广、影响因素多,需要系统的可操作方法来指导引发事件的鉴别工作。针对导弹工作特点,提出考虑导弹任务剖面,运用主逻辑图对导弹进行系统性的层次化描述,对引发事件进行整理和归纳。将危险与可操作性分析引入导弹系统安全性分析中进行引发事件鉴别,结合故障模式影响分析,支持对单一故障类和参数异常类引发事件的鉴别。结果表明,所提框架为解决导弹系统安全性分析中引发事件鉴别的系统性完整性提供了可行的思路。     

相控阵天线阵面两级备件优化配置模型

针对相控阵天线阵面备件配置存在的冗余性强、批量送修、多级维修等现实问题,综合考虑备件费用、维修能力以及库存策略之间的关系,建立了基于定期补给的两级备件优化配置模型。给出了系统的故障件维修周转过程和维修备件的定期补给过程,在分析备件、库存、维修能力之间关系的基础上,结合成批到达的排队理论,建立了系统的供应可用度模型。以备件配置费用最小为目标、以系统供应可用度为约束条件,建立了系统的备件优化配置模型,并通过边际效益分析法对模型进行了求解。通过算例仿真与分析对模型进行了验证。结果表明:构建的备件配置能够较好地解决相控阵天线阵面的备件配置问题,具有一定的优越性。     

基于军民融合条件的装备性能维修保障合同执行情况

在军民融合背景下,部分新获得承制资格企业在首批装备制造或维修保障任务中时有违约问题发生。为解决该问题,提出了以基于性能的采办理论为基础的合同违约预测方法研究。以陆军通用武器装备维修保障承制单位为案例,运用SPSS软件进行数据整理和因子分析,构建合同履行预测评价模型。然后利用新入民营企业试生产实验数据在量产前建立费用和可用度模型,通过费效比最优的方式预测各新入企业的首批装备可用度及花费等关键指标,进行综合评估。结论表明该方法能够对装备合同履行情况和违约风险进行预判。     

某型武装直升机武器系统故障诊断研究

战时快速准确地查找故障部件和制定排故方案是实施战场抢修的前提和基础。目前武装直升机武器系统结构组成日趋复杂,功能模块高度集成,仅凭人工经验进行维护难度较大。为了提高故障诊断效率,采用故障树分析与专家经验相结合的方法,建立了某型武装直升机武器系统故障模型,设计了一种快速故障诊断与辅助决策系统,有效减少了维修保障人员故障排除时间,提升了故障处置效率与准确度,具有重要的实际应用价值。     

Transit vessel scheduling

A transit vessel traffic scheduling algorithm has been developed to limit the negative effects on cargo volume throughput in two‐way waterways where separation distances between transiting vessels must be maintained and passage restrictions may hold. It runs in time that is polynomial in the number of ships involved in the computation and finds schedules which increase the utilization of waterways. Three examples illustrate its use. The first example is situated in the Sunda Strait where the algorithm is used to enhance the safety of merchant shipping against a terrorist threat. It illustrates important features of the algorithm and demonstrates how it can be used with cross traffic. The second example is situated in the Strait of Istanbul and offers a comparison between the developed algorithm and the transit vessel scheduling algorithm of Ulusçu et al., J Navig 62 (2009), 59–77. This was done using a plausible model of the Strait of Istanbul. The third and last example shows how the algorithm can be used to schedule transit vessel traffic in two‐way waterways with junctions. This feature is especially useful in congested waters with a high risk of collisions like the Inland Sea of Japan. An extreme test case proves that the developed algorithm is a practical algorithm ready for such use. © 2017 Wiley Periodicals, Inc. Naval Research Logistics 64: 225–248, 2017     

复杂装备军民融合维修保障效益评价研究

针对军民融合维修保障中缺少对合同商效益评价,无法为合同商选择、合同续签等工作提供科学依据的情况,提出基于项目后评价理论的合同商维修保障效益评价理念。在分析了军民融合维修保障项目后评价内容的基础上,以效益评价为例对复杂装备军民融合维修保障效益评价进行分析。建立了合同商保障的费用分析模型和装备可用度模型。最后,通过算例对该方法进行了演示验证。     

Scheduling jobs and maintenance activities on parallel machines

Most machine scheduling models assume that the machines are available all of the time. However, in most realistic situations, machines need to be maintained and hence may become unavailable during certain periods. In this paper, we study the problem of processing a set of n jobs on m parallel machines where each machine must be maintained once during the planning horizon. Our objective is to schedule jobs and maintenance activities so that the total weighted completion time of jobs is minimized. Two cases are studied in this paper. In the first case, there are sufficient resources so that different machines can be maintained simultaneously if necessary. In the second case, only one machine can be maintained at any given time. In this paper, we first show that, even when all jobs have the same weight, both cases of the problem are NP-hard. We then propose branch and bound algorithms based on the column generation approach for solving both cases of the problem. Our algorithms are capable of optimally solving medium sized problems within a reasonable computational time. We note that the general problem where at most j machines, 1 ≤ j ≤ m, can be maintained simultaneously, can be solved similarly by the column generation approach proposed in this paper. © 2000 John Wiley & Sons, Inc. Naval Research Logistics 47: 145–165, 2000