• 대한산업공학회지
• /
• 제19권3호
• /
• pp.51-57
• /
• 1993

This paper develops 0($n^3$) algorithm to construct a cut-tree generated by Gomory-Hu algorithm. The algorithm only requires node sets defined by the minimal cut in each of the (n-1) maximal flow determinations. Merging computerized facility layout procedure that uses cut-tree concept to generate design skeletons with our algorithm requires less storage space than merging it with Gomory-Hu algorithm. Also, the cut-tree can easily be modified when the (n-1) minimal cut-sets are updated due to changes on arc capacities.

• 한국국방경영분석학회지
• /
• 제6권1호
• /
• pp.119-124
• /
• 1980

An efficient algorithm which can be employed in obtaining the minimal cut sets of a fault tree containing repeated events is introduced. A sample fault tree illustrates this algorithm. Efficiency of an algorithm is defined as the ratio of the number of minimal cut sets to the number of cut sets determined by the algorithm. An efficiency of the proposed algorithm is compared with those of two existing algorithms : Fussell and Vesely's algorithm and Bengiamin et al. 's algorithm. The proposed algorithm is shown to be more efficient than the existing two algorithms.

• 제어로봇시스템학회논문지
• /
• 제18권12호
• /
• pp.1096-1100
• /
• 2012

Most of previous genetic algorithms for solving graph problems have used a vertex-based encoding. We proposed an edge encoding based new genetic algorithm using a spanning tree. Contrary to general edge-based encoding, a spanning tree-based encoding represents only feasible partitions. As a target problem, we adopted the MAX CUT problem, which is well known as a representative NP-hard problem, and examined the performance of the proposed genetic algorithm. The experiments on benchmark graphs are executed and compared with vertex-based encoding. Performance improvements of the spanning tree-based encoding on sparse graphs was observed.

• 산업경영시스템학회지
• /
• 제12권20호
• /
• pp.1-24
• /
• 1989

This paper takes aim at the reliability evaluation by application of Fault Tree Analysis and its computerization. FTA is one of the methods for evaluation of system reliability and safety analysis. The important characteristic of this paper is that computer program is written in the package program(dBaseIII+) by 16Bit/AT personal computer. The program consists of three program segments. (1) The minimal cut sets of the system fault tree are obtained by means of "Fault tree reduction algorithm" (2) The minimal path sets are obtained by inversion of the minimal cut sets determined from fault tree (3) The importance of the basic events which are presented in the minimal cut sets is obtained by means of structural importance analysis. In this paper, a Fault Tree Analysis is applied to a BAG FILTER which is a kind of dust collector.collector.

• 한국화재소방학회논문지
• /
• 제31권6호
• /
• pp.67-73
• /
• 2017

항공기 정비 격납고는 고가의 항공기를 보관하거나 정비, 점검등을 하는 건축물로 화재발생 빈도는 낮지만 화재발생 시 인적, 물적 피해가 매우 클 수 있다. 따라서 본 연구에서는 Fault tree를 이용하여 현재 운용중인 항공기 정비 격납고 소화시스템의 화재 안전성에 대한 정성적 분석을 시행하고, 도출된 기본사상에 대한 고장률 자료를 활용하여 정량적 분석을 실시한 후 정상사상의 발생 확률에 대한 Minimal cut set의 중요도를 분석하였다. Minimal cut set에 의한 정성적 분석결과 항공기 격납고 포헤드 소화시스템의 화재제어 실패로 대형화재로 확대될 수 있는 사고경로는 14개라는 것을 알 수 있었다. 또한 정량적인 분석 결과 대형화재로 확대될 확률은 $2.08{\times}E-05/day$이며, Minimal cut set의 중요도 분석 결과 화재 발생 시 4개의 Minimal cut set 즉, 구역별 화재 감지기 및 포헤드 동작과 항공기 날개 및 Fire plume에 의한 소화약제 차단이 동일하게 24.95%로 대형화재로 확대될 가능성의 대부분을 차지하였으며, 항공기 정비 격납고의 포헤드 소화시스템은 항공기 날개 하부화재에 대한 적응성이 없어 개선이 필요한 것으로 Fault tree를 이용하여 처음 확인하였다.

• 경영과학
• /
• 제11권3호
• /
• pp.55-65
• /
• 1994

Given the flow matrix, plant size and department sizes, the algorithms in this paper provide the layout with rectilinear distance. To construct automated facility design, cut tree approach is employed. A branch and bound computer code developed by Tillinghast is modifided to find the feasible fits of departments without shape distortion in the plant rectangle.

• 한국안전학회지
• /
• 제32권1호
• /
• pp.41-46
• /
• 2017

In this paper, from making an electrical fire which is thought to be the most damaging among potential dangers as a top event, minimal cut sets (MCS) about it were analyzed. For this, components of a power substation were classified into 15 items. Failure rates and modes were extracted based on Korea Electrical Safety Corporation, IEEE Gold Book, and RAC. To analyze the top event (an electrical fire), main events were assorted into "safety devices for overcurrent" and "ampere meter of detecter". Failure of components was divided into failure of VCB, COS, and MCCB. A fault tree was composed of 3 AND gate, 5 OR gates and 17 basic events. Overlapped events among the basic events are things which occur from relevant components. They were attached to the tree by distinguishing identifiers. In case of FT, two minimal cut sets of "IO_METER", "MF_METER", "DO_MCCB" and "IO_METER", "MF_METER", "DO_VCB" take 46% of electrical fires. Therefore, about basic events which are included in the top two minimum cut sets, strict control is necessary.

• Nuclear Engineering and Technology
• /
• 제50권6호
• /
• pp.854-859
• /
• 2018

Calculating minimal cut sets is a typical quantification method used to evaluate the top event probability for a fault tree. If minimal cut sets cannot be calculated or if the accuracy of the quantification result is in doubt, the Monte Carlo method can provide an alternative for fault tree quantification. The Monte Carlo method for fault tree quantification tends to take a long time because it repeats the calculation for a large number of samples. Herein, proposal is made to improve the quantification algorithm of a fault tree with circular logic. We developed a top-down iteration algorithm that combines the characteristics of the top-down approach and the iteration approach, thereby reducing the computation time of the Monte Carlo method.

• 산업경영시스템학회지
• /
• 제26권4호
• /
• pp.42-49
• /
• 2003

The branch and bound techniques based on cut tree and eigenvector have been Introduced in the literature [1, 2, 3, 6, 9, 12]. These techniques are used as a basis to allocate departments to floors and then to fit departments with unchangeable dimensions into floors. Grouping algorithms to allocate departments to each floor are developed and branch and bound forms the basis of optimizing using the criteria of rectilinear distance. The proposed branch and bound technique, in theory, will provide the optimal solution on two dimensional layout. If the runs are time and/or node limited, the proposed method is a strong heuristic The technique is made further practical by the fact that the solution is constrained such that the rectangular shape dimensions length and width are fixed and a perfect fit is generated if a fit is possible. Computational results obtained by cut tree-based algorithm and eigenvector-based algorithm are shown when the number of floors are two or three and there is an elevator.

• 조경수
• /
• 통권95호
• /
• pp.17-18
• /
• 2006