论文部分内容阅读
本文研究复杂系统可靠度的最优配置问题。本文用路径跟踪计算两端点之间的最短路集合的方法,将一个复杂网络简化为一个等效串并网络,然后按照串并网络可靠度最优配置方法进行配置。文中给出了一个定理及实例。文献[1]提出的迭代算法,可用电子计算机搜索可靠度最优配置。但当系统结构复杂,系统中的环节数n很大时,即使用高速计算机,这种方法也是不可取的。因为这时要通过比较n!个可靠度方程式的值才能确定最优解。用穷举法进行比较并求解,同样不可取。本文给出了一般可循的简化法则,提供了一个适用于一般复杂系统的算法。理论研究证明,对于最优配置等效唯一的系统和非等效唯一的系统都可以获得最优配置。本文中的“约束”是指某些环节在系统中的位置不能随意配置,有时仅可配置在指定的部位。本文暂不研究环节配置受约束的各种原因。
This paper studies the optimal configuration of complex system reliability. In this paper, a method of calculating the shortest path set between two end points by path tracing is used to simplify a complex network into an equivalent serial-parallel network and then configure it according to the optimal configuration of reliability of the serial-parallel network. In the paper, a theorem and examples are given. The iterative algorithm proposed in [1] can search the reliability optimal configuration by using electronic computer. However, when the system structure is complicated and the number of links in the system is large, this method is not desirable even with a high-speed computer. This is because by comparing the values of n * reliability equations, the optimal solution can be determined. It is also not desirable to compare and solve with exhaustive methods. In this paper, we give a simplified general rule and provide an algorithm that is suitable for general complex systems. Theoretical studies show that the optimal configuration can be obtained for the only system that is equivalent to the optimal configuration and the system that is not equivalent. “Constraints” in this paper means that the positions of some links in the system can not be freely configured, and sometimes only the specified positions can be configured. This article does not study the constraints of the link configuration for a variety of reasons.