• Proceedings of the KIEE Conference
• /
• 1990.07a
• /
• pp.171-174
• /
• 1990

When load areas on a feeder are deenergized due to faults,operaters need to identify nelghboring feeders, try to restore customers and minimize out-of-service areas. These cases include knowledge of system states and various constraints such as voltage drop. This paper concerns the load transfer infault restoration. Also, it is considered the operating constraints such as line current capacity, relay trip current, transformer capacity, voltage drop and line loss. The expert system is able to propose the optimal load transfer method by anallzing system states and considering constraints.

• Journal of Industrial Technology
• /
• v.27 no.A
• /
• pp.69-76
• /
• 2007

The body of an excavator, one sort of the construction equipment, consists of mainframe part, track frame part, boom part and arm part. The all parts are manufactured in the body welding operation. The scheduling in the body welding operation of a construction equipment manufacturing is to take all the various constraints into consideration. The offset time, due date, daily capacity of operations, daily jig's capacity, precedence relation, outsourcing, alternative resource and all of the shop floor environment should be considered. An APS(Advanced Planning & Scheduling) system is a proper and efficient system in such circumstance. In this paper, we present an APS system, the optimal scheduling system for the construction equipment manufacturing specifically for the body welding operation, using ILOG Solver/Scheduler. ILOG Solver/Scheduler is a general purposed commercial software which supports to find a feasible or optimal solution using object oriented technique and constraints satisfaction programming, given constraints and objectives.

• Journal of Environmental Impact Assessment
• /
• v.12 no.3
• /
• pp.151-160
• /
• 2003

Analysis of carrying capacity and site suitability by the systematic application of environmental information an provide a basis for implementing environmentally sensitive and sustainable resource development policies. Based on the availability of public services and environmental and site-specific constraints, a Rural Residential Density Matrix was applied in Santa Cruz County, California, USA to assess the development potential of rural land parcels since 1980. In one case, the Matrix was applied to calculate the allowable development density on a site in Lompico planned for use as a Buddhist retreat center. These calculations revealed higher environmental sensitivity and lower carrying capacity than projected in the proposed plan. Under the constraints of the county's minimum acreage policies and insufficient developable land, the developer cancelled the proposed plan. This example suggests that application of the Matrix at the concept development stage would increase the effectiveness of the prior environmental review and environmental impact assessment (EIA) system in Korea.

• Journal of Industrial Technology
• /
• v.16
• /
• pp.217-230
• /
• 1996

This paper deals with storage and retrieval policies for S/R machine with capacity constraints in Man-On-Board AS/RS. It is assumed that storage sequence is based on SFC(spacefilling curve) routine and that storage layout is dedicated by storage policies. We present several heuristic algorithms for storage and retrieval policies which minimize total distance travelled by the S/R machine. These algorithms are based on COI, group COI, frequency of order, similarity between items and capacity of S/R machine. Experimental results of 24 combinastorial policies are provided to illustrate the performance of the heuristics under various rack utilization ratios. In storage policies, the results show that algorithms considering both similarity and frequency are better than those with COI as rack utilization is increasing. And algorithm using group COI is superior to others. In retrieval policies, the method with revision expression is shown to be better than others.

• Journal of Korean Institute of Industrial Engineers
• /
• v.33 no.3
• /
• pp.303-311
• /
• 2007

This study deals with a type of vehicle routing problem faced by manager of some department stores during peak sales periods. The problem is to find a set of traveling paths of vehicles that leave a department store and arrive at a destination specified for each vehicle after visiting customers without violating time and capacity constraints. The mathematical model is formulated with the objective of maximizing the sum of the rewards collected by each vehicle. Since the problem is known to be NP-hard, a heuristic algorithm is developed to find the solution. The performance of the algorithm is compared with the optimum solutions obtained from CPLEX for small size problems and a priority-based Genetic Algorithm for large size problems.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.49 no.8
• /
• pp.70-76
• /
• 2012

In this paper, we propose a power allocation scheme of the unlicensed user based on orthogonal frequency division multiplexing (OFDM) in the TV white space (TVWS). Power constraints in TVWS should be satisfied in the time domain. However, because OFDM has high PAPR (peak-to-average power ratio), it is difficult to satisfy power constraints of TVWS in the time domain. Furthermore, the conventional power allocation schemes cannot be generally applied to unlicensed user in TVWS. Therefore, we propose a power allocation scheme to satisfy power constraints of TVWS by reducing PAPR in the time domain. In addition, we analyze the capacity of the unlicensed user based on OFDM in a closed form. Based on the capacity analysis, as the number of subcarriers decreases, the capacity can be enhanced. In simulation results, we show that the capacity of the unlicensed user increases, as the number of subcarriers decreases and the mean of the channel between the transmitter and the receiver of the unlicensed user increases.

• Proceedings of the Korean Institute of Communication Sciences Conference
• /
• 1983.10a
• /
• pp.108-111
• /
• 1983

This paper presents a new method for the optimum capacity assignment in store-and-forward communication networks under a total fixed-capacity constraints. Any two link capacities needed in this method can have the desirable quantites and then other capacities can be obtained from the fixed two link capacities. When the minimum and the maximum capacities that are the quantites of the conventional method are fixed, the total average time delay from the new method is almost the same as that from the conventional method. And when the minimum capacity is fixed, the new method gives smaller average time delay.

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

• Proceedings of the Korean Radioactive Waste Society Conference
• /
• 2018.05a
• /
• pp.92-93
• /
• 2018

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.7 no.9
• /
• pp.2154-2172
• /
• 2013

A centralized cognitive radio (CR) network is proposed and its system capacity is studied. The CR network is designed with power control and multi-user scheduling schemes to support best-effort traffics under peak interference power constraints. We provide an analytical framework to quantify its system capacity, taking into account various key factors such as interference constraints, density of primary users, cell radius, the number of CR users, and propagations effects. Furthermore, closed-form formulas are derived for its capacities when only path loss is considered in the channel model. Semi-analytical expressions for the capacities are also given when more realistic channel models that include path loss, shadowing, and small-scale fading are used. The accuracy of the proposed analytical framework is validated by Monte Carlo simulations. Illustrated with a practical example, the provided analytical framework is shown to be useful for the strategic planning of centralized CR networks.