• Title/Summary/Keyword: Optimal Requirement

Search Result 431, Processing Time 0.025 seconds

Combat Effectiveness Based Analysis Methodology for Optimal Requirement of Attack Helicopter Using Simulation (시뮬레이션을 이용한 전투효과기반 공격헬기 소요 분석방안)

  • Jung, Chi-Young;Lee, Jae-Yeong
    • Journal of the Korea Institute of Military Science and Technology
    • /
    • v.13 no.6
    • /
    • pp.1099-1105
    • /
    • 2010
  • The purpose of this paper is to propose a methodology that can estimate optimal requirement of attack helicopter Korea army will be operating in future. For estimating optimal requirement, attack helicopter's operation concept, performance, battlefield environment and enemy threat are considered. We use a wargame model, AAsim(Army Aviation simulation), as a analytic simulation model which is used to analyze DOTMLPF and operation in army aviation field. In this paper, we conduct battle experiment for anti armored corps operation which reflects attack helicopter's combat effectiveness very well. As a result of simulation, the destructive rate for enemy armored corps per each attack helicopter can be calculated. In this paper, we propose optimal requirement of attack helicopter using that destructive rate for enemy armored corps.

A Strong LP Formulation for the Ring Loading Problem with Integer Demand Splitting

  • Lee, Kyung-Sik;Park, Sung-Soo
    • Proceedings of the Korean Operations and Management Science Society Conference
    • /
    • 2004.05a
    • /
    • pp.306-310
    • /
    • 2004
  • In this paper, we consider the Ring Loading Problem with integer demand splitting (RLP). The problem is given with a ring network, in which a required traffic requirement between each selected node pair must be routed on it. Each traffic requirement can be routed in both directions on the ring network while splitting each traffic requirement in two directions only by integer is allowed. The problem is to find an optimal routing of each traffic requirement which minimizes the capacity requirement. Here, the capacity requirement is defined as the maximum of traffic loads imposed on each link on the network. We formulate the problem as an integer program. By characterizing every extreme point solution to the LP relaxation of the formulation, we show that the optimal objective value of the LP relaxation is equal to p or p+0.5, where p is a nonnegative integer. We also show that the difference between the optimal objective value of RLP and that of the LP relaxation is at most 1. Therefore, we can verify that the optimal objective value of RLP is p+1 if that of the LP relaxation is p+0.5. On the other hand, we present a strengthened LP with size polynomially bounded by the input size, which provides enough information to determine if the optimal objective value of RLP is p or p+1.

  • PDF

Study on Reserve Requirement for Wind Power Penetration based on the Cost/Reliability Analysis

  • Shin, Je-Seok;Kim, Jin-O;Bae, In-Su
    • Journal of Electrical Engineering and Technology
    • /
    • v.12 no.4
    • /
    • pp.1397-1405
    • /
    • 2017
  • As the introduction of wind power is steadily increasing, negative effects of wind power become more important. To operate a power system more reliable, the system operator needs to recognize the maximum required capacity of available generators for a certain period. For recognizing the maximum capacity, this paper proposes a methodology to determine an optimal reserve requirement considering wind power, for the certain period in the mid-term perspective. As wind speed is predicted earlier, the difference of the forecasted and the actual wind speed becomes greater. All possible forecast errors should be considered in determining optimal reserve, and they are represented explicitly by the proposed matrix form in this paper. In addition, impacts of the generator failure are also analyzed using the matrix form. Through three main stages which are the scheduling, contingency and evaluation stages, costs associated with power generation, reserve procurement and the usage, and the reliability cost are calculated. The optimal reserve requirement is determined so as to minimize the sum of these costs based on the cost/reliability analysis. In case study, it is performed to analyze the impact of wind power penetration on the reserve requirement, and how major factors affect it.

Cross Layer Optimal Design with Guaranteed Reliability under Rayleigh block fading channels

  • Chen, Xue;Hu, Yanling;Liu, Anfeng;Chen, Zhigang
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.7 no.12
    • /
    • pp.3071-3095
    • /
    • 2013
  • Configuring optimization of wireless sensor networks, which can improve the network performance such as utilization efficiency and network lifetime with minimal energy, has received considerable attention in recent years. In this paper, a cross layer optimal approach is proposed for multi-source linear network and grid network under Rayleigh block-fading channels, which not only achieves an optimal utility but also guarantees the end-to-end reliability. Specifically, in this paper, we first strictly present the optimization method for optimal nodal number $N^*$, nodal placement $d^*$ and nodal transmission structure $p^*$ under constraints of minimum total energy consumption and minimum unit data transmitting energy consumption. Then, based on the facts that nodal energy consumption is higher for those nodes near the sink and those nodes far from the sink may have remaining energy, a cross layer optimal design is proposed to achieve balanced network energy consumption. The design adopts lower reliability requirement and shorter transmission distance for nodes near the sink, and adopts higher reliability requirement and farther transmission distance for nodes far from the sink, the solvability conditions is given as well. In the end, both the theoretical analysis and experimental results for performance evaluation show that the optimal design indeed can improve the network lifetime by 20-50%, network utility by 20% and guarantee desire level of reliability.

Optimal Provisioning Quantity Determination of Concurrent Spare Part under the Funds Limitation (자금 제약하에서의 동시조달부품의 최적 구매량 결정)

  • 오근태
    • Journal of Korean Society of Industrial and Systems Engineering
    • /
    • v.20 no.41
    • /
    • pp.123-134
    • /
    • 1997
  • In this paper we consider the CSP requirements determination problem of new equipment system. The CSP we deal with in the paper are restricted to the demand-based spare parts. For the newly procured equipment systems, mathematical analyses are made for the system which is constructed with the repairable items to derive the associated CSP requirement determination model in mathematical expression, respectively. Based on these analyses, a mathematical model is derived for making an optimal CSP requirement determination subject to the constraint of satisfying any given funds limitation. We assume that the failure of a part follows a Poisson process. Firstly, the operational availability concept in CSP is defined and the relation between the general system availability and the operational availability is established. Secondly, the problem is formulated as the operational availability maximization problem that should satisfy the funds limitation, and then, using the generalized Lagrange multipliers method, the optimal solution procedure is derived.

  • PDF

An Efficient Algorithm for a Block Angular Linear Program with the Same Blocks (부분문제가 같은 블록대각형 선형계획문제의 효율적인 방볍)

  • 양병학;박순달
    • Journal of the Korean Operations Research and Management Science Society
    • /
    • v.12 no.2
    • /
    • pp.42-50
    • /
    • 1987
  • This objective of this paper is to develop an efficient method with small memory requirement for a feed-mixing problem on a micro computer. First this method uses the decomposition principle to reduce the memory requirement. Next, the decomposition principle is modified to fit the problem. Further four different variations in solving subproblems are designed in order to improve efficiency of the principle. According to the test with respect to the processing time, the best variation is such that the dual simplex method is used, and the optimal basis of a previous subproblem is used as an initial basis, and the master problem is (M +1) dimensional. In general, the convergence of solution becomes slower near the optimal value. This paper introduces a termination criterion for a sufficiently good solution. According to the test, 5%-tolerence is acceptable with respect to the relation between the processing time and optimal value.

  • PDF

Optimal Provisioning Quantity Determination of Consumable Concurrent Spare Part under the Availability Limitation (운용가용도 제약하에서의 소모성 동시조달부품의 최적구매량 결정)

  • 오근태;김명수
    • Journal of Korean Society of Industrial and Systems Engineering
    • /
    • v.21 no.48
    • /
    • pp.113-122
    • /
    • 1998
  • In this paper we consider the CSP requirements determination problem of new equipment(machine) system. For the newly procured equipment systems, mathematical analyses are made for the system which is constructed with the consumable parts to derive the associated CSP requirement determination model in mathematical expression. Based on these analyses, a mathematical model is derived for making an optimal CSP requirement determination subject to tile constraint of satisfying any given operational availability limitation. We assume that the failure of a part follows a Poisson process. Firstly, the operational availability concept in CSP is defined and the relation between the general system availability and the operational availability is established. Secondly, the problem is formulated as the cost minimization problem that should satisfy the operational availability limitation, and then, using the generalized Lagrange multipliers method, the optimal solution procedure is derived.

  • PDF

Optimal Provisioning Quantity Determination of Concurrent Spare Parts including Consumable Items and Repairable Items under the Availability Limitation (운용가용도 제약하에서 소모성부품과 수리순환부품이 혼재된 동시조달부품의 최적구매량 결정)

  • 오근태;김명수
    • Journal of Korean Society of Industrial and Systems Engineering
    • /
    • v.23 no.59
    • /
    • pp.53-67
    • /
    • 2000
  • In this paper we consider the CSP requirements determination problem of new equipment(machine) system. For the newly procured equipment systems, mathematical analyses are made for the system which is constructed with the consumable parts and the repairable parts to derive the associated CSP requirement determination model in mathematical expression. Based on these analyses, a mathematical model Is derived for making an optimal CSP requirement determination subject to the constraint of satisfying any given operational availability limitation. We assume that the failure of a part follows a Poisson process and the repair time has an exponential distribution. Firstly, the operational availability concept in CSP is defined and the relation between the general system availability and the operational availability is established. Secondly, the problem is formulated as the cost minimization problem that should satisfy the operational availability limitation, and then, using the generalized Lagrange multipliers method, the optimal solution procedure Is derived.

  • PDF

An Algorithm for Determining Consumable Spare Parts Requirement under Avialability Constraint (운용가용도 제약하에서의 소모성 예비부품의 구매량 결정을 위한 해법)

  • 오근태;나윤군
    • Journal of the Korea Society for Simulation
    • /
    • v.10 no.3
    • /
    • pp.83-94
    • /
    • 2001
  • In this paper, the consumable spare parts requirement determination problem of newly procured equipment systems is considered. The problem is formulated as the cost minimization problem with operational availability constraint. Assuming part failure rate is constant during operational period, an analytical method is developed to obtain spare part requirements. Since this solution tends to overestimate the requirements, a fast search simulation procedure is introduced to adjust it to the realistic solution. The analytical solution procedure and the simulation procedure are performed recursively until a near optimal solution is achieved. The experimental results show that the near optimal solution is approached in a fairly short amount of time.

  • PDF

Optimal Reservoir Operation Models for Paddy Rice Irrigation with Weather Forecasts (II) -Model Development- (기상예보를 고려한 관개용 저수지의 최적 조작 모형(II) -모형의 구성-)

  • 김병진;박승우
    • Magazine of the Korean Society of Agricultural Engineers
    • /
    • v.36 no.2
    • /
    • pp.44-55
    • /
    • 1994
  • This paper describes the development of real-time irrigation reservoir operation models that adequately allocate available water resources for paddy rice irrigation. Water requirement deficiency index(WRDI) was proposed as a guide to evaluate the operational performance of release schemes by comparing accumulated differences between daily release requirements for irrigated areas and actual release amounts. Seven reservoir release rules were developed, which are constant release rate method (CRR), mean storage curve method(MSC), frequency analysis method of reservoir storage rate(FAS), storage requirement curve method(SRC), constant optimal storage rate method (COS), ten-day optimal storage rate method(TOS), and release optimization method(ROM). Long-term forecasting reservoir operation model(LFROM) was formulated to find an optimal release scheme which minimizes WRDIs with long-term weather generation. Rainfall sequences, rainfall amount, and evaporation amount throughout the growing season were to be forecasted and the results used as an input for the model. And short-term forecasting reservoir operation model(SFROM) was developed to find an optimal release scheme which minimizes WRDIs with short-term weather forecasts. The model uses rainfall sequences forecasted by the weather service, and uses rainfall and evaporation amounts generated according to rainfall sequences.

  • PDF