DAU Library

학위논문 동서

신뢰도 제약조건 하에서 네트워크의 경제적 설계

김우성

부산: 동아대학교 1994. -

60장; 27cm. -

학위논문(석사)- 동아대학교 대학원 산업공학과 `95년2월

영문초록 : Network reliability encompasses a. range of issues related to the design and analysis of networks such as data communication network, transportation networks, computer architectures, and electrical power network, etc, which are subject to the random failure of their components. In contrast to the considerable literature on computation and analysis of network reliability, there are few results concerned with the design of networks Recently, Jan, R.H., Hwang, F.J., and Cheng, S.T. presented the algorithm to design the topological layouts of links, at a minimal cost under the constraint that all terminal network reliability is not less than a given level of system reliability under the assumption of the identical reliability of all the links. We have proposed a heuristic algorithm to find the topological layout of links on the extended assumption that the links have different reliabilities, and illustrated with a numerical example. We have determined the minimal number of links (a*) to speed up a solution procedure with which the upper bound on reliability of subnetwork satisfies the reliability constraint, and have examined all the subnetwork with a* links whether satisfy the reliability constraint, and are suboptimal solution or not. However, the upper bound on network reliability may not be an effective because the mean of unequal reliabilities of links is employed as a candidate value in computing it. Hence, forward Branch & Bound algorithm that the number of links is decreasing from a* and backward Branch & Bound algorithm that the number of links is increasing have been developed in order t o overcome the ineffectiveness of a*. The procedure proposed in this study reduces the number of computations of exact network reliability in which computing time is required considerably, and covers more general network model with unequal link reliabilities. The results of a numerical example may demonstrate these strong points of the proposed procedure. One of possible future researches is to find the tight upper bound of network reliability t o determine a* or more effective algorithm than the proposed method. And another research is to discuss the distinctions and similarities of two models by comparing maximum-reliability topology subject to a cost constraint with minimum-cost topology subject t o a reliability constraint for the identical network models.

바로가기