• The Transactions of The Korean Institute of Electrical Engineers
• /
• v.56 no.10
• /
• pp.1721-1730
• /
• 2007

SThis paper proposes a new dispatch scheduling algorithm in interconnected regional system operations. The dispatch scheduling formulated as mixed integer non-linear programming (MINLP) problem can efficiently be computed by generalized Benders decomposition (GBD) algorithm. GBD guarantees adequate computation speed and solution convergency since it decomposes a primal problem into a master problem and subproblems for simplicity. In addition, the inter-temporal optimal power flow (OPF) subproblem of the dispatch scheduling problem is comprised of various variables and constraints considering time-continuity and it makes the inter-temporal OPF complex due to increased dimensions of the optimization problem. In this paper, regional decomposition technique based on auxiliary problem principle (APP) algorithm is introduced to obtain efficient inter-temporal OPF solution through the parallel implementation. In addition, it can find the most economic dispatch schedule incorporating power transaction without private information open. Therefore, it can be expanded as an efficient dispatch scheduling model for interconnected system operation.

• The Transactions of The Korean Institute of Electrical Engineers
• /
• v.56 no.2
• /
• pp.260-267
• /
• 2007

Systematic studies on the dispatch scheduling algorithm can enhance the efficiency of electricity market operation. In addition, as the dispatching policies in competitive electricity markets directly affect the market participants' profits, the dispatch scheduling procedure should be reasonable, systematic, and transparent. In this paper, we propose an unconstrained/constrained pre-dispatch scheduling algorithm and develop corresponding programs applicable to wholesale electricity markets.

• The Transactions of the Korean Institute of Electrical Engineers P
• /
• v.59 no.3
• /
• pp.245-252
• /
• 2010

This paper proposes a constrained multi-area dispatch scheduling algorithm applicable to interconnected power system operations. The dispatch scheduling formulated as an MIP problem can be efficiently computed by GBD algorithm. GBD guarantees adequate computation speed and solution convergence by reducing the dimension of the dispatch scheduling problem. In addition, the regional decomposition technique based on ADM is introduced to obtain efficient inter-temporal OPF solution. It can find the most economic dispatch schedule incorporating power transactions without each regional utility's private information open.

• The Transactions of the Korean Institute of Electrical Engineers A
• /
• v.54 no.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.

• Proceedings of the KIEE Conference
• /
• 2005.07a
• /
• pp.801-803
• /
• 2005

Fundamentally, success of the competitive electricity market is dependent on efficient market design. However, since electricity incorporates various physical constraints as other commodities, the resource assignment (i.e., dispatch scheduling) is also one of requisites for the successful operation of electricity market. Therefore, efficient dispatch scheduling is an important issue to succeed in the deregulated electricity market and the efficiency of this electricity market may be considerably increased by systematic studies on dispatch scheduling algorithm and corresponding constraints, especially system security. Moreover, contrary to traditional vertically-integrated electric power industry condition, since various decision-makings in deregulated electricity market are directly connected with market participants' benefits, only rational dispatch scheduling algorithm can convince these participants. Therefore, it can provide a basis of grievance prevention. In this paper, we propose an algorithm for security constrained dispatch scheduling with respect to load curtailment. Proposed algorithm decomposes the dispatch problem into a master problem corresponding to basecase optimal power flow (OPF) and several subproblems corresponding a series of contingencies using two-stage optimization technique.

• Proceedings of the KIEE Conference
• /
• 2006.07a
• /
• pp.388-389
• /
• 2006

Systematic studies on the dispatch scheduling algorithm and related constraints can enhance the effectiveness of electricity market operation. Moreover, since various decision-making matters connected to dispatch schedule in competitive electricity market directly affect the market participants' profit, the dispatch scheduling procedure should be reasonable and systematic to convince them. Therefore, to prevent a dispute among the participants, these studies are indispensible requisites for the effective electricity market operation. In this paper, we develop unconstrained/constrained dispatch schedule algorithm applicable to Korean wholesale electricity market.

• Proceedings of the KIEE Conference
• /
• 2006.11a
• /
• pp.167-169
• /
• 2006

Systematic studies on the dispatch scheduling algorithm and related constraints can enhance the effectiveness of electricity market operation. Moreover the introduction of competition in electricity market emphasizes various decision-marking matters connected to dispatch scheduling procedure. Because these affect the market participants' profit, the dispatch scheduling procedure should be reasonable. In this paper, we propose a constrained Pre-dispatch algorithm with considered security using sensitivity indices.

• Proceedings of the KIEE Conference
• /
• 2007.07a
• /
• pp.806-807
• /
• 2007

Systematic studies on the dispatch scheduling algorithm and related constraints can enhance the effectiveness of electricity market operation. When System Operator (SO) establishes a dispatch schedule, the bid information should be preserved in the schedule as much as possible. In this paper, we introduce a new type of sensitivity factor called Line Outage Impact Factor (LOIF) to screen a transmission line causing the most severe outage when scheduling the dispatch. This screening can assure the stable system operation and make an efficient feedback between the SO and market participants. We propose a transmission line contingency constrained Pre-dispatch algorithm using sensitivity indices in a suitable Pre-dispatch scheduling. The proposed algorithm has been tested on sample system and the results show more secure operation against critical contingencies.

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

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

This paper presents the power scheduling of a multi-microgrid (MMG) system using an optimization technique called particle swarm optimization (PSO). The PSO technique has been shown to be most effective at solving the various problems of the economic dispatch (ED) in a power system. In addition, a new MMG system configuration is proposed in this paper, through which the optimal power flow is achieved. Both optimization and power trading methods within an MMG are studied. The results of implementing PSO in an MMG system for optimal power flow and cost minimization are obtained and compared with another attractive and efficient optimization technique called the genetic algorithm (GA). The comparison between these two effective methods provides very competitive results, and their operating costs also appear to be comparable. Finally, in this study, power scheduling and a power trading method are obtained using the MATLAB program.