• Industrial Engineering and Management Systems
• /
• 제12권3호
• /
• pp.190-197
• /
• 2013

People are living longer than ever before. As a result, life expectancy is going up and the demand of long-term care facilities is increasing in most countries. The facilities provide rehabilitative, restorative, and skilled nursing care to patients or residents in need of assistance with activities of daily living. This study deals with the capacitated location and allocation problem of long-term care facilities in a city that consists of a finite number of regions. Assuming that in each region candidate locations for three types of facilities are already given, two integer programming models are developed under the closest assignment rule reflecting the demand characteristics of the facilities. Both the location and type of the facilities to be built become decision variables. To show the validity of the models, numerical problems are solved with commercial software, CPLEX. Also, sensitivity studies were conducted to identify relationships between the system parameters.

• 한국국방경영분석학회지
• /
• 제30권1호
• /
• pp.48-69
• /
• 2004

An optimal allocation model for SAM-X by using a set covering model is suggested. This allocation model considers to guarantee the maximum security of vital areas from the attack of enemy aircraft(s) and missiles. In order to formulate this model, we applied the concept of parallel structure reliability to set covering model. This model gives both direction of the primary target line and location of the facility. When applied this model to the real situation, the solution of this model can be used to the references of decision making for the optimal military facility allocation.

• 대한산업공학회지
• /
• 제10권2호
• /
• pp.45-50
• /
• 1984

This paper is concerned with the facility location-allocation problem (FLAP) with multiple objectives. A branch-and-bound procedure is presented to solve the mixed zero-one integer goal programming problem which is to determine facility locations from given candidate locations and to allocate facility capacity to given customer markets simultaneously. A numercial example is given to illustrate this procedure.

• 산업경영시스템학회지
• /
• 제21권48호
• /
• pp.1-14
• /
• 1998

This paper describes a study which was undertaken in Ulsan City. The modified SLP procedures consider the quantitative flow aspect of the facilities layout problem as well as the qualitative closeness rating aspect. Conclusions are drawn as to the effectiveness of the proposed model in providing Ulsan City with better means of making the facilities location allocation decision for Industrial Technology Research Park.

• 한국ITS학회 논문지
• /
• 제12권6호
• /
• pp.22-28
• /
• 2013

본 연구에서는 대전광역시를 대상으로 향후 카쉐어링 서비스를 제공할 경우를 가정하고 위치 선정방안을 제시하는 것을 목적으로 한다. 이를 위해 GIS Arc/Info 10 소프트웨어를 활용하여 대전광역시 전역을 $500m{\times}500m$ 크기의 셀로 구분하고 카쉐어링 서비스에 영향을 미칠 것으로 예상되는 요인들을 선정하고 각 요인들의 값을 표준화하는 과정을 거쳤다. AHP 기법을 도입하여 각 요인별 가중치를 전문가 설문을 통해 결정하고 모든 셀($500m{\times}500m$ 크기)별로 적합도 지수를 산정하였으며, 네트워크 분석(Network Analysis)모듈에 내장되어있는 입지배분모델(Location-allocation Model)을 이용하여 서비스 시설의 위치를 30개의 권역으로 선정하는 방안을 제시하였다. 본 연구에서 제안한 카쉐어링 서비스 위치선정을 위한 방안은 향후 카쉐어링 서비스가 도입될 때 기초 자료로 활용할 수 있을 것으로 기대되며, 향후 적정한 수요의 추정과 경제성 검토 등에 대한 추가연구가 필요할 것으로 판단된다.

• 디지털콘텐츠학회 논문지
• /
• 제3권2호
• /
• pp.221-233
• /
• 2002

본 논문에서는 용량제약이 있는 설비의 위치선정 및 수요자 할당 문제(Capacitated Facility Location-Allocation Problem)에 대한 정수계획 모형과 해법을 제시하였다. 이 문제는 설비를 설치할 수 있는 후보지의 집합과 각 후보지별로 설치 가능한 설비의 용량 및 설치비용, 수요를 만족시켜야 할 수요자의 집합 및 각 수요자와 설치 후보지 사이의 운반비용이 주어져 있을 때, 설비들의 설치비용과 수요의 운반비용의 합을 최소화하는 설비의 설치 위치 및 대수 그리고 수요자와 설비간의 연결상태를 구성하는 문제이다. 본 논문에서는 이 문제에 대한 두 가지 정수계획모형을 제시하고, 이 모형에 대한 최적해를 구하기 위한 다면체적 절단평면을 이용한 분지-절단해법(Branch-and-cut algorithm)과 열생성기법을 이용한 분지-평가해법(Branch-and-Price algorithm)을 제시하였다. 제시된 모형과 해법은 물류시스템의 설계 및 정보통신시스템의 통신설비 위치선정 등에 활용될 수 있다.

• International Journal of Control, Automation, and Systems
• /
• 제6권3호
• /
• pp.351-363
• /
• 2008

This paper is concerned with tasking and guidance of networked airborne sensors to achieve fault-tolerant sensing. The sensors are coordinated to locate hostile transmitters by intercepting and processing their signals. Faults occur when some sensor-carrying vehicles engaged in target location missions are lost. Faults effectively change the network architecture and therefore degrade the network performance. The first objective of the paper is to optimally allocate a finite number of sensors to targets to maximize the network life and availability. To that end allocation policies are solved from relevant Markov decision problems. The sensors allocated to a target must continue to adjust their trajectories until the estimate of the target location reaches a prescribed accuracy. The second objective of the paper is to establish a criterion for vehicle guidance for which fault-tolerant sensing is achieved by incorporating the knowledge of vehicle loss probability, and by allowing network reconfiguration in the event of loss of vehicles. Superior sensing performance in terms of location accuracy is demonstrated under the established criterion.

• 경영과학
• /
• 제27권1호
• /
• pp.75-90
• /
• 2010

In this paper, we proposed new solution procedure of the air defense missile allocation problem. In order to find the optimal location of missile, we formulated a simple mathematical model maximizing the kill probability of enemy air threat including aircraft and missile. To find the Kill probability, we developed a new procedure using actual experimental data in the mathematical model. Actual experimental data mean real characteristic factor, which was acquired when the missile had been developed through missile fire experiment. The result of this study can offer practical solution for missile allocation and the methodology in this study can be used to the decision making for the optimal military facility allocation.

• 한국경영과학회:학술대회논문집
• /
• 한국경영과학회 1997년도 추계학술대회발표논문집; 홍익대학교, 서울; 1 Nov. 1997
• /
• pp.201-204
• /
• 1997

This study is focussed on optimization problems which require allocating the restricted inventory to demand points and assignment of vehicles to routes in order to deliver goods for demand sites with optimal decision. This study investigated an integrated model using three step-by-step approach based on relationship that exists between the inventory allocation and vehicle routing with restricted amount of inventory and transportations. we developed several sub-models such as; first, an inventory-allocation model, second a vehicle-routing model based on clustering and a heuristic algorithms, and last a vehicle routing scheduling model, a TSP-solver, based on genetic algorithm. Also, for each sub-models we have developed computer programs and by a sample run it was known that the proposed model to be a very acceptable model for the inventory-allocation and vehicle routing problems.

• Journal of Power Electronics
• /
• 제19권5호
• /
• pp.1289-1302
• /
• 2019

In this paper, an optimal allocation method of a hybrid active power filter in an active distribution network is designed based on the differential evolution algorithm to resolve the harmonic generation problem when a distributed generation system is connected to the grid. A distributed generation system model in the calculation of power flow is established. An improved back/forward sweep algorithm and a decoupling algorithm are proposed for fundamental power flow and harmonic power flow. On this basis, a multi-objective optimization allocation model of the location and capacity of a hybrid filter in an active distribution network is built, and an optimal allocation scheme of the hybrid active power filter based on the differential evolution algorithm is proposed. To verify the effect of the harmonic suppression of the designed scheme, simulation analysis in an IEEE-33 nodes model and an experimental analysis on a test platform of a microgrid are adopted.