• Journal of the Korean Operations Research and Management Science Society
• /
• v.11 no.1
• /
• pp.24-35
• /
• 1986

We investigate various methods of the Benders decoposition algorithm in its application to the simple plant location problem. We developed six variants. The master problem may be relaxed as an LP problem up to an appropriate point in time, or need not be solved to the optimality before a cut is added. Furthermore, since the subproblem is highly degenerated, we can generate more than one cuts at a time. The efficiency of the methods are examined using a sample problem. The result showed that the adding two-cut method was superior to the standard method. The LP relaxation and the non-optimization of the master program greatly improved the efficiency. Applying the LP relaxation method, we were able to reduce the computing time by two thirds of the time required by the standard method.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 2006.05a
• /
• pp.1603-1608
• /
• 2006

Nuclear power plant have focused constituent that is always safety. However, period set to observe element that is economic performance keeping inner place now. Hereupon, in this study, chose fuel replace that is on one main activity doing at nuclear power plant for the target. And chose computerization and data management for fuel replace process to the direction.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.17 no.1
• /
• pp.17-30
• /
• 1992

This paper concerns with (p$_{1}$, p$_{2}$)-Plant Location problem in which entire set of candidate sites for facility locations is divided by two overlapping subsets, each of which with its own number of facilities to be established. We propose an algorithm which attempts to solve the Lagrangean dual of (p$_{1}$, p$_{2}$)-PLP by dividing sub-problem into twop-Plant Location Problems and solving them based on the convexity of the Lagrangean dual problem with respect to the number of facilities to be established. In doing so, Orthogonal Move procedure is proposed to provide easy-to-obtain lower bound to the Lagrangean Dual of (p$_{1}$, p$_{2}$)-PLP. Computational experience is reported.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.20 no.1
• /
• pp.101-113
• /
• 1995

The past three decades have witnessed a tremendous growth is the literature on location proble. A mathematical formulation of uncapacitated plant location problem and the k-median as an integer program has proven very fruitful in the derivation of solution methods. Most of the successful algorithms for the problem are based on so-called "strong" linear programming relaxation. This is due to the fact that the strong linear programming relaxation provides a tight lower bound. In this paper we investigate the phenomenon with a structural analysis of the problem.e problem.

• Journal of the Korean Professional Engineers Association
• /
• v.35 no.4
• /
• pp.68-73
• /
• 2002

Almost every industrial plant or building has their own boiler systems, so boilers are often called "kinds of social infrastructures"In Korea, We have many indistinct problems on efficient operations of industrial boiler systems. In this paper, to elevate thermal operation efficiency and to diminish air pollutions of the boilers, especially in urban area, at present, "The muliple installation systems of small type once through boiler(gas fired)" are suggested.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 1995.04a
• /
• pp.758-759
• /
• 1995

In large-scale industry such as shipbuilding, aircraft manufacturing, and construction industry etc., it is required to consider two or three-dimensional spatial availability as one of bottlenecked resource constraints. We call this kind of scheduling a spatial scheduling, which considers the dynamic spatial layouts of objects as well as the traditional resource constraints. Since 1991, we have researched on the spatial scheduling for shipbuilding plant (Lee & Lee, 1992; Lee et al., 1994, Lee et al., 1995). In this paper, we present the various issues of spatial scheduling for the researchers and developers attacking spatial scheduling problems.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 1996.04a
• /
• pp.179-182
• /
• 1996

Database management systems are now used in almost every organization to maintain and utilize important collections of information. Relational DBMSs have a firm theoretical base. However, it lacks important features needed for representing certain critical aspects of an entity. One alternatives to remedy this problem is to adopt the object-oriented approach to the data model development process. In this paper, we tried to show the advantages of object-oriented data model design process for the development of extended relational database schema needed for the integrated plant information system at H. Heavy Industry Co.

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

원자력발전소의 과도상태와 불시정지에 대한 운전원의 진단 및 대응능력을 향상시키기 위하여 활용되고 있는 훈련용 시뮬레이터는 운영중인 발전소를 모델링하여 이를 응용 소프트웨어로 개발한 후 컴퓨터와 하드웨어 장비에 통합시킨 방식으로 개발되어 왔다. 이러한 개발방법은 훈련용 시뮬레이터 개발에 상당한 비용과 시간을 요구한다. 특히 시뮬레이션 소프트웨어 개발에 대한 상당한 투자가 요구된다. 본 연구에서는 원자력발전소 설계 시에 시스템 해석을 위하여 사용되는 열수력 및 안전해석 코드를 이용하여 훈련용 시뮬레이터를 단기간에 저비용으로 개발하는 전략을 제시한다.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.20 no.2
• /
• pp.77-93
• /
• 1995

A mathematical model for long-rage water supply planning was formulated as a dynamic plant location problem with network arc capacity expansion, and illustative example was presented. The proposed solution procedure identifies economical construction timings of surface water supply facilities and water conveyence systems and the best water supply operating patterns as well. In this study, we present a heuristic solution procedure using Simulated annealing Method in conjunction with Bertsekas & Tseng's RELAXT-II for the 0-1 integer network problem.

• Journal of the military operations research society of Korea
• /
• v.7 no.2
• /
• pp.100-113
• /
• 1981

A replacement policy for a finite time span is proposed for the cumulative process where an item can fail only when the total amount of deterioration exceeds a prespecified failure level. The optimal deterioration limit level is determined to minimize the total cost expected per unit for a given time span. An illustrative example in case of periodically inspected reformer tubes in ammonia plant is also presented.