• The Journal of the Korea Contents Association
• /
• v.20 no.7
• /
• pp.161-168
• /
• 2020

Local decentralization is a rational allocation of power and responsibilities between the state and local governments, but it is not just a transfer of administrative affairs and transfer of funds. In order to look at the task of moving administrative affairs to the districts, this paper first considered the relevant prior study. Next, we looked at the assessment of the level of function transfer and direction of transfer for government employees. Finally, the task for the transfer of functions has been drawn. Revitalizing functions or affair transfers requires the president's firm will and continued support, efforts to divide roles between central and local governments, increased responsibilities of local governments, revitalizing civic participation and establishing democracy. In addition, in order to expand the function transfer problem, the affair allocation system must be newly established. The discussion of such a system should take into account the issue of regional equity as well as financial transfers. Localization through transfer of functions requires, among other things, a change in perception of the relevant groups. Local decentralization requires long-term time and the participation and cooperation of not only the central but also related stakeholders are important, as seen in existing studies and in the nation's experience.

• Journal of the Korea Society for Simulation
• /
• v.28 no.1
• /
• pp.67-79
• /
• 2019

A warship equipped with Multi Function Radar(MFR) performs operations by evaluating the degree of threats based on threats' symptom and allocating the resource of MFR to the corresponding threats. This study suggests a simulation-based approach and greedy algorithm in order to effectively allocate the resource of an MFR for warships, and compares these two approaches. As a detection probability function depending on the amount of allocations to each threat, we consider linear and exponential functions. Experimental results show that both the simulation-based approach and greedy algorithm allocate resource similarly to the randomly generated threats, and the greedy algorithm outperforms the simulation-based approach in terms of computational perspective. For a various cases of threats, we analyze the results of MFR resource allocation using the greedy algorithm.

• Journal of Institute of Control, Robotics and Systems
• /
• v.20 no.12
• /
• pp.1246-1251
• /
• 2014

This article presents an optimum yaw moment distribution scheme for a vehicle with electronic stability control (ESC) and active rear steering (ARS). After computing the control yaw moment in the yaw moment controller, it should be distributed into tire forces, generated by ESC and ARS. In this paper, yaw moment distribution is formulated as an optimization problem. New objective function is proposed to tune the relative magnitudes of the tire forces. Weighed pseudo-inverse control allocation (WPCA) is adopted to solve the problem. To check the effectiveness of the proposed scheme, simulation is performed on a vehicle simulation package, CarSim. From the simulation, the proposed optimum yaw moment distribution scheme is shown to effective for vehicle stability control.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 2005.05a
• /
• pp.1020-1025
• /
• 2005

The set covering(SC) problem has many practical application of modeling not only real world problems in civilian but also in military. In this paper we study optimal allocation model for maximizing utility of consolidating old fashioned and new air defense weapon system like Patriot missile and develop the new computational algorithm for the SC problem by using simulated annealing(SA) algorithm. This study examines three different methods: 1) simulated annealing(SA); 2) accelerated simulated annealing(ASA); and 3) selection by effectiveness degree(SED) with SA. The SED is adopted as an enhanced SA algorithm that the neighboring solutions could be generated only in possible optimal feasible region at the PERTURB function. Furthermore, we perform various experiments for both a reduced and an extended scale sized situations depending on the number of customers(protective objective), service(air defense), facilities(air defense artillery), threat, candidate locations, and azimuth angles of Patriot missile. Our experiment shows that the SED obtains the best results than others.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.19 no.3
• /
• pp.139-149
• /
• 1994

In many project-oriented production systems, e. g., shipyards or large-scale steel products manufacturing, resource loading by an activity is flexible, and the activity duration is a function of resource allocation. For example, if one doubles the size of the crew assigned to perform an activity, it may be feasible to complete the activity in half the duration. Such flexibility has been modeled by Weglarz [13] and by Leachman, Dincerler, and Kim [7[ in extended formulations of the resource-constrained poject scheduling problem. This paper presents a new algorithmic approach to the problem that combines the ideas proposed by the aforementioned authors. The method we propose involves a two-step approach : (1) solve the resource-constrained scheduling problem using a heuristic, and (2) using this schedule as an initial feasible solution, find improved resource allocations by solving a linear programming model. We provide computational results indicating the superiority of this approach to previous methodology for the resource-constrained scheduling problem. Extensions to the model to admit overlap relationship of the activities also are presented.

• IE interfaces
• /
• v.18 no.4
• /
• pp.370-381
• /
• 2005

This study is concerned with seeking the optimal allocation(disposition) for maximizing utility of consolidating old fashioned and new air defense weapon system like SAM-X(Patriot missile) and developing efficient solution algorithm based on simulated annealing(SA) algorithm. The SED(selection by effectiveness degree) procedure is implemented with an enhanced SA algorithm in which neighboring solutions could be generated only within the optimal feasible region by using a specially designed PERTURB function. Computational results conducted on the problem sets with a variety of size and parameters shows the significant efficiency of our SED algorithm over existing methods in terms of both the computation time and the solution quality.

• Korean Management Science Review
• /
• v.27 no.2
• /
• pp.21-29
• /
• 2010

We consider an economic approach for spectrum operations in mobile networks. We present the investment function of base stations according to the number of FAs assuming the linearity of cell splitting. We show that there is an economic amount of spectrum which corresponds to the optimal number of FAs that minimizes the investment. We analyze the impact of the cost structure and the traffic distribution in base stations on the economic amount of spectrum. This paper is applicable to an economic spectrum operation for mobile operators. In addition, the national regulatory authority can use the economic amount of spectrum as the minimal amount for spectrum allocation.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.29 no.4
• /
• pp.61-72
• /
• 2004

In this paper, we design sampling inspections and service capacities simultaneously for multi-products. Particularly, we extend Kim(2003) by introducing the fixed cost of providing services. We show that, due to the fixed cost considered, the cost function of a product is no longer linear or convex in terms of the level of service provision, and the total inspection is prefered to the small level of service capacity which results in high burden of the fixed cost. And we develop a simple framework to deal with this joint design problem for a product. Also we consider the problem of allocating the given number of the total service capacities among products. A dynamic programming algorithm is developed to determine the optimal allocation which minimizes the overall total cost of the system and the optimal allocation can be obtained with the considerably smaller computations than the total number of possible allocations. The results can be used to support planning decisions and to aid the joint design of inspections and service capacities for products.

• Journal of Forest and Environmental Science
• /
• v.32 no.1
• /
• pp.55-67
• /
• 2016

This paper investigated policies that drive the sustainable management of Ivorian forest which disappear at an annual rate of 250000 hectares. Based on an inter-temporal model for optimum allocation of forest land to three competing uses, the article found that sustainability depends on the incentive structure, of which forest taxes and fees are a key, though obviously not the sole, component. The study proposed to increase the area fee level by accounting for environmental externalities generated by forest harvesters and farmers. The paper showed that the area fee is a decreasing function of the forest natural rate of regeneration and the reconversion rate of agricultural surfaces. Finally, at the given forest natural rate of regeneration and the reconversion rate of agricultural surfaces, the model argued that the area fee need to be progressive (arithmetic progression) in the context of ecological equilibrium break while it should remain constant in normal situation.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 1994.04a
• /
• pp.410-420
• /
• 1994

In many project-oriented production systems, e.g., shipyards or large-scale steel products manufacturing, resource loading by an activity is flexible, and the activity duration is a function of resource allocation. For example, if one doubles the size of the crew assigned to perform an activity, it may be feasible to complete the activity in half the duration. Such flexibility has been modeled by Weglarz [131 and by Leachman, Dincerler, and Kim [7] in extended formulations of the resource-constrained project scheduling problem. This paper presents a new algorithmic approach to the problem that combines the ideas proposed by the aforementioned authors. The method we propose involves a two-step approach: (1) solve the resource-constrained scheduling problem using a heuristic, and (2) using this schedule as an initial feasible solution, find improved resource allocations by solving a linear programming model. We provide computational results indicating the superiority of this approach to previous methodology for the resource-constrained scheduling problem. Extensions to the model to admit overlap relationships of the activities also are presented.