• 한국콘텐츠학회논문지
• /
• 제20권7호
• /
• pp.161-168
• /
• 2020

자치분권은 국가와 지방자치단체의 권한과 책임을 적절하게 배분하는 것이지만 단순한 행정사무 및 재원이양에 그치는 것이 아니다. 본 논문은 행정사무 지방이양의 과제를 살펴보기 위해 우선, 관련 선행연구를 고찰하였다. 다음으로 공무원들을 대상으로 기능이양 정도의 평가와 이양방향 등을 살펴보았다. 마지막으로 기능이양을 위한 과제를 도출하였다. 기능이나 사무이양 활성화를 위해서는 대통령의 확고한 의지와 지속적인 지원, 중앙정부와 지방정부간의 기능이양을 위한 역할분담 노력, 지방의 책임성 증대, 시민참여의 활성화와 민주주의의 정착이 필요하다. 또한 기능이양문제를 확대하기 위해서는 사무배분체계를 새롭게 새워야한다. 이러한 체계의 논의는 재정이양과 더불어 지역형평성 문제도 고려해야 할 것이다. 기능이양을 통한 지방분권을 위해서는 무엇보다도 관련 집단의 인식전환이 필요하다. 기존의 연구에서 그리고 우리나라의 경험에서 살펴 볼 수 있듯이 지방분권은 장기적인 시간이 요구되고 중앙 뿐 아니라 관련 이해관계자들의 참여와 협조가 중요하다.

• 한국시뮬레이션학회논문지
• /
• 제28권1호
• /
• pp.67-79
• /
• 2019

다기능레이더(MFR)를 장착한 함정의 작전수행은 적의 위협에 대한 징후를 바탕으로 위협의 정도를 판단하고 이를 바탕으로 MFR 자원을 위협별로 할당하는 것으로 작전을 시작한다. 본 연구는 MFR 탐지체계를 가진 함정의 임무 시작 시 필요한 위협별 MFR 자원할당 문제에 대하여 시뮬레이션을 이용한 기법과 Greedy 기법을 이용한 MFR 자원할당 방안을 제시하여 그 결과를 비교분석하였다. 분석시 자원할당에 따른 탐지확률 함수가 선형인 경우와 지수형인 경우를 고려하여 실험을 수행하였다. 실험 결과 시뮬레이션 기법과 Greedy기법의 결과는 서로 비슷한 자원할당 결과를 보여주고 있으며, Greedy 기법은 시뮬레이션 기법에 비하여 그 수행시간이 아주 짧아 실제 임무 수행 시에 이용 가능한 기법으로 판단된다. 여러 가지 위협의 정도에 대해 Greedy 기법을 이용하여 MFR 자원할당 결과를 분석하였다.

• 제어로봇시스템학회논문지
• /
• 제20권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.

• 한국경영과학회:학술대회논문집
• /
• 한국경영과학회/대한산업공학회 2005년도 춘계공동학술대회 발표논문
• /
• 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.

• 한국경영과학회지
• /
• 제19권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.

• 산업공학
• /
• 제18권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.

• 경영과학
• /
• 제27권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.

• 한국경영과학회지
• /
• 제29권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
• /
• 제32권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.

• 한국경영과학회:학술대회논문집
• /
• 대한산업공학회/한국경영과학회 1994년도 춘계공동학술대회논문집; 창원대학교; 08월 09일 Apr. 1994
• /
• 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.