On Robust Tie-Line Scheduling in Multi-Area Power Systems

The tie-line scheduling problem in a multi-area power system seeks to optimize tie-line power flows across areas that are independently operated by different system operators (SOs). In this paper, we leverage the theory of multi-parametric linear programming to propose algorithms for optimal tie-lin...

Full description

Saved in:
Bibliographic Details
Published in:IEEE transactions on power systems Vol. 33; no. 4; pp. 4144 - 4154
Main Authors: Guo, Ye, Bose, Subhonmesh, Tong, Lang
Format: Journal Article
Language:English
Published: IEEE 01.07.2018
Subjects:
Generators
Mathematical model
multi-parametric programming
Optimal scheduling
Power transmission lines
robust optimization
Robustness
Tie-line scheduling
ISSN:0885-8950, 1558-0679
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:The tie-line scheduling problem in a multi-area power system seeks to optimize tie-line power flows across areas that are independently operated by different system operators (SOs). In this paper, we leverage the theory of multi-parametric linear programming to propose algorithms for optimal tie-line scheduling, respectively, within a deterministic and a robust optimization framework. Aided by a coordinator, the proposed methods are proved to converge to the optimal schedule within a finite number of iterations. A key feature of the proposed algorithms, besides their finite step convergence, is that SOs do not reveal their dispatch cost structures, network constraints, or natures of uncertainty sets to the coordinator. The performance of the algorithms is evaluated using several power system examples.
ISSN:0885-8950
1558-0679
DOI:10.1109/TPWRS.2017.2775161