• Korean Management Science Review
• /
• v.11 no.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.

• KIEE International Transactions on Power Engineering
• /
• v.2A no.3
• /
• pp.121-128
• /
• 2002

This study proposes a new method for transmission system expansion planning using fuzzy integer programming. It presents stepwise cost characteristics analysis which is a practical condition of an actual system. A branch and bound method which includes the network flow method and the maximum flow - minimum cut set theorem has been used in order to carry out the stepwise cost characteristics analysis. Uncertainties of the permissibility of the construction cost and the lenient reserve rate and load forecasting of expansion planning have been included and also processed using the fuzzy set theory in this study. In order to carry out the latter analysis, the solving procedure is illustrated in detail by the branch and bound method which includes the network flow method and maximum flow-minimum cut set theorem. Finally, case studies on the 21- bus test system show that the algorithm proposed is efficiently applicable to the practical expansion planning of transmission systems in the future.

• Journal of Korean Society of Occupational and Environmental Hygiene
• /
• v.17 no.3
• /
• pp.203-211
• /
• 2007

This study was conducted in cut rose cultivation field in Goyang to evaluate pesticide exposure of farmers and the relationship between the exposure and work environment/method for cut rose farmers. Dermal exposure was assessed with patch (thin chromatography layer paper), cotton glove by body parts during mixing and spraying works in which pyrethroid, organophosphate, carbamate pesticide were used in 4 cut rose greenhouses located in Goyang province, checking characteristics of environment/working method at the same time. Body parts assessed were as follows ; glove : hand, patch : head, neck(front/back), chest, back, shoulder(right/left), upperarm(right/left), forearm(right/left), thigh(right/left), shin(right/left). Pesticides were analyzed using gas chromatography(NPD/FID) after extracting with ethyl acetate. Exposure amount differed according to pesticide type. But after standardizing with total net weight of pesticide sprayed, there were no significant difference among pesticides. There were significant difference in exposure amount among body parts(especially exposure amount of thigh, shin were more than the others), which means exposure happen not by pesticide dispersion in air but by contact with cut rose(leaf, branch) indirectly. Walking forward during spraying made farmers more exposed than waling backward, these results means contacts with leaves/branches made exposure happen in cut rose greenhouse also. As a result, pesticide exposure in cut rose greenhouse was related with contact of leaf/branch which pesticide remained in, which made exposure pattern (especially exposure amount) differ by body parts

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.26 no.3
• /
• pp.58-66
• /
• 2003

The cut tree approach of Montreuil and Ratliff [16] and eigenvector approach [10] are used to automatically draw a feasible facility layout with aisle structure. The department arrangement can minimize an aisle distance criterion considering door locations and dimension constraints. The aisle distance is measured by the door to door distance between departments. An eigenvector and cut tree approaches [1] are implemented based on the branch and bound technique in Kim et al. [2] in order to obtain feasible layouts. Then, the algorithm to fix the door location of each department is developed. After the door locations are determined, the factory layout is evaluated in terms of aisle distance. The aisle structure is obtained by expanding the original layout. The solution is kept until we will find better factory layout. The proposed approach based on the branch and bound technique, in theory, will provide the optimal solution. 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(l) and width(w) are fixed and a perfect fit is generated if a fit is possible.

• Journal of Navigation and Port Research
• /
• v.30 no.7
• /
• pp.561-566
• /
• 2006

In this paper, we propose a new ship scheduling set packing model considering limited risk or variance. The set packing model is used in many applications, such as vehicle routing, crew scheduling, ship scheduling, cutting stock and so on. As long as the ship scheduling is concerned, there exits many unknown external factors such as machine breakdown, climate change and transportation cost fluctuation. However, existing ship scheduling models have not considered those factors apparently. We use a quadratic set packing model to limit the variance of expected cost of ship scheduling problems under stochastic spot rates. Set problems are NP-complete, and additional quadratic constraint makes the problems much harder. We implement Kelley's cutting plane method to replace the hard quadratic constraint by many linear constrains and use branch-and-bound algorithm to get the optimal integral solution. Some meaningful computational results and comments are provided.

• Korean Journal of Computational Design and Engineering
• /
• v.2 no.1
• /
• pp.19-27
• /
• 1997

This paper presents rough cut tool path planning for the fewer-axis machine consisting of a three-axis CNC machine and a rotary indexing table. In the problem dealt with in this paper, the tool orientation is "intermediately" changed, distinguished from the conventional problem where the tool orientation is assumed to be fixed. The developed rough cut path planning algorithm tries to minimize the number of tool orientation (setup) changes together with tool changes and the machining time for the rough cut by the four procedures: a) decomposition of the machining area based on the possibility of tool interference (via convex hull operation), b) determination of the optimal tool size and orientation (via network graph theory and branch-and bound algorithm), c) generation of tool path for the tool and orientation (based on zig-zag pattern), and d) feedrate adjustment to maintain the cutting force at an operation level (based on average cutting force). The developed algorithms are validated via computer simulations, and can be also used in pure fiveaxis machining environment without modification.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.18 no.8
• /
• pp.1108-1116
• /
• 1993

Y-branch directional coupler optica1 switches with two different coupling lengths are fabricated on z-cut LiNbO3 and tested at r = 1.3 rm. The normal mode and coupled mode theories are utilized to calculate device coupling length and switching voltage. Simulation of the beam propagation method (BPM) is also performed to confirm the device coupling lengths. For dc operation, experimental results are in good agreement with the modee theories expectation.

• 전기의세계
• /
• v.17 no.4
• /
• pp.18-27
• /
• 1968

Analysis of the transient stability of power systems following disturbances involves many sets of non-linear differential equations. This paper attempts to analyze the transient stability of multi-machine power systems by the step by step method, using the electronic digital computer. The critical switching times and phase angles for the main 154KV transmission system in Korea, are given from the swing curves of the probable conditions. It is concluded that the system is, in general, stable if the relay is cut off within 12 cycles after the fault. However the fault of DAEGU-SANGJU branch, accompanying much real power, makes the system unstable when the raly is cut off within 4 cycles after fault or automatic voltage regulators are equipped in this branch.

• Proceedings of the Optical Society of Korea Conference
• /
• 1990.02a
• /
• pp.219-221
• /
• 1990

Y-branch directional coupler type optical modulators with three different coupling lengths were fabricated on z-cut LiNbO3 and tested at λ-1.3${\mu}{\textrm}{m}$. One device gad an exact coupling length for complete power transfer and two other devices had coupling lengths. It was confirmed that, for dc operation, experimental results agreed well with theoretical results.

• Journal of Digital Contents Society
• /
• v.3 no.2
• /
• pp.221-233
• /
• 2002

In this paper, we present integer programming models and algorithms for the Capacitated Facility Location-Allocation Problem (CFLP). The models and algorithms can be used for the design of logistics networks and for the location of telecommunication facilities. We are given a set of candidate facility installation sites, one type of facility for each candidate site with its capacity and installation cost, a set of customers with their demand requirement, and flow cost for one unit of demand flow from each customer to each candidate site. (CFLP) is to determine the number of facilities for each candidate site and the set of customers which are connected to each site with minimum cost, while satisfying the demand requirement of each customer and constraints imposed on the allocation of customers to facilities. We present two integer programming models for (CFLP), and devise a branch-and-cut algorithm and a branch-and-price algorithm for the problem.