首页> 外文期刊>Journal of Quality in Maintenance Engineering >Non-linear threshold algorithm based solution for the redundancy allocation problem considering multiple redundancy strategies
【24h】

Non-linear threshold algorithm based solution for the redundancy allocation problem considering multiple redundancy strategies

机译:基于非线性阈值算法的冗余分配问题考虑多次冗余策略

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

摘要

The purpose of this paper is to introduce an efficient algorithm based on a non-linear accepting threshold to solve the redundancy allocation problem (RAP) considering multiple redundancy strategies. In addition to the components reliability, multiple redundancy strategies are simultaneously considered to vary the reliability of the system. The goal is to determine the optimal selection of elements, redundancy levels and redundancy strategy, which maximizes the system reliability under various system-level constraints. Design/methodology/approach - The mixed RAP considering the use of active and standby components at the subsystem level belongs to the class of NP-hard problems involving selection of elements and redundancy levels, to maximize a specific system performance under a given set of physical and budget constraints. Generally, the authors recourse to meta-heuristic algorithms to solve this type of optimization problem in a reasonable computational time, especially for large-size problems. A non-linear threshold accepting algorithm (NTAA) is developed to solve the tackled optimization problem. Numerical results for test problems from previous research are reported and analyzed to assess the efficiency of the proposed algorithm. Findings — The comparison with the best solutions obtained in previous studies, namely: genetic algorithm, simulated annealing, memetic algorithm and the particle swarm optimization for 33 different instances of the problem, demonstrated the superiority of the proposed algorithm in finding for all considered instances, a high-quality solution in a minimum computational time. Research limitations/implications — Considering multiple redundancy strategies helps to achieve higher reliability levels but increases the complexity of the obtained solution leading to infeasible systems in term of physical design. Technological constraints must be integrated into the model to provide a more comprehensive and realistic approach. Practical implications — Designing high performant systems which meet customer requirements, under different economic and functional constraints is the main challenge faced by the manufacturers. The proposed algorithm aims to provide a superior solution of the reliability optimization problem by considering the possibility to adopt multiple redundancy strategies at the subsystem level in a minimum computational time. Originality/value — A NTAA is expanded to the RAP considering multiple redundancy strategies at the subsystem level subject to weight and cost constraints. A procedure based on a penalized objective function is developed to encourage the algorithm to explore toward the feasible solutions area. By outperforming well-known solving technique, the NTAA provides a powerful tool to reliability designers of complex systems where different varieties of redundancies can be considered to achieve high-reliability systems.
机译:本文的目的是引入基于非线性接受阈值的高效算法,以解决考虑多次冗余策略的冗余分配问题(RAP)。除了组件的可靠性之外,同时认为多个冗余策略是否会改变系统的可靠性。目标是确定元素的最佳选择,冗余级别和冗余策略,可在各种系统级约束下最大化系统可靠性。设计/方法/方法 - 考虑在子系统级别使用主动和备用组件的混合说唱属于涉及选择元素和冗余级别的NP难题类,以最大限度地提高特定的物理性能下的特定系统性能和预算限制。通常,作者求助于元启发式算法,以在合理的计算时间内解决这种类型的优化问题,特别是对于大尺寸问题。开发出非线性阈值接受算法(NTAA)以解决解决的优化问题。报告并分析了先前研究的测试问题的数值结果,以评估所提出的算法的效率。调查结果 - 与先前研究中获得的最佳解决方案的比较,即:遗传算法,模拟退火,麦克算法和粒子群优化的33个不同的问题,展示了所考虑的所有考虑实例的所提出算法的优越性,最小计算时间的高质量解决方案。研究限制/影响 - 考虑多个冗余策略有助于实现更高的可靠性水平,而是提高所获得的解决方案的复杂性导致物理设计期限的可行系统。技术限制必须集成到模型中,以提供更全面的和现实的方法。实际意义 - 设计满足客户要求的高性能系统,不同的经济和功能约束是制造商面临的主要挑战。所提出的算法旨在通过考虑在最小计算时间内在子系统级别采用多个冗余策略来提供可靠性优化问题的优异解决方案。原创/值 - NTAA在考虑到体重和成本限制的子系统级别的多种冗余策略,扩展到RAP。开发了一种基于惩罚目标职能的程序,以鼓励算法探讨可行的解决方案区域。通过优于众所周知的求解技术,NTAA为复杂系统的可靠性设计人员提供了强大的工具,可以考虑不同品种的冗余品种来实现高可靠性系统。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号