• Proceedings of the KIEE Conference
• /
• 2005.07a
• /
• pp.268-270
• /
• 2005

전력계통을 계획, 운영, 검토, 해석하는데 있어서 가장 필요한 OPF(Optimal Power Flow)는 현재 다방면에서 새로운 알고리즘과 많은 수리적 방법을 통하여 접근하고 있다. 이들의 기반이 되는 조류계산은 많은 신뢰성들을 얻었지만, 현재 실무자 중심으로 구성되고 직접적으로 적절한 발전배분 상태를 계산하는 부분에서는 일부 한계성이 나타나고 있다. 이에 대해서 계속된 반복계산에 의한 최적의 계통 발전 배분상태에 근접한 값을 제시할 수 있는 프로그램을 PSS/E의 IPLAN을 통하여 개발하였다.

• Proceedings of the KIEE Conference
• /
• 2005.11b
• /
• pp.156-158
• /
• 2005

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 Sealing Interior Point Method (AS IPM), 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 a relevant case study to confirm the efficiency of the proposed methodology.

• Proceedings of the KIEE Conference
• /
• 1989.07a
• /
• pp.173-178
• /
• 1989

Optimal Power Flow (OPF) solution by the Newton's method provides a reliable and robust method to classical OPF problems. The major challenge in algorithm development is to identify the binding inequalities efficiently. This paper propose a simple strategy to identify the binding set. From the mechanism of penalty shifting with soft penalty in trial iteration, a active binding sit is identified automatically. This paper also suggests a technique to solve the linear system whore coefficients are presented by the matrix. This implementation is highly efficient for sparsity programming. Case study for 3,5,14,118,190 bus and practrical KEPCO 305 bus system are performed as well.

• Proceedings of the KIEE Conference
• /
• 1989.11a
• /
• pp.171-175
• /
• 1989

Newton-OPF proposed by W.F Tinny and his fellows in 1984 is most useful and powerful algorithm in optical power flow calculation. But, several problems prevent its application to practical uses. The problems are determination of active sets, initial values of variables, soft and hard weights, and discrete variables such as transformer taps. In this paper, convergence characteristics of Newton OPF is analyzed with effects of these factors using wide - used 5-bus sample system. Wide - use of results in this paper is appreciated.

• Proceedings of the KIEE Conference
• /
• summer
• /
• pp.728-730
• /
• 2004

Transmission congestion is one of the Key factors to local market power in competitive electricity markets. Other players' strategy is also considered. This paper presents an alternative methodology in market power under transmission congestion and other players' strategy. The proposed methodology was demonstrated with the Optimal Power Flow(OPF). Case study is fulfilled by GAMS simulation.

• Proceedings of the KIEE Conference
• /
• 2015.07a
• /
• pp.523-524
• /
• 2015

신재생 에너지는 발전 시 연료가 들지 않는다는 특징과 친환경적인 이유로 각광 받고 있다. 이러한 특징으로 인해 에너지 독립 계통을 구성하는 데 주요 역할을 한다. 풍력, 태양광, 에너지 저장 장치 등이 분산 전원으로서 계통을 구성하게 되는데, 낮은 효율과 높은 초기 설치비용으로 인해 디젤 발전기나 마이크로 터빈 등 소형 발전기를 예비 전력으로서 부착하는 경우가 대부분이다. 이러한 분산 전원들은 가격이 제각각이며 기존의 화석연료 발전기처럼 비용 함수 모델링이 어려워 경제적 분석이 어려웠다. 이 논문은 이러한 신재생 에너지를 사용한 독립 마이크로그리드를 경제적 관점에서 분석하는 것이 목적이다. 따라서 계통을 분석하는 가장 보편적인 방법인 최적 조류 계산(OPF, Optimal Power Flow)방법과 가격을 최소화하는 점을 찾는 경제급전(ED, Economic Dispatch)방법을 사용하였다. 두 가지 방법의 결과를 비교하여 발전 비용을 줄일 수 있는지에 대해 조사하였다. 7-Bus 가상 계통을 만들어 사용하였고, OPF와 ED의 발전 비용은 PowerFactory$^{(R)}$ 프로그램을 통해 시뮬레이션 하여 데이터를 얻었다.

• Journal of Advanced Marine Engineering and Technology
• /
• v.28 no.5
• /
• pp.837-846
• /
• 2004

This paper presents a screening technique for greatly reducing the computation involved in determining the optimal location and types of Flexible AC Transmission System (FACTS) devices in a large power system. The first-order sensitivities of the generation cost for various FACTS devices are derived. This technique requires solving only one optimal power flow (OPF) to obtain sensitivities with respect to FACTS device control variables for every transmission line To implement a sensitivity-based screening technique, we used a new UPFC model, which consists of an ideal transformer with a complex turns ratio and a variable shunt admittance. A S-bus system based on the IEEE 14-bus system was used to illustrate the technique.

• Proceedings of the KIEE Conference
• /
• 1999.11b
• /
• pp.197-199
• /
• 1999

This paper deals with optimal power flow, which is optimal problem with equality constraint and inequality constraint. A algorithm of changing two constraints problem to one constraint - equality constraint problem - that make it analytical access for optimal power flow is presented.

• Proceedings of the KIEE Conference
• /
• 2001.07a
• /
• pp.194-196
• /
• 2001

This paper presents a hybrid algorithm 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. In OPF considering security, the outages are selected by contingency ranking method. 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. The method proposed is applied to the modified IEEE 14buses model system.

• Proceedings of the KIEE Conference
• /
• 2001.07a
• /
• pp.197-199
• /
• 2001

This paper presents a Tabu Search (TS) based algorithm to solve the Optimal Power Flow (OPF) problem, converses rapidly to global optima by means of escaping local minima. In this paper, a new approach based on the random TS algorithm with continuous variable is proposed to find that a solution to the OPF problem within reasonable time complexity. To verify the efficiency of the proposed approach, case studies are made for IEEE 30-bus system.