• Ocean and Polar Research
• /
• v.37 no.3
• /
• pp.179-188
• /
• 2015

This study was carried out to determine the optimal number of ARGO floats in the East Sea in order to maximize their applications. The dominant spatio-temporal scale, size of the domain, and the typical float lifetimes in the East Sea were taken into consideration. The mean spatial de-correlation scale of temperature on isobaric surfaces reaches about 60 km. The minimum necessary number of floats is about 82 on average in order to secure independent ARGO profiles with the de-correlation scale. Considering the float lifetimes, about 27 floats per year should be deployed to maintain the 82 ARGO float array every year. To obtain spatially uniform distribution of ARGO float data, mean residence time and dispersion rate (basin area/residence time) of ARGO floats were evaluated in each basin of the East Sea. A faster (slower) dispersion rate requires more (less) ARGO floats to maintain the spatially uniform number of floats. According to the analysis, it is likely that the optimal ratio of the number of floats for each basin is 1:2:4 corresponding to Ulleung Basin:Yamato Basin:Japan Basin. In order to maintain relatively uniform ARGO observing networks, it is necessary to establish a long-term plan for deployment strategy based on float pathways and the dispersion rate parameters estimated by using currently active ARGO float trajectory data as well as reanalysis data.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.6 no.1
• /
• pp.75-82
• /
• 1981

This paper considers urban emergency service systems that dispatch vehicles (facilities) from fixed bases with the objective of finding an optimum allocation of emergency facilities. A case study of fire station problem of Seoul city is conducted to analyze the deployment of fire-fighting resources and develop a class of improved deployment strategies with Parameteric Allocation Model (P.A.M.). The study shows a long term plan leading to balanced fire protection for most fire hazardous districts as well as low alarm districts.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.38 no.2
• /
• pp.120-128
• /
• 2015

Quality function deployment (QFD) is a useful method in product design and development to maximize customer satisfaction. In the QFD, the technical attributes (TAs) affecting the product performance are identified, and product performance is improved to optimize customer requirements (CRs). For product development, determining the optimal levels of TAs is crucial during QFD optimization. Many optimization methods have been proposed to obtain the optimal levels of TAs in QFD. In these studies, the levels of TAs are assumed to be continuous while they are often taken as discrete in real world application. Another assumption in QFD optimization is that the requirements of the heterogeneous customers can be generalized and hence only one house of quality (HoQ) is used to connect with CRs. However, customers often have various requirements and preferences on a product. Therefore, a product market can be partitioned into several market segments, each of which contains a number of customers with homogeneous preferences. To overcome these problems, this paper proposes an optimization approach to find the optimal set of TAs under multi-segment market. Dynamic Programming (DP) methodology is developed to maximize the overall customer satisfaction for the market considering the weights of importance of different segments. Finally, a case study is provided for illustrating the proposed optimization approach.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.47 no.3
• /
• pp.75-85
• /
• 2024

Airpower is a crucial force for suppressing military threats and achieving victory in wars. This study evaluates newly introduced fighter forces, considering factors such as fighter performance and power index, operational environment, capacity of each airbase, survivability, and force sustainment capability to determine the optimal deployment plan that maximizes operational effectiveness and efficiency. Research methods include optimization techniques such as MIP(mixed integer programming), allocation problems, and experimental design. This optimal allocation mathematical model is constructed based on various constraints such as survivability, mission criticality, and aircraft's performance data. The scope of the study focuses the fighter force and their operational radius is limited to major Air Force and joint operations, such as air interdiction, defensive counter-air operations, close air support, maritime operations and so on. This study aims to maximize the operational efficiency and effectiveness of fighter aircraft operations. The results of proposed model through experiments showed that it was for superior to the existing deployment plan in terms of operation and sustainment aspects when considering both wartime and peacetime.

• Journal of the military operations research society of Korea
• /
• v.8 no.2
• /
• pp.17-30
• /
• 1982

This paper offers an optimal artillery deployment scheme for the defending unit when two forces are confronted at a military front line. When proposed gun sites, types and number of guns as well as targets are given, the solutions of the two models in this paper direct each (unit of) guns to a certain location. The aim of the models is to maximize the number of guns which can hit important targets. Unlike widely used target assignment models, these models are formulated using the set covering problem concept. These models do not contain probabilities and time. Thus they are simple as models, easy in implementation, and yield tractable solutions. The dynamic and probabilistic feature of battle situations is implicitly reflected on the models. The first model is for the case that enemies' approaching route is clearly predictable, while the second model is for the unpredictable approaching route case.

• Journal of Information Technology Services
• /
• v.13 no.3
• /
• pp.201-219
• /
• 2014

This paper considers service deployment and priority optimization for multiple service-oriented applications sharing reusable services, which are deployed as multiple instances in the cloud. In order to handle variations in the workloads of the multiple applications, service instances of the individual reusable services are dynamically provisioned in the cloud. Also service priorities for each application in a particular reusable service are dynamically adjusted. In this paper, we propose an analytic performance model, based on a queueing network model, to predict the expected sojourn times of multiple service-oriented applications, given the number of service instances and priority disciplines in individual reusable services. We also propose a simple heuristic algorithm to search an optimal number of service instances in the cloud and service priority disciplines for each application in individual reusable services. A numerical example is also presented to demonstrate the applicability of the proposed performance model and algorithm to the proposed optimal decision problem.

• Journal of Aerospace System Engineering
• /
• v.13 no.3
• /
• pp.78-86
• /
• 2019

This paper describes the stiffness optimization of the torsion spring hinge of the large SAR antenna considering the deployment performance. A large SAR antenna is folded in a launch environment and then unfolded when performing a mission in orbit. Under these conditions, it is very important to find the proper stiffness of the torsion spring hinge so that the antenna panels can be deployed with minimal impact in a given time. If the torsion spring stiffness is high, a large impact load at the time of full deployment damages the structure. If it is weak, it cannot guarantee full deployment due to the deployment resistance. A multi-body dynamics analysis model was developed to solve this problem using RecurDyn and the development performance were predicted in terms of: development time, latching force, and torque margin through deployment analysis. In order to find the optimum torsion spring stiffness, the deployment performance was approximated by the response surface method (RSM) and the optimal design was performed to derive the appropriate stiffness value of the rotating springs.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.39 no.1
• /
• pp.98-104
• /
• 2016

With the development of modern science and technology, weapon systems such as tanks, submarines, combat planes, radar are also dramatically advanced. Among these weapon systems, the ballistic missile, one of the asymmetric forces, could be considered as a very economical means to attack the core facilities of the other country in order to achieve the strategic goals of the country during the war. Because of the current ballistic missile threat from the North Korea, establishing a missile defense (MD) system becomes one of the major national defense issues. This study focused on the optimization of air defense artillery units' deployment for effective ballistic missile defense. To optimize the deployment of the units, firstly this study examined the possibility of defense, according to the presence of orbital coordinates of ballistic missiles in the limited defense range of air defense artillery units. This constraint on the defense range is originated from the characteristics of anti-ballistic missiles (ABMs) such as PATRIOT. Secondly, this study proposed the optimized mathematical model considering the total covering problem of binary integer programming, as an optimal deployment of air defense artillery units for defending every core defense facility with the least number of such units. Finally, numerical experiments were conducted to show how the suggested approach works. Assuming the current state of the Korean peninsula, the study arbitrarily set ballistic missile bases of the North Korea and core defense facilities of the South Korea. Under these conditions, numerical experiments were executed by utilizing MATLAB R2010a of the MathWorks, Inc.

• Journal of Korea Society of Industrial Information Systems
• /
• v.26 no.3
• /
• pp.1-7
• /
• 2021

Appropriate containers are deployed to cope with new request arrivals at Fog Computing (FC) hosts. In the case, we can consider two scenarios: (1) the requests may be queued until sufficient resources are prepared for the container deployments; (2) FC hosts may transfer arrived service requests to nearby FC hosts when they cannot accommodate new container deployments due to their limited or insufficient resources. Herein, for more employed neighboring FC hosts, arrived service requests may experience shorter waiting time in container deployment queue of each FC host. In contrast, they may take longer transfer time to pass through increased number of FC hosts. For this reason, there exists a trade-off relationship in the container deployment time depending on the number of employed FC hosts accommodating service request arrivals. Consequently, we numerically analyze the trade-off relationship to employ optimal number of neighboring FC hosts.

• International Journal of Contents
• /
• v.16 no.4
• /
• pp.26-38
• /
• 2020

Determining the optimal levels of the technical attributes (TAs) of a product to achieve a high level of customer satisfaction is the main activity in the planning process for quality function deployment (QFD). In real applications, the number of customer requirements for developing a single product is quite large, and the number of converted TAs is also high so the size of the house of quality (HoQ) becomes huge. Furthermore, the TA levels are often discrete instead of continuous and the product market can be divided into several market segments corresponding to the number of HoQ, which also unacceptably increases the size of the QFD optimization problem and the time spent on making decisions. This paper proposed a genetic algorithm (GA) solution approach to finding the optimum set of TAs in QFD in the above situation. A numerical example is provided for illustrating the proposed approach. To assess the computational performance of the GA, tests were performed on problems of various sizes using a fractional factorial design.