• 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.

• Journal of Energy Engineering
• /
• v.11 no.4
• /
• pp.291-298
• /
• 2002

This paper presents a practical methodology that can analysis power flow and marginal factors based on optimal power flow (OPF) of power systems under restructuring environment. First of all, to evaluate useful marginal factors, nonlinear optimization problems of minimum fuel cost and minimum transmission loss are formulated and solved by nonlinear primal-dual interior point method. Here, physical constraints considered in the optimization problems are the limits of bus voltage. line overloading, and real & reactive power generation. Also, an evaluation method of marginal price and marginal transmission loss is presented based on sensitivities calculated by the two OPF problems. Especially, to reflect the cost related to transmission losses in the competitive electricity market, an analysis method of MLF (marginal loss factor) is pro-posed. Numerical results on IEEE RTS 24 show that the proposed algorithm is effective and useful for analysis of power market price.

• Journal of Electrical Engineering and Technology
• /
• v.12 no.4
• /
• pp.1586-1592
• /
• 2017

Voltage sourced converter (VSC) based direct-current (DC) grid has the ability to control power flow flexibly and securely, thus it has become one of the most valid approaches in aspect of large-scale renewable power generation, oceanic island power supply and new urban grid construction. To solve the optimal power flow (OPF) problem in DC grid, an adaptive particle swarm optimization (PSO) algorithm based on fuzzy control theory is proposed in this paper, and the optimal operation considering both power loss and voltage quality is realized. Firstly, the fuzzy membership curve is used to transform two objectives into one, the fitness value of latest step is introduced as input of fuzzy controller to adjust the controlling parameters of PSO dynamically. The proposed strategy was applied in solving the power flow issue in six terminals DC grid model, and corresponding results are presented to verify the effectiveness and feasibility of proposed algorithm.

• Proceedings of the KIEE Conference
• /
• 2000.07a
• /
• pp.279-281
• /
• 2000

In this paper, we propose that the security-constrined optimal power flow (SCOPF) be solved in a decentralized framework, consisting of regions, using a price-based mechanism. We first solve the distributed OPF problem to determine the maximum secure simultaneous transfer capability of each tie-line between adjacent regions by taking only the security constraints imposed on the tie-lines into account. And then, the regional SCOPF is performed using the conventional LP approach. A description on the inclusion of security constraints with distributed OPF algorithm will be given, followed by a case study for Korea power system.

• Proceedings of the KIEE Conference
• /
• 2003.07a
• /
• pp.19-23
• /
• 2003

This paper presents a new concept of reactive reserve based contingency constrained optimal power flow (RCCOPF) for voltage stability enhancement. This concept is based on the fact that increase in reactive reserves is effective for enhancement of voltage stability margins of post-contingent states, in this paper, the proposed algorithm is applied to voltage stability margin of interface flow. Interface flow limit, in the open access environment, can be a main drawback. RCCOPF for enhancement of interface flow margin is composed of two modules, modified continuation power flow (MCPF) and optimal power flow (OPF). These modules art recursively perform ed until satisfying the required margin of interface flow in the given voltage stability criteria.

• Journal of Electrical Engineering and Technology
• /
• v.3 no.2
• /
• pp.199-206
• /
• 2008

The introduction of competition in electricity markets emphasizes the importance of sufficient transmission capacities to guarantee effective power transactions. Therefore, for the economic and stable electric power system operation, transmission security constrains should be incorporated into the dispatch scheduling problem. With the intent to solve this problem, we decompose a dispatch scheduling problem into a master problem(MP) and several subproblems(SPs) using Benders decomposition. The MP solves a general optimal power flow(OPF) problem while the SPs inspect the feasibility of OPF solution under respective transmission line contingencies. If a dispatch scheduling solution given by the MP violates transmission security constraints, then additional constraints corresponding to the violations are imposed to the MP. Through this iterative process between the MP and SPs, we derive an optimal dispatch schedule incorporating the post-contingency corrective rescheduling. In addition, we consider interruptible loads as active control variables since the interruptible loads can participate as generators in competitive electricity markets. Numerical examples demonstrate the efficiency of the proposed algorithm.

• Proceedings of the KIEE Conference
• /
• 1998.07c
• /
• pp.926-928
• /
• 1998

A fast optimization algorithm has been evolved from a simple two stage optimal power flow(OPF) algorithm for constrained power economic dispatch. In the proposed algorithm, we consider various constraints such as power balance, generation capacity, transmission line capacity, transmission losses, security equality, and security inequality constraints. The proposed algorithm consists of four stages. At the first stage, we solve the aggregated problem that is the crude classical economic dispatch problem without considering transmission losses. An initial solution is obtained by the aggregation concept in which the solution satisfies the power balance equations and generation capacity constraints. Then, after load flow analysis, the transmission losses of an initial generation setting are matched by the slack bus generator that produces power with the cheapest cost. At the second stage we consider transmission losses. Formulation of the second stage becomes classical economic dispatch problem involving the transmission losses, which are distributed to all generators. Once a feasible solution is obtained from the second stage, transmission capacity and other violations are checked and corrected locally and quickly at the third stage. The fourth stage fine tunes the solution of the third stage to reach a real minimum. The proposed approach speeds up the coupled LP based OPF method to an average gain of 53.13 for IEEE 30, 57, and 118 bus systems and EPRI Scenario systems A through D testings.

• 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
• /
• 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.