• 제목/요약/키워드: Optimal allocation method

검색결과 286건 처리시간 0.033초

층화확률화 응답기법에 대한 동적 최적배분 (An Dynamic Optimal Allocation for the Stratified Randomized Response Technique)

  • 손창균;홍기학;이기성
    • Communications for Statistical Applications and Methods
    • /
    • 제16권4호
    • /
    • pp.595-603
    • /
    • 2009
  • 통상적으로 표준적인 최적배분은 층별 조사비용을 고려하여 표본을 배분한다. 만일 조사단위당 비용이 서로 다를 경우 보다 현실적인 배분방법을 고려할 필요가 있다. 즉, 개별 조사단위의 특성에 따라 이익비용비를 최대로 하는 단위를 먼저 표본으로 고려하는 동적배분을 고려하였다. 이러한 관점에서 층별 표본수를 배분하고, 배분된 표본규모에 따라 임의로 표본을 선정하는 방식인 표준적인 최적배분과는 차이가 있다. 이 논문은 약물오용, 낙태, 알콜중독 등과 같은 민감한 특성을 조사하는 층화확률화 응답기법에 대해 각 층별로 표본을 배분할 경우 최적 동적배분을 고려하여 보다 현실적인 문제를 해결하고자 하였으며, 수치적 예제를 통해 동적배분 방법의 효과성을 증명하였다.

Optimal Allocation Method of Hybrid Active Power Filters in Active Distribution Networks Based on Differential Evolution Algorithm

  • Chen, Yougen;Chen, Weiwei;Yang, Renli;Li, Zhiyong
    • 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.

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

Optimal Thrust Allocation for Dynamic Positioning of Deep-sea Working Vessel

  • Zhao, Luman;Roh, Myung-Il;Hong, Jeong-Woo
    • Journal of Advanced Research in Ocean Engineering
    • /
    • 제1권2호
    • /
    • pp.94-105
    • /
    • 2015
  • In this study, a thruster allocation method of a deep-sea working vessel was proposed with the aims of producing the demanded generalized forces and moment for dynamic positioning while at the same time minimizing total power. For this, an optimization problem for thrust allocation was mathematically formulated with design variables, objective function, and constraints. The genetic algorithms (GA) was used to solve the formulated problem. The proposed method was applied to an example of finding optimal thrust allocation of the deep-sea working vessel having 5 thrusters. The result showed that the method could be used to determine better strategy for thruster allocation of the vessel as compared to existing study.

Power Allocation Method of Downlink Non-orthogonal Multiple Access System Based on α Fair Utility Function

  • Li, Jianpo;Wang, Qiwei
    • Journal of Information Processing Systems
    • /
    • 제17권2호
    • /
    • pp.306-317
    • /
    • 2021
  • The unbalance between system ergodic sum rate and high fairness is one of the key issues affecting the performance of non-orthogonal multiple access (NOMA) system. To solve the problem, this paper proposes a power allocation algorithm to realize the ergodic sum rate maximization of NOMA system. The scheme is mainly achieved by the construction algorithm of fair model based on α fair utility function and the optimal solution algorithm based on the interior point method of penalty function. Aiming at the construction of fair model, the fair target is added to the traditional power allocation model to set the reasonable target function. Simultaneously, the problem of ergodic sum rate and fairness in power allocation is weighed by adjusting the value of α. Aiming at the optimal solution algorithm, the interior point method of penalty function is used to transform the fair objective function with unequal constraints into the unconstrained problem in the feasible domain. Then the optimal solution of the original constrained optimization problem is gradually approximated within the feasible domain. The simulation results show that, compared with NOMA and time division multiple address (TDMA) schemes, the proposed method has larger ergodic sum rate and lower Fairness Index (FI) values.

층별 응답률을 사용한 멱배정 방법의 확장 (Expansion of power allocation using response rate per stratum)

  • 박현아
    • 응용통계연구
    • /
    • 제34권5호
    • /
    • pp.671-683
    • /
    • 2021
  • 멱배정의 전체 효율은 최적배정보다 감소하지만, 층별 표본을 골고루 배정하는 기법이며 조사 현장에서는 제곱근 비례배정으로 많이 사용된다. 그리고 실제조사에서는 무응답을 고려하여 이론적 공식에서 나오는 것보다 더 많은 표본크기를 추출한다. 본 연구에서는 층별 표본크기를 결정함에 있어서 멱배정 방법에 층별 응답률의 정보를 추가하여 배정하는 기법을 연구한다. 제안된 배정기법들을 비례,최적,제곱근 비례 배정과 비교하며 응답률이 추가된 비례, 최적배정과도 비교하는 것을 모의실험을 통해 살펴봄으로써 배정방법들의 장단점을 살펴본다.

A Computationally Efficient Optimal Allocation Algorithms for Large Data

  • Kwon, Il-Hyung;Kim, Ju-Sung
    • Journal of the Korean Data and Information Science Society
    • /
    • 제18권2호
    • /
    • pp.561-572
    • /
    • 2007
  • In this paper, we describe various efficient optimization algorithms for obtaining an optimal customer allocation in the telephone call center. The main advantages of the proposed algorithms are simple, fast and very attractive for massive dataset. The proposed algorithms also provide comparable performance with the other more sophisticated linear programming methods. The proposed optimal allocation algorithms increase the customer contact, response rate and management product and optimize the performance of call centers. Simulation results are given to demonstrate the effectiveness of our algorithms.

  • PDF

Fuzzy Techniques in Optimal Bit Allocation

  • Kong, Seong-Gon
    • 한국지능시스템학회:학술대회논문집
    • /
    • 한국퍼지및지능시스템학회 1993년도 Fifth International Fuzzy Systems Association World Congress 93
    • /
    • pp.1313-1316
    • /
    • 1993
  • This paper presents a fuzzy system that estimates the optimal bit allocation matrices for the spatially active subimage classes of adaptive transform image coding in noisy channels. Transform image coding is good for image data compression but it requires a transmission error protection scheme to maintain the performance since the channel noise degrades its performance. The fuzzy system provides a simple way of estimating the bit allocation matrices from the optimal bit map computed by the method of minimizing the mean square error between the transform coefficients of the original and the reconstructed images.

  • PDF

개체군 변환 유전자 알고리즘의 새로운 수명 할당 방식에 관한 연구 (A Study on a New Lifetime allocation Method of Genetic Algorithm with Varying Population Size)

  • 권기호
    • 전자공학회논문지C
    • /
    • 제36C권1호
    • /
    • pp.66-72
    • /
    • 1999
  • 본 논문은 개체군 변환 알고리즘의 새로운 수명할당방식(allocation method)을 제안한다. 이 방법으로 개체군의 크기를 적합도(fitness)에 따라서 조절할 수 있다. 개체군(population)의 크기는 최적해(optimal value) 근처로 갈수록 안정된 상태로 가게 된다. 유전자 코딩에 있어서는 이배체(diploidy) 방식을 사용하였다. 시뮬레이션을 통하여 새로운 수명 할당 방식이 개체군의 크기를 조절할 수 있음을 확인한다.

  • PDF

Bit Allocation for Interframe Video Coding Systems

  • Kim, Wook-Joong;Kim, Seong-Dae;Kim, Jin-Woong
    • ETRI Journal
    • /
    • 제24권4호
    • /
    • pp.280-289
    • /
    • 2002
  • In this work, we present a novel approach to the bit allocation problem that aims to minimize overall distortion subject to a bit rate constraint. The optimal solution can be found by the Lagrangian method with dynamic programming. However, the optimal bit allocation for block-based interframe coding is practically unattainable because of the interframe dependency of macroblocks caused by motion compensation. To reduce the computational burden while maintaining a result close to the optimum, i.e., near optimum, we propose an alternative method. First, we present a partitioned form of the bit allocation problem: a "frame-level problem" and "one-frame macroblock-level problems." We show that the solution to this new form is also the solution to the conventional bit allocation problem. Further, we propose a bit allocation algorithm using a "two-phase optimization technique" with an interframe dependency model and a rate-distortion model.

  • PDF