• Proceedings of the Korea Information Processing Society Conference
• /
• 2000.04a
• /
• pp.1133-1138
• /
• 2000

최소비용 선형 망 흐름 문제가 동등한 할당 문제로 변환될 수 있으며, 또한 선형 망 흐름 문제를 해결하기 위한 전통적 방법은 단순 싸이클 흐름을 변환시킴으로서 원시 비용을 개선하는 방법이다. Auction 알고리즘이 각각의 반복에서 분산계산을 제시하는 개체와 초기의 대상 가격을 선택하기 위하여 몇 개의 특별한 법칙과 함께 동일한 문제에 적용이 될 때, 개체는 ${\varepsilon}$-이완법의 형태에서 획득할 수 있다. 본 논문은 할당 문제를 해결하기 위한 방법으로 최소비용 흐름 문제를 일반화 시켜, 전형적인 반복에 최소비용 흐름 문제, 수학적 등가에 의한 최소비용 흐름 문제를 연구하였고, 최소비용 흐름 측면에서 수송문제의 확장과 ${\varepsilon}$-이완법을 도출하여 이를 PCB 설계에 응용하고자 하였다.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 1993.04a
• /
• pp.215-224
• /
• 1993

본 논문에서는 고가의 수리가능제품의 최적여유재고 수준을 결정하는 효율적인 방법을 제안한다. 고려하는 시스템은 각 기지창과 중앙창에서 한정된 수리능력을 가지며 중앙창에서 수리가 끝난 후 수리된 제품은 원래의 기지창으로 되돌아가서 재고에 포함되는 형태이다. 제안한 방법은 최소비용의 재고수준을 결정하는 방법 및 최소요구충족율을 가장 적은 비용으로 만족시키는 여유재고수준을 결정하는 최적해법이다. 제안한 방법을 실제시스템에 적용하면 최소의 비용으로 장비나 무기를 원하는 수준으로 가동시킬 수 있으므로 국방비의 효율적인 사용 및 절감에 도움이 될 것이다.

• Journal of the Korea Society for Simulation
• /
• v.16 no.1
• /
• pp.1-9
• /
• 2007

The development of efficient Qualify of Service (QoS) routing algorithms in high speed networks is extremely difficult to achieve, because in order to operate, divergent services require various quality conditions. If the parameter of concern is to measure the delay on a specific link, the routing algorithm obtains the Least Delay (LD) path. Meanwhile, if the parameter is to measure the link cost, the Least Cost (LC) path is calculated. The Delay Constrained Least Cost (DCLC) path problem of the mixed issues on the LD and LC has been shown to be NP-hard. The path cost of LD path is relatively more expensive than that of the LC path, and the path delay of the LC path is relatively higher than that of the LD path in the DCLC problem. In this paper, we introduce the new factor for balancing cost and delay. The simulation result shows that our introduced factor is satisfied to solve the DCLC problem.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 2000.04a
• /
• pp.526-529
• /
• 2000

본 연구는 물류 개선이 시급하고, 전자상거래 등으로 인한 물류 거점의 확보가 중요시되고 있는 현실의 문제점을 개선하기 위해 Simulated Annealing 알고리즘을 제안한다. 이미 위치가 설정된 노드의 요구에 최소비용으로 원활히 대응하기 위한 다 물류센터의 최적 위치와 할당영역, 규모를 결정하고, 각 물류센터가 담당한 영역의 노드를 반드시 한번씩 경유하여 처음 위치로 돌아오는 최소비용의 경로를 탐색한다. 이러한 과정을 위해 두 개의 모델인 1) 다 물류센터의 위치결정을 통한 규모결정과 영역할당모델, 2) 경로계획 모델을 개발한다. 거리산정방법과 물동량에 따른 가중치를 적용한 다양한 물류센터의 위치결정과 규모결정, 각 물류센터별 영역을 할당하여 단 물류센터의 문제로 만든 후 경로계획을 실시하여 최소비용의 경로(Tour)를 구하는 알고리즘을 개발하고 Sample을 적용한다.

• The Transactions of the Korea Information Processing Society
• /
• v.3 no.7
• /
• pp.1707-1718
• /
• 1996

Given a signal net N=s, 1,...,n to be the set of nodes, with s the source and the remaining nodes sinks, an MRDPT (minimum-cost rectilinear Steiner distance -preserving tree) has the property that the length of every source to sink path is equal to the rectilinear distance between the source and sink. The minimum- cost rectilinear Steiner distance-preserving tree minimizes the total wore length while maintaining minimal source to sink length. Recently, some heuristic algorithms have been proposed for the problem offending the MRDPT. In this paper, we investigate an optimal structure on the MRDPT and present a theoretical breakthrough which shows that the min-cost flow formulation leads to an efficient O(n2logm)2) time algorithm. A more practical extension is also in vestigated along with interesting open problems.

• Journal of the Korea Society of Computer and Information
• /
• v.17 no.1
• /
• pp.161-169
• /
• 2012

In general, Euclidean minimum spanning tree is a tree connecting input nodes with minimum connecting cost. But the tree may not be optimal when applied to real world problems of three dimension. In this paper, three dimension Euclidean minimum spanning tree is proposed, connecting all input nodes of 3-dimensional space with minimum cost. In experiments for 30,000 input nodes with 100% space ratio, the tree produced by the proposed method can reduce 90.0% connection cost tree, compared with the tree by two dimension Prim's minimum spanning tree. In two dimension plane, the proposed tree increases 251.2% connecting cost, which is pointless in 3-dimensional real world. Therefore, the proposed method can work well for many connecting problems in real world space of three dimensions.

• Journal of Internet Computing and Services
• /
• v.8 no.1
• /
• pp.25-31
• /
• 2007

The development of efficient Quality of Service (QoS) routing algorithms in high speed networks is very difficult since divergent services require various quality conditions, If the QoS parameter we concern is to measure the delay on that link, then the routing algorithm obtains the Least Delay (LD) path, Meanwhile, if the parameter is to measure of the link cast, then it calculates the Least Cost (LC) path. The Delay Constrained Least Cast (DCLC) path problem of the mixed issues on LD and LC has been shown to be NP-hard. The path cost of LD path is relatively mere expensive than that of LC path, and the path delay of LC path is relatively higher than that of LD path in DCLC problem. In this paper. we propose the algorithm based on estimated path for the DCLC problem and investigate its performance, It employs a new parameter which is probabilistic combination of cost and delay, We have performed empirical evaluation that compares our proposed algorithm with the DCUR in various network situations.

• Water for future
• /
• v.27 no.4
• /
• pp.161-171
• /
• 1994

The water distribution system problem consists of finding a minimum cost system design subject to hydraulic and operation constraints. The design of new branching network in a paddy irrigation system is presented here. The program based on the linear programming formulation is aimed at finding the optimal economical combination of two main factors: the capital cost of pipe network and the energy cost. Two loading conditions and booster pumps for design of pipe network are considered to obtain the least cost design.

• Communications for Statistical Applications and Methods
• /
• v.17 no.6
• /
• pp.755-765
• /
• 2010

For classification problems on mixture distribution, a threshold based on cost functions is optimal from the viewpoint of a minimum expected cost. Assuming that there is no cost information, we propose cost ratios in the expected cost corresponding to thresholds where the total accuracy and the true rate are maximized to explain the relation of these cost ratios minimizing the expected cost. Other cost ratios are also proposed by comparing the normalized expected costs when classification accuracy is maximized. The values of these cost ratios are located between two cost ratios for the expected costs based on classification accuracies, and converge to that of the minimum expected cost. This work suggests two cost ratios: one is minimized by the expected cost and the normalized expected cost, and the other in the expected cost and the normalized expected cost functions that are maximized classification accuracies. We discuss their compatibility based on the relation of these cost ratios.

• Bulletin of Korea Environmental Preservation Association
• /
• s.387
• /
• pp.8-12
• /
• 2010