• 제목/요약/키워드: Flow distribution algorithm

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

신 에너지전원이 연계된 배전계통의 통합 보호기기의 알고리즘 개발에 관한 연구 (A Study on the Algorithm for Multi-Functional Protection Devices in Distribution Systems with New Energy Sources)

  • 윤기갑;강대훈;노대석
    • 한국산학기술학회논문지
    • /
    • 제10권9호
    • /
    • pp.2253-2260
    • /
    • 2009
  • 본 논문에서는 태양광과 풍력, 연료전지 등의 신 에너지전원(또는 분산전원)이 연계된 배전계통에 있어서 발생 가능한 보호협조의 문제점을 해결하기 위한 통합 보호기기의 알고리즘을 제시한다. 신 에너지전원을 배전계통에 연계함으로써 에너지 효율을 높일 수 있으며, 송배전 선로 건설비용의 절감, 전력 손실 감소, 전압 보상 및 전력 공급의 신뢰도 향상과 같은 많은 장점을 얻을 수 있다. 이러한 많은 장점에도 불구하고 신 에너지전원을 배전 계통에 연계하였을 경우, 전압변동, 고조파, 전력 품질 저하, 단락 용량 증대와 같은 많은 문제점도 발생하여, 이러한 문제점을 해결하기 위한 계통연계 장치 및 보호기기의 필요성이 증대하고 있는 실정이다. 즉, 현재의 배전계통 보호 방식은 단방향 조류방식으로 구성되어 있으나 분산전원의 도입으로 보호 기기가 설치되어 있는 계통에 정상상태임에도 불구하고 역방향의 전력조류가 발생될 수 있다. 따라서 본 논문에서는 이에 대한 새로운 배전 보호 알고리즘을 탑재한 보호기기의 알고리즘을 제시한다.

물류센터 입지 선정 문제를 위한 Network Flow Algorithm 연구 (A Study of Network Flow Algorithm for location problem of distribution center)

  • 박율기;이홍철
    • 한국산학기술학회:학술대회논문집
    • /
    • 한국산학기술학회 2010년도 춘계학술발표논문집 2부
    • /
    • pp.1177-1179
    • /
    • 2010
  • 본 연구는 생산 공장, 거점창고, 지역창고, 대리점으로 이어지는 일련의 SCM상에서의 물류센터의 최적의 입지를 선정 문제에 Network Flow Algorithm을 적용하고자 한다. 경로최소화, 전체비용최소화, 손실함수 등의 목적에 따라 문제가 다양하게 있을 수 있다. 최적화 문제에서 대표적으로 사용되는 Maximut flow의 알고리즘을 자세히 알아본다.

  • PDF

Bayesian MCMC를 이용한 저수량 점 빈도분석: I. 이론적 배경과 사전분포의 구축 (At-site Low Flow Frequency Analysis Using Bayesian MCMC: I. Theoretical Background and Construction of Prior Distribution)

  • 김상욱;이길성
    • 한국수자원학회논문집
    • /
    • 제41권1호
    • /
    • pp.35-47
    • /
    • 2008
  • 저수분석(low flow analysis)은 수자원공학에서 중요한 분야 중 하나이며, 특히 저수량 빈도분석(low flow frequency analysis)의 결과는 저수(貯水)용량의 설계, 물 수급계획, 오염원의 배치 및 관개와 생태계의 보존을 위한 수량과 수질의 관리에 중요하게 사용된다. 그러므로 본 연구에서는 저수량 빈도분석을 위한 점 빈도분석을 수행하였으며, 특히 빈도분석에 있어서의 불확실성을 탐색하기 위하여 Bayesian 방법을 적용하고 그 결과를 기존에 사용되던 불확실성 탐색방법과 비교하였다. 본 논문의Ⅰ편에서는 Bayesian 방법 중 사전분포(prior distribution)와 우도함수(likelihood function)의 복잡성에 상관없이 계산이 가능한 Bayesian MCMC(Bayesian Markov Chain Monte Carlo) 방법과 Metropolis-Hastings 알고리즘을 사용하기 위한 여러 과정의 이론적 배경과 Bayesian 방법에서 가장 중요한 요소인 사전분포를 구축하고 이를 비교 및 평가하였다. 고려된 사전분포는 자료에 기반하지 않은 사전분포와 자료에 기반한 사전분포로써 두 사전분포를 이용하여 Metropolis-Hastings 알고리즘을 수행하고 그 결과를 비교하여 저수량 빈도분석에 합리적인 사전분포를 선정하였다. 또한 알고리즘의 수행과정에서 필요한 제안분포(proposal distribution)를 적용하여 그에 따른 알고리즘의 효율성을 채택률(acceptance rate)을 산정하여 검증해 보았다. 사전분포의 분석 결과, 자료에 기반한 사전분포가 자료에 기반하지 않은 사전분포보다 정확성 및 불확실성의 표현에 있어서 우수한 결과를 제시하는 것을 확인할 수 있었고, 채택률을 이용한 알고리즘의 효용성 역시 기존 연구자들이 제시하였던 만족스러운 범위를 가지는 것을 알 수 있었다. 최종적으로 선정된 사전분포는 본 연구의 II편에서 Bayesian MCMC방법의 사전분포로 이용되었으며, 그 결과를 기존 불확실성의 추정방법의 하나인 2차 근사식을 이용한 최우추정(maximum likelihood estimation)방법의 결과와 비교하였다.

A Genetic Algorithm for Trip Distribution and Traffic Assignment from Traffic Counts in a Stochastic User Equilibrium

  • Sung, Ki-Seok;Rakha, Hesham
    • Management Science and Financial Engineering
    • /
    • 제15권1호
    • /
    • pp.51-69
    • /
    • 2009
  • A network model and a Genetic Algorithm (GA) is proposed to solve the simultaneous estimation of the trip distribution and traffic assignment from traffic counts in the congested networks in a logit-based Stochastic User Equilibrium (SUE). The model is formulated as a problem of minimizing a non-linear objective function with the linear constraints. In the model, the flow-conservation constraints are utilized to restrict the solution space and to force the link flows become consistent to the traffic counts. The objective of the model is to minimize the discrepancies between two sets of link flows. One is the set of link flows satisfying the constraints of flow-conservation, trip production from origin, trip attraction to destination and traffic counts at observed links. The other is the set of link flows those are estimated through the trip distribution and traffic assignment using the path flow estimator in the logit-based SUE. In the proposed GA, a chromosome is defined as a real vector representing a set of Origin-Destination Matrix (ODM), link flows and route-choice dispersion coefficient. Each chromosome is evaluated by the corresponding discrepancies. The population of the chromosome is evolved by the concurrent simplex crossover and random mutation. To maintain the feasibility of solutions, a bounded vector shipment technique is used during the crossover and mutation.

배전계통 부하조류계산 알고리즘 비교 분석 (Load Flow Algorithm Analysis of Distribution System)

  • 곽도일;김태응;류재홍;김재언
    • 대한전기학회:학술대회논문집
    • /
    • 대한전기학회 1999년도 추계학술대회 논문집 학회본부 A
    • /
    • pp.134-136
    • /
    • 1999
  • Not much work has been carried out on the load flow analysis of distribution networks. This paper introduces Newton-Raphson method using Distflow equation and Forward Sweeping method in the distribution networks. And that efficient solution scheme in a radial distribution network is presented. Also, simulation results of both Newton-Raphson method and Forward Sweeping method applied to a 22.9kV distribution system model with 120 load buses are analized and evaluated.

  • PDF

배전자동화 시스템에서 분포부하를 고려한 새로운 조류계산 알고리즘 (A New Load Flow Algorithm based on DAS with Considering Distributed Load)

  • 양하;최면송;임일형;이승재
    • 대한전기학회:학술대회논문집
    • /
    • 대한전기학회 2006년도 제37회 하계학술대회 논문집 A
    • /
    • pp.169-170
    • /
    • 2006
  • In this paper, A new algorithm for load flow calculation is proposed for radial distribution network. Feeder Remote Terminal Unit (FRTU) is utilized to collect data such as current magnitude and angle of power factor at each node. Proposed algorithm is based on the model of distributed load in distribution system. Load flow calculation is using four terminal constants method.

  • PDF

배전계통조류계산을 위한 새로운 알고리즘에 관한 연구 (A Study on Development of a New Algorithm to Solve Load Flow for Distribution Systems)

  • 문영현;유성영;최병곤;하복남;이중호
    • 대한전기학회:학술대회논문집
    • /
    • 대한전기학회 1998년도 하계학술대회 논문집 C
    • /
    • pp.918-922
    • /
    • 1998
  • With the development of industry, the qualitical advancement of power is needed. Since it is placed in the end step of power system, the fault at the distribution system causes some users blackout directly. So if the fault occurs, quick restoration is very important subject and, for the reason, induction of the distribution automation system is now being progressed briskly. For the quick restoration of the faulted distribution system, the load shedding of the blackout-area must be followed, and the other problems like the shedded load, faulted voltage and the rest may cause other accident. Accordingly load shedding must be based on the precise calculation technique during the distribution system load flow(dist flow) calculation. In these days because of its superior convergence characteristic the Newton-Raphson method is most widely used. The number of buses in the distribution system amounts to thousands, and if the fault occurs at the distribution system, the speed for the dist flow calculation is to be improved to apply to the On-Line system. However, Newton-Raphson method takes much time relatively because it must calculate the Jacobian matrix and inverse matrix at every iteration, and in the case of huge load, the equation is hard to converge. In this thesis. matrix equation is used to make algebraical expression and then to solve load flow equation and to modify above defects. Then the complex matrix is divided into real part and imaginary part to keep sparcity. As a result time needed for calculation diminished. Application of mentioned algorithm to 302 bus, 700 bus, 1004 bus system led to almost identical result got by Newton-Raphson method and showed constant convergence characteristic. The effect of time reduction showed 88.2%, 86.4%, 85.1% at each case of 302 bus, 700 bus system 86.4%, and 1004 bus system.

  • PDF

무작위 날개 배열을 갖는 횡단류 팬의 개발 : 무작위 배열의 선정 (A Study on the Development of a Cross-Flow Fan with a Random Distribution of Blades : Study on the Determination of Random Distribution)

  • 구형모;최원석;최중부;이진교
    • 한국소음진동공학회:학술대회논문집
    • /
    • 한국소음진동공학회 1998년도 춘계학술대회논문집; 용평리조트 타워콘도, 21-22 May 1998
    • /
    • pp.465-470
    • /
    • 1998
  • A cross-flow fan often generates discrete noise call blade passing frequency tones. Several methods have been investigated to reduce this BPF noise, where the random distribution of blades is the most promising one. A simple and effective algorithm to determine a random distribution of blades is proposed which considers fan. performance as well as noise characteristics. The proposed method is verified by a simple numerical model and is applied in manufacturing cross-flow fan samples. Also some experiments are carried out and the experimental results are analyzed.

  • PDF

확장 칼만 필터 기반 전기임피던스 단층촬영법을 이용한 다상유동장 가시화 (Visualization of Multi-phase Flow with Electrical Impedance Tomography based on Extended Kalman Filter)

  • 이정성;;;김신;김경연
    • 한국전산유체공학회:학술대회논문집
    • /
    • 한국전산유체공학회 2008년도 춘계학술대회논문집
    • /
    • pp.576-579
    • /
    • 2008
  • Electrical impedance(EIT) for the multi-phase flow visualization is an imaging modality in which the resistivity distribution of the unknown object is estimated based on the known sets of injected currents and measured voltages on the surface of the object. In this paper, an EIT reconstruction algorithm based on the extended Kalman filter(EKF) is proposed. The EIT reconstruction problem is formulated as a dynamic model which is composed of the state equation and the observation equation, and the unknown resistivity distribution is estimated recursively with the aid of the EKF. To verify the reconstruction performance of the proposed algorithm, experiments with simulated multi-phase flow are performed.

  • PDF

Dynamic Load-Balancing Algorithm Incorporating Flow Distributions and Service Levels for an AOPS Node

  • Zhang, Fuding;Zhou, Xu;Sun, Xiaohan
    • Journal of the Optical Society of Korea
    • /
    • 제18권5호
    • /
    • pp.466-471
    • /
    • 2014
  • An asynchronous optical packet-switching (AOPS) node with load-balancing capability can achieve better performance in reducing the high packet-loss ratio (PLR) and time delay caused by unbalanced traffic. This paper proposes a novel dynamic load-balancing algorithm for an AOPS node with limited buffer and without wavelength converters, and considering the data flow distribution and service levels. By calculating the occupancy state of the output ports, load state of the input ports, and priorities for data flow, the traffic is balanced accordingly. Simulations demonstrate that asynchronous variant data packets and output traffic can be automatically balanced according to service levels and the data flow distribution. A PLR of less than 0.01% can be achieved, as well as an average time delay of less than 0.46 ns.