송전계통 안전도 제약조건을 반영한 급전계획 알고리즘 개발에 관한 연구
DC Field | Value | Language |
---|---|---|
dc.contributor.author | 정구형 | - |
dc.contributor.author | 김발호 | - |
dc.date.accessioned | 2022-02-17T04:42:25Z | - |
dc.date.available | 2022-02-17T04:42:25Z | - |
dc.date.created | 2022-02-17 | - |
dc.date.issued | 2005 | - |
dc.identifier.issn | 1229-2443 | - |
dc.identifier.uri | https://scholarworks.bwise.kr/hongik/handle/2020.sw.hongik/25340 | - |
dc.description.abstract | - 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. | - |
dc.publisher | 대한전기학회 | - |
dc.title | 송전계통 안전도 제약조건을 반영한 급전계획 알고리즘 개발에 관한 연구 | - |
dc.title.alternative | An Approach for Optimal Dispatch Scheduling Incorporating Transmission Security Constraints | - |
dc.type | Article | - |
dc.contributor.affiliatedAuthor | 김발호 | - |
dc.identifier.bibliographicCitation | 전기학회논문지 A권, v.54, no.12-A, pp.597 - 602 | - |
dc.relation.isPartOf | 전기학회논문지 A권 | - |
dc.citation.title | 전기학회논문지 A권 | - |
dc.citation.volume | 54 | - |
dc.citation.number | 12-A | - |
dc.citation.startPage | 597 | - |
dc.citation.endPage | 602 | - |
dc.type.rims | ART | - |
dc.identifier.kciid | ART000978298 | - |
dc.description.journalClass | 2 | - |
dc.description.journalRegisteredClass | kci | - |
dc.subject.keywordAuthor | Transmission Security Constraints | - |
dc.subject.keywordAuthor | Dispatch Scheduling | - |
dc.subject.keywordAuthor | Benders Decomposition Algorithm | - |
dc.subject.keywordAuthor | OPF | - |
dc.subject.keywordAuthor | Transmission Security Constraints | - |
dc.subject.keywordAuthor | Dispatch Scheduling | - |
dc.subject.keywordAuthor | Benders Decomposition Algorithm | - |
dc.subject.keywordAuthor | OPF | - |
Items in ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.
94, Wausan-ro, Mapo-gu, Seoul, 04066, Korea02-320-1314
COPYRIGHT 2020 HONGIK UNIVERSITY. ALL RIGHTS RESERVED.
Certain data included herein are derived from the © Web of Science of Clarivate Analytics. All rights reserved.
You may not copy or re-distribute this material in whole or in part without the prior written consent of Clarivate Analytics.