...
首页> 外文期刊>Reliability Engineering & System Safety >Selective maintenance strategy for systems executing multiple consecutive missions with uncertainty
【24h】

Selective maintenance strategy for systems executing multiple consecutive missions with uncertainty

机译:不确定地执行多个连续任务的系统的选择性维护策略

获取原文
获取原文并翻译 | 示例
   

获取外文期刊封面封底 >>

       

摘要

Selective maintenance is extensively implemented in industrial and military environments. With it, a subset of feasible maintenance actions may be strategically selected for a repairable system to achieve maximum success in subsequent missions with limited maintenance resources. In this study, a new selective maintenance model for systems that execute multiple consecutive missions is developed. In each break, multiple optional maintenance actions, from perfect replacements down to imperfect and minimal repairs, can be chosen for each component. Because of the uncertainties associated with the operation time of each component and the durations of future missions, the effective age of each component at the beginning of the next mission is also uncertain, posing a new challenge in terms of evaluating the success of subsequent missions. Such uncertainties are quantified by evaluating the probabilities of a system in successfully completing future missions. The computational burden resulting from the use of multi-dimensional integrals is alleviated with the introduction of the Gaussian quadrature and Riemann sum. Consequently, the selective maintenance problem is formulated as a max-min optimization model. Moreover, the simulated annealing-based genetic algorithm is customized to solve the resulting optimization problem. Two illustrative examples are presented to demonstrate the advantages of the proposed approach.
机译:选择性维护广泛应用于工业和军事环境。有了它,就可以从战略上为可修复系统选择可行的维护措施的子集,以在维护资源有限的情况下实现后续任务的最大成功。在这项研究中,为执行多个连续任务的系统开发了一种新的选择性维护模型。在每个中断中,可以为每个组件选择多种可选的维护措施,从完美更换到不完善和最少的维修。由于每个部分的运作时间和未来任务的持续时间都存在不确定性,因此下一个任务开始时每个部分的有效年龄也是不确定的,这对评估后续任务的成功提出了新的挑战。通过评估系统成功完成未来任务的可能性来量化这种不确定性。通过引入高斯积分和黎曼和,减轻了使用多维积分所产生的计算负担。因此,选择性维护问题被表述为最大-最小优化模型。此外,定制了基于模拟退火的遗传算法来解决由此产生的优化问题。给出两个说明性示例,以证明所提出方法的优点。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号