• 대한전기학회:학술대회논문집
• /
• 대한전기학회 1997년도 추계학술대회 논문집 학회본부
• /
• pp.182-186
• /
• 1997

This paper presents a mathematical approach to implementing distributed optimal power flow (OPF), wherein a regional decomposition technique is adopted to parallelize the OPF. Three mathematical decomposition coordination methods are introduced firs to implement the proposed distributed scheme: the Auxiliary Problem Principle (APP), the Predictor-Corrector Proximal Multiplier Method (PCPM), and the Alternating Direction Method (ADM). Then two alternative schemes for modeling distributed OPF are introduced; the Dummy Generator-Dummy Generator (DGDG) scheme and Dummy Generator-Dummy Load (DGDL) scheme. We present the mathematical analyses of the proposed approach, and demonstrate the approach on several test, systems, including IEEE Reliability Test Systems and parts of the ERCOT (Electric Reliability Council of Texas) system.

• Journal of Electrical Engineering and Technology
• /
• 제9권1호
• /
• pp.80-89
• /
• 2014

A stochastic optimal power flow (S-OPF) model considering uncertainties of load and wind power is developed based on chance constrained programming (CCP). The difficulties in solving the model are the nonlinearity and probabilistic constraints. In this paper, a limit relaxation approach and an iterative learning control (ILC) method are implemented to solve the S-OPF model indirectly. The limit relaxation approach narrows the solution space by introducing regulatory factors, according to the relationship between the constraint equations and the optimization variables. The regulatory factors are designed by ILC method to ensure the optimality of final solution under a predefined confidence level. The optimization algorithm for S-OPF is completed based on the combination of limit relaxation and ILC and tested on the IEEE 14-bus system.

• 대한전기학회:학술대회논문집
• /
• 대한전기학회 2001년도 추계학술대회 논문집 전력기술부문
• /
• pp.239-242
• /
• 2001

This paper presents a windows program package for solving security constrained OPF in interconnected power systems, which is based on the combined application of evolutionary programming(EP) and sequential quadratic programming(SQP). The objective functions are the minimization of generation fuel costs and system power losses. The control variables are the active power of the generating units, the voltage magnitude of the generator, transformer tap settings and SVC setting. The state variables are the bus voltage magnitude, the reactive power of the generating unit, line flows and the tie line flow. In OPF considering security, the outages are selected by contingency ranking method. The resulting optimal operating point has to be feasible after outages such as any single line outage(respect of voltage magnitude, reactive power generation and power flow limits). The OPF package proposed is applied to 10 machines 39 buses model system.

• 대한전기학회:학술대회논문집
• /
• 대한전기학회 1998년도 하계학술대회 논문집 C
• /
• pp.1000-1002
• /
• 1998

We present an approach to parallelizing optimal power flow (OPF) that is suitable for distributed implementation and is applicable to very large interconnected power systems. The objective of this paper is to find a set of control parameters with which the Auxiliary Problem Principle (Algorithm - APP) can be best implemented in solving optimal power flow (OPF) Problems. We employed several IEEE Reliability Test Systems to demonstrate the alternative parameter sets.

• 대한전기학회논문지:전력기술부문A
• /
• 제54권12호
• /
• pp.597-602
• /
• 2005

The introduction of competition in electricity market emphasizes the importance of sufficient transmission capacities to guarantee various electricity transactions. Therefore, when dispatch scheduling, transmission security constraints should be considered for the economic and stable electric power system operation. In this paper, we propose an optimal dispatch scheduling algorithm incorporating transmission security constraints. For solving these constraints, the dispatch scheduling problem is decomposed into a master problem to calculate a general optimal power flow (OPF) without transmission security constraints and several subproblems to inspect the feasibility of OPF solution under various transmission line contingencies. If a dispatch schedule given by the master problem violates transmission security constraints, then an additional constraint is imposed to the master problem. Through these iteration processes between the master problem and subproblems, an optimal dispatch schedule reflecting the post-contingency rescheduling is derived. Moreover, since interruptible loads can positively participate as generators in the competitive electricity market, we consider these interruptible loads active control variables. Numerical example demonstrates efficiency of the proposed algorithm.

• 대한전기학회논문지:전력기술부문A
• /
• 제55권3호
• /
• pp.133-138
• /
• 2006

This paper presents an Optimal Power Flow (OPF) algorithm using Interior Point Method (IPM) to swiftly and precisely perform the five minute dispatch. This newly suggested methodology is based on Affine Scaling Interior Point Method which is favorable for large-scale problems involving many constraints. It is also eligible for OPF problems in order to improve the calculation speed and the preciseness of its resultant solutions. Big-M Method is also used to improve the solution stability. Finally, this paper provides relevant case studies to confirm the efficiency of the proposed methodology.

• Journal of Electrical Engineering and Technology
• /
• 제11권4호
• /
• pp.791-800
• /
• 2016

Optimal Power Flow (OPF) is an important operational and planning problem in minimizing the chosen objective functions of the power systems. The recent developments in power electronics have enabled introduction of dc links in the AC power systems with a view of making the operation more flexible, secure and economical. This paper formulates a new OPF to embrace dc link equations and presents a heuristic optimization technique, inspired by the behavior of fireflies, for solving the problem. The solution process involves AC/DC power flow and uses a self adaptive technique so as to avoid landing at the suboptimal solutions. It presents simulation results of IEEE test systems with a view of demonstrating its effectiveness.

• Journal of Oral Medicine and Pain
• /
• 제30권1호
• /
• pp.79-85
• /
• 2005

긴장성두통환자의 통증이 구강악습관과 관련이 있는지를 확인하고자 연구하였다. 일정기간 내원한 긴장성두통환자 58명 중 구강악습관(이갈이, 이악물기, 이갈이와 이악물기) 환자 20명을 실험군으로 하고, 나머지 38명을 대조군으로 하여 국제두통학회의 긴장성두통 진단기준안에 근거하여 설문조사 후 통계처리하였다. 결과는 다음과 같다. 1. 실험군과 대조군간의 성별(p=0.91) 및 나이(p=0.73)는 유의성이 없었다. 2. 통증의 종류에서 두 군 공히 둔통이 많았으며, 유의성은 없었고(p=0.69), 비둔통은 실험군이 대조군에 비해서 많았다. 3. 통증의 강도에서 두 군 공히 비심도가 많았으며, 유의성은 없었고(p=0.40), 심도는 실험군이 대조군에 비해서 많았다. 4. 통증의 양측성 유무에서 두 군 공히 편측성이 많았으며, 유의성은 없었고(p=0.52), 양측성은 실험군이 대조군에 비해서 많았다. 5. 통증의 일상생활시 악화유무에서 두 군 공히 악화가 많았으며, 유의성은 없었고(p=0.74), 악화는 실험군이 대조군에 비해서 많았다. 구강악습관이 있는 긴장성 두통환자의 통증은 구강악습관이 없는 환자에 비해서 양측성이며 심도의 비둔통이 많았고 일상생활에 의해서 더 쉽게 증가되었으나 통계적인 유의성은 없었다. 따라서, 구강악습관은 국제 두통학회에서 제시한 기준으로는 긴장성두통환자의 통증변화에 영향을 미치지 않지만, 일상생활에 의해서 더 쉽게 악화되므로 향후 저작이나 대화 등 구체적인 일상생활의 조건에 따른 변화를 확인하는 것이 필요하리라고 사료된다.

• 대한전기학회:학술대회논문집
• /
• 대한전기학회 2000년도 하계학술대회 논문집 A
• /
• pp.347-349
• /
• 2000

Under an open transmission access, the generation dispatch is determined by the bidding process of market participants. Congestion occurs when the dispatch would result in the violation of operational constraints. Congestion problem is formulated and solved by OPF(optimal power flow) calculation. The objective functions in OPF are given as quadratic cost functions or piecewise linear functions of bidding functions. In this study, the optimization technique of generation dispatch is presented for the combination of two types of quadratic and linear cost functions.

• 대한전기학회:학술대회논문집
• /
• 대한전기학회 2006년도 추계학술대회 논문집 전력기술부문
• /
• pp.195-197
• /
• 2006

This paper presents new power development planning method. This method uses modified-OPF (Optimal Power Flow) includes attribution constrains. After solved the OPF, shadow prices of constraints are used making the weighting factors. These factors are used ordering new generators.