• 제목/요약/키워드: optimal deployment

검색결과 162건 처리시간 0.022초

다수의 개별시장 하에서 QFD의 기술속성의 최적 값을 결정하기 위한 동적 계획법 (Dynamic Programming Approach for Determining Optimal Levels of Technical Attributes in QFD under Multi-Segment Market)

  • 유재욱
    • 산업경영시스템학회지
    • /
    • 제38권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.

포대의 적정배치 방안 (On an Optimal Artillery Deployment Plan)

  • 윤상윤;김성식
    • 한국국방경영분석학회지
    • /
    • 제8권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.

  • PDF

클라우드에서 서비스 지향 응용을 위한 최적 서비스 배치와 우선순위 결정 기법 (Service Deployment and Priority Optimization for Multiple Service-Oriented Applications in the Cloud)

  • 김길환;금창섭;배현주
    • 한국IT서비스학회지
    • /
    • 제13권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.

전개성능을 고려한 대형 전개형 SAR 안테나의 회전스프링 힌지의 강성 최적설계 (Optimal Design of Stiffness of Torsion Spring Hinge Considering the Deployment Performance of Large Scale SAR Antenna)

  • 김동연;임재혁;장태성;차원호;이소정;오현웅;김경원
    • 항공우주시스템공학회지
    • /
    • 제13권3호
    • /
    • pp.78-86
    • /
    • 2019
  • 본 연구에서는 전개성능을 고려한 대형 전개형 SAR 안테나의 회전스프링 힌지의 강성 최적설계에 대해 기술한다. 대형 전개형 SAR 안테나는 발사환경에서는 접혀 있다가 궤도에서 임무를 수행할 때 펼치게 된다. 이러한 조건에서 여러 장으로 구성된 안테나 패널을 주어진 시간 내에 최소의 충격으로 전개할 수 있도록 회전스프링 힌지의 적절한 강성을 찾는 것은 매우 중요하다. 회전스프링 강성이 강하면 완전 전개시점에서 발생하는 큰 충격하중이 구조체에 손상을 주며, 약하면 전개 저항으로 인해 완전전개를 보장할 수 없기 때문이다. 이러한 문제를 해결하기 위해서 RecurDyn을 이용한 다물체동역학 해석모델을 생성하였으며 전개해석을 통해 전개성능(전개시간 전개충격하중)을 도출하였다 최적의 회전스프링 강성을 찾기 위해 이에 따른 전개성능을 반응표면법을 통해 근사화 시켰으며 최적설계를 수행하여 적절한 회전스프링의 강성 값을 도출하였다.

미사일 방어를 위한 방공포대 최적 배치 문제 (The Optimal Deployment Problem of Air Defense Artillery for Missile Defense)

  • 김재권;설현주
    • 산업경영시스템학회지
    • /
    • 제39권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.

Fog Computing 환경에서의 최적화된 컨테이너 배포 정책 (An Optimal Container Deployment Policy in Fog Computing Environments)

  • 진성근;전인걸
    • 한국산업정보학회논문지
    • /
    • 제26권3호
    • /
    • pp.1-7
    • /
    • 2021
  • Fog Computing (FC) 호스트의 새로운 요청 도착에 대처하기 위해 적절한 컨테이너가 배포된다. 이 경우 두 가지 시나리오를 고려할 수 있다. (1) 컨테이너 배포를 위한 충분한 자원이 준비될 때까지 요청이 대기열에 추가될 수 있다. (2) FC 호스트는 자원이 제한되거나 부족하여 새 컨테이너 배포를 수용할 수 없는 경우 도착한 서비스 요청을 근처 FC 호스트로 전송할 수 있다. 여기서, 더 많은 인접 FC 호스트를 사용할수록 각 FC 호스트의 컨테이너 배포 시간이 더 짧아 진다. 반면, FC 호스트 수가 증가할수록 더 많은 FC 호스트를 거쳐가야 하므로 서비스 요청이 전달되는데 더 긴 시간이 걸릴 수 있다. 이러한 이유로 활용되는 FC 호스트의 수에 따라 컨테이너 배포 시간에 따른 트레이드오프 관계가 성립한다. 결과적으로, 우리는 최적의 인접 FC 호스트 수를 사용하기 위해 트레이드오프 관계를 분석한다.

A Genetic Algorithm for Solving a QFD(Quality Function Deployment) Optimization Problem

  • Yoo, Jaewook
    • International Journal of Contents
    • /
    • 제16권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.

Out of Kilter법을 이용한 동원병력 최적할당에 관한 연구 (Optimal Allocation of Mobilization Designee by Out of Kilter Method)

  • 안대희;김충영
    • 한국국방경영분석학회지
    • /
    • 제17권2호
    • /
    • pp.54-71
    • /
    • 1991
  • It is very important to increase defence capability rapidly against any surprise attack. This can be done by fast deployment of mobilization reserved resources. This paper is forcused on optimal allocation of special reserved resources. First of all, the location of special reserved resources is identified and then the location of combat and mobilization units and amount of requirement resources of each unit are identified. Finally, optimal allocation of the special reserved resources is obtained by Out of Kilter method.

  • PDF

Service Deployment Strategy for Customer Experience and Cost Optimization under Hybrid Network Computing Environment

  • Ning Wang;Huiqing Wang;Xiaoting Wang
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • 제17권11호
    • /
    • pp.3030-3049
    • /
    • 2023
  • With the development and wide application of hybrid network computing modes like cloud computing, edge computing and fog computing, the customer service requests and the collaborative optimization of various computing resources face huge challenges. Considering the characteristics of network environment resources, the optimized deployment of service resources is a feasible solution. So, in this paper, the optimal goals for deploying service resources are customer experience and service cost. The focus is on the system impact of deploying services on load, fault tolerance, service cost, and quality of service (QoS). Therefore, the alternate node filtering algorithm (ANF) and the adjustment factor of cost matrix are proposed in this paper to enhance the system service performance without changing the minimum total service cost, and corresponding theoretical proof has been provided. In addition, for improving the fault tolerance of system, the alternate node preference factor and algorithm (ANP) are presented, which can effectively reduce the probability of data copy loss, based on which an improved cost-efficient replica deployment strategy named ICERD is given. Finally, by simulating the random occurrence of cloud node failures in the experiments and comparing the ICERD strategy with representative strategies, it has been validated that the ICERD strategy proposed in this paper not only effectively reduces customer access latency, meets customers' QoS requests, and improves system service quality, but also maintains the load balancing of the entire system, reduces service cost, enhances system fault tolerance, which further confirm the effectiveness and reliability of the ICERD strategy.

소형 무인기 탐지를 위한 패시브 레이더망 최적 배치 연구 (Study on the Optimal Deployment of the Passive Radar System for Detecting Small Unmanned Aerial Vehicles)

  • 백인선;이태식
    • 한국군사과학기술학회지
    • /
    • 제19권4호
    • /
    • pp.443-452
    • /
    • 2016
  • Current low-altitude radar system often fails to detect small unmanned aerial vehicles (UAV) because of their small radar cross section (RCS) compared with larger targets. As a potential alternative, a passive bistatic radar system has been considered. We study an optimal deployment problem for the passive bistatic radar system. We model this problem as a covering problem, and develop an integer programming model. The objective of the model is to maximize coverage of a passive bistatic radar system. Our model takes into account factors specific to a bistatic radar system, including bistatic RCS and transmitter-receiver pair coverage. Considering bistatic RCS instead of constant RCS is important because the slight difference of RCS value for small UAVs could significantly influence the detection probability. The paired radar coverage is defined by using the concept of gradual coverage and cooperative coverage to represent a realistic environment.