• 경영과학
• /
• 제23권1호
• /
• pp.75-85
• /
• 2006

The rectilinear Steiner tree problem (RSTP) is to find a minimum-length rectilinear interconnection of a set of terminals in the plane. It is well known that the solution to this problem will be the minimal spanning tree(MST) on some set Steiner points. The RSTP is known to be NP-complete. The RSTP has received a lot of attention in the literature and heuristic and optimal algorithms have been proposed. A key performance measure of the algorithm for the RSTP is the reduction rate that is achieved by the difference between the objective value of the RSTP and that of the MST without Steiner points. A hybrid evolutionary strategy on RSTP based upon nodes set is presented. The computational results show that the hybrid evolutionary strategy is better than the previously proposed other heuristic. The average reduction rate of solutions from the evolutionary strategy is about 11.14%, which is almost similar to that of optimal solutions.

• 정보처리학회논문지:컴퓨터 및 통신 시스템
• /
• 제4권2호
• /
• pp.37-40
• /
• 2015

본 논문에서는 이항트리의 2-에지번호매김에서 선형적 에지번호매김 방법, 변형된 에지번호매김 방법 그리고 혼합형 에지번호매김 방법들을 제안한다. 이러한 연구결과는 최대 연결도를 갖는 신뢰성이 높은 상호연결망의 일종인 원형군 그래프(circulant graph)의 점프열(jump sequence)로 에지번호들을 사용하면 이항트리를 스패닝 트리로 갖고 최적방송이 가능한 다양한 위상들을 설계할 수 있다.

• Journal of information and communication convergence engineering
• /
• 제20권3호
• /
• pp.160-165
• /
• 2022

This paper proposes an efficient method of reconstructing interconnections when the terminals of each plane change in real-time situations where randomly divided planes are interconnected. To connect all terminals when the terminals of each plane are changed, we usually reconstruct the interconnections between all terminals. This ensures a minimum connection length, but it takes considerable time to reconstruct the interconnection for the entire terminal. This paper proposes a solution to obtain an optimal tree close to the minimum spanning tree (MST) in a short time. The construction of interconnections has been used in various design-related areas, from networks to architecture. One of these areas is an ad hoc network that only consists of mobile hosts and communicates with each other without a fixed wired network. Each host of an ad hoc network may appear or disappear frequently. Therefore, the heuristic proposed in this paper may expect various cost savings through faster interconnection reconstruction using the given information in situations where the connection target is changing.

• 상하수도학회지
• /
• 제28권6호
• /
• pp.699-711
• /
• 2014

This study was carried out to analyze water suspension in the water supply system through fault tree analysis. And quantitative factors was evaluated to minimize water suspension. Consequently the aim of this study is to build optimal planning by analyzing scenarios for water suspension. Accordingly the fault tree model makes it possible to estimate risks for water suspension, current risks is $92.23m^3/day$. The result of scenario analysis by pipe replacement, risks for water suspension was reduced $7.02m^3/day$ when replacing WD4 pipe. As a result of scenario analysis by water district connections, the amount of risk reduction is maximized when it is connecting to network pipe of D Zone. Therefore, connecting to network pipe for D Zone would be optimal to reduce risk for water suspension.

• 한국컴퓨터정보학회논문지
• /
• 제20권5호
• /
• pp.31-39
• /
• 2015

방향 가중 그래프의 차수제약 최소신장트리 (degree-constrained minimum spanning tree, d-MST) 문제는 정확한 해를 구하는 다항시간 알고리즘이 존재하지 않아 NP-완전 문제로 알려져 왔다. 따라서 휴리스틱한 근사 알고리즘을 적용하여 최적 해를 구하고 있다. 본 논문은 차수와 사이클을 검증하는 Kruskal 알고리즘으로 d-MST의 초기 해를 구하고, d-MST의 초기 해에 대해 k-opt를 수행하여 최적 해를 구하는 다항시간 알고리즘을 제안하였다. 제안된 알고리즘을 4개의 그래프에 적용한 결과 2-MST까지 최적 해를 구할 수 있었다.

• Journal of information and communication convergence engineering
• /
• 제21권1호
• /
• pp.54-61
• /
• 2023

The family tree is one of the key elements of humanities classics research and is very important for accurately understanding people or families. In this paper, we introduce a method for automatically generating a family tree using information on interpersonal relationships (IIPR) from the Korean Classics Database (KCDB) and visualize interpersonal searches within a family tree using data-driven document JavaScript (d3.js). To date, researchers of humanities classics have wasted considerable time manually drawing family trees to understand people's influence relationships. An automatic family tree builder analyzes a database that visually expresses the desired family tree. Because a family tree contains a large amount of data, we analyze the performance and bottlenecks according to the amount of data for visualization and propose an optimal way to construct a family tree. To this end, we create an n-ary tree with fake data, visualize it, and analyze its performance using simulation results.

• 산업경영시스템학회지
• /
• 제4권4호
• /
• pp.63-69
• /
• 1981

As enterprises are getting bigger and bigger and more competecious, an engineering economy for the maximization of profit based on basic theory must be considered. This thesis present dynamic computer model for the decision which controls complicated and various man- machine system optimally. This model occur in general stage can be adaptable to every kind of enterprises. So, any one who has no expert knowledge is able to get the optimal solution. And decision tree used in this paper can be applied in every kinds of academic circles as well as whole the industrial world. This paper studied optimal management of engineering project based upon basic theory of engineering economy. It introduces and functionizes the variables which generalize every possible elements, set up a model in order to find out the variable which maximize the calculated value among many other variables. And the selected values ate used as decision- marking variables for the optimal management of engineering projects. It found out some problem of this model. They are : 1. In some kinds of man-machine system it refers to Probability, but other case, it depends on only experimental probability. 2. Unless decision making process (decision tree) goes on, this model can not be applied. So these cases, this paper says, can be solved by adapting finite decision tree which is analyzed by using the same technic as those in product introduction problem. And this paper set up the computer model in order to control every procedure quickly and optimally, using Fortran IV.

• Journal of applied mathematics & informatics
• /
• 제28권1_2호
• /
• pp.283-293
• /
• 2010

In this paper, inverse constrained minimum spanning tree problem under Hamming distance. Such an inverse problem is to modify the weights with bound constrains so that a given feasible solution becomes an optimal solution, and the deviation of the weights, measured by the weighted Hamming distance, is minimum. We present a strongly polynomial time algorithm to solve the inverse constrained minimum spanning tree problem under Hamming distance.

• 한국정밀공학회지
• /
• 제17권2호
• /
• pp.176-184
• /
• 2000

Possible representation methods for the product structure have been compared and analyzed to determine optimal disassembly path of a product. Petri net is selected as the most optimal method to represent disassembly path of the product. In this method, a reachability tree for the product is generated and disassembly time for each path is calculated. A path with the smallest disassembly time is selected as the optimal path. A software far DPN(Disassembly Petri Net) has been developed and applied to search the optimal disassembly path for a ballpoint pen disassembly process as an example.

• 전자공학회논문지B
• /
• 제33B권6호
• /
• pp.102-110
• /
• 1996

A new design scheme of a binary decision tree is proposed. In this scheme a binary decision tree is constructed by using genetic algorithm and FCM algorithm. At each node optimal or near-optimal feature subset is selected which optimizes fitness function in genetic algorithm. The fitness function is inversely proportional to classification error, balance between cluster, number of feature used. The binary strings in genetic algorithm determine the feature subset and classification results - error, balance - form fuzzy partition matrix affect reproduction of next genratin. The proposed design scheme is applied to the tire tread patterns and handwriteen alphabetic characters. Experimental results show the usefulness of the proposed scheme.