http://chineseinput.net/에서 pinyin(병음)방식으로 중국어를 변환할 수 있습니다.
변환된 중국어를 복사하여 사용하시면 됩니다.
서순근,김우성,하천수 동아대학교 생산기술연구소 1999 生産技術硏究所硏究論文集 Vol.4 No.1
This paper presents a heuristic algorithm to find the topological layout of links with different reliabilities in order to extend the previous research studied under the assumption of the identical reliabilities of all the links and illustrates with a numerical example. We determine 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 examines all the subnetwork with a^* links whether satisfy the reliability constraint, and are suboptimal solution or not. In order to overcome the ineffectiveness of a^*, forward Branch &ound algorithm that the number of links is decreasing from a^* and backward Branch &ound algorithm that the number of links is increasing are employed. The proposed procedure reduces the number of computations of exact network reliability and the results of a numerical example may demonstrate these strong points of the proposed procedure.