• Title/Summary/Keyword: Constrained Dispatch Scheduling Algorithm

Search Result 9, Processing Time 0.03 seconds

Constrained Multi-Area Dispatch Scheduling Algorithm with Regionally Distributed Optimal Power Flow Using Alternating Direction Method (ADM 기반 분산처리 최적조류계산을 이용한 다지역 제약급전계획 알고리즘)

  • Chung, Koo-Hyung;Kim, Bal-Ho;Lee, Jong-Joo;Kim, Hak-Man
    • 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.

Development of the Pre-Dispatch Scheduling Algorithm in the Competitive Electricity Market (경쟁적 전력시장 하에서의 선행급전계획 알고리즘 개발에 관한 연구)

  • Chung, Kooh-Hyung;Kang, Dang-Joo;Kim, Bal-Ho
    • 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.

Security Constrained Optimal Power Flow Incorporating Load Curtailment Schedule (부하차단량을 고려한 상정사고 절약 최적조류계산 알고리즘 개발)

  • Chung, Koo-Hyung;Kang, Dong-Joo;Kim, Bal-Ho
    • 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.

  • PDF

A study on a constrained pre-dispatch algorithm with considered security (안전도를 고려한 제약 선행급전 알고리즘에 관한 연구)

  • Kim, Kwang-Mo;Chung, Koo-Hyung;Han, Seok-Man;Park, Kyoung-Han;Kim, Bal-Ho H.
    • 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.

  • PDF

A Study on an Improving Contingency Constrained Pre-Dispatch Algorithm in a Competitive Electricity Market (경쟁적 전력시장에서 송전선로 상정사고를 고려한 선행급전 알고리즘 개선에 관한 연구)

  • Kim, Kwang-Mo;Shin, Hye-Kyeong;Kang, Dong-Ju;Han, Seok-Man;Chung, Koo-Hyung;H.Kim, Bal-Ho
    • 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.

  • PDF

Development of the Pre-Dispatch Scheduling Algorithm in the Competitive Electricity Market (경쟁적 전력시장 하에서의 선행급전계획 알고리즘 개발에 관한 연구)

  • Chung, Koo-Hyung;Kang, Dong-Joo;Han, Seok-Man;Kim, Bal-Ho
    • 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.

  • PDF

A Study on Contingency Constrained Optimal Power Flow Algorithm (상정사고를 고려한 최적조류계산 알고리즘에 관한 연구)

  • Joung, Sang-Houn;Chung, Koo-Hyung;Kim, Bal-Ho
    • The Transactions of the Korean Institute of Electrical Engineers A
    • /
    • v.55 no.3
    • /
    • pp.123-127
    • /
    • 2006
  • The recent movement to deregulated and competitive electricity market requires new concepts in applying dispatch algorithms to system operation and planning. As power systems tend to be operated more closely to their ultimate ratings, the role of Contingency Constrained Optimal Power Flow is changed and the importance for security enhancement will be more increased in the new and competitive electricity market. This paper presents a contingency constrained optimal power flow (CCOPF) algorithm. The proposed algorithm maintains the nodal voltage levels and transmission line's power flow within the specified limits before and after a contingency. A case study demonstrates the proposed algorithm with the IEEE-14RTS under N-1 contingency criterion.

A Study on the Constrained Dispatch Scheduling Using Affine Scaling Interior Point Methdod (Affine Scaling Interior Point Method를 이용한 제약급전계획에 관한 연구)

  • Kim, Kyung-Min;Han, Seok-Man;Kim, Kang-Won;Park, Jung-Sung;Chung, Koo-Hyung;Kim, Bal-Ho H.
    • Proceedings of the KIEE Conference
    • /
    • 2005.07a
    • /
    • pp.858-860
    • /
    • 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 Scailing 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. Lastly, this paper provides a relevant case study to confirm the efficiency of the proposed methodology.

  • PDF

A Study on the Constrained Dispatch Scheduling Using Affine Scaling Interior Point Method (Affine Scaling Interior Point Method를 이용한 제약급전에 관한 연구)

  • Kim, Kyung-Min;Han, Seok-Man;Chung, Koo-Hyung;Kim, Bal-Ho
    • The Transactions of the Korean Institute of Electrical Engineers A
    • /
    • v.55 no.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.