n中取相邻k系统可靠性及街灯照明系统维修策略

RELIABILITY OF CONSECUTIVE-k-OUT-OF-n:F/G SYSTEMS AND A MAINTAINENCE STRATEGY FOR STREET LAMP SYSTEMS

本文从“n中取相邻k坏(好)”系统的等效网络出发,提出统一采用工程界熟知的不交最小割(路)集法计算其可靠度,讨论了在k≤n≤2k条件下大型系统的简化计算,以及n中取相邻2坏的街灯照明系统的维修策略。

Based on the equivalent network of consecutive-k-out-of-n:F/G systerfis, the approach of disjoint minimum cut sets (path sets) is presented for computing the reliability of these systems, and the simplification of reliability computations for large systems on the condition k≤n≤2k is discussed. Finally, a maintenence strategy for street lamp systems is explored in this article.