Decentralized Contingency-Constrained Tie-Line Scheduling for Multi-Area Power Grids

Tie-line scheduling (TS) becomes a practical need for growing interconnection of regional power grids and the increasing integration of renewable energy. In electricity markets without a coordination organization, TS should be handled in a fully decentralized manner, where the impact of contingencies should also be considered for operational reliability. In this paper, the contingency-constrained TS (CCTS) problem is formulated using a two-stage robust optimization (RO) scheme to consider the N-k security criterion. This robust model is decomposed and handled by the alternating direction multiplier method (ADMM) in a fully decentralized way, where the column-and-constraint generation (C&CG) is incorporated to solve the regional robust subproblems. Three computational strategies are also developed to enhance the computation efficiency of the decentralized algorithm. Numerical simulations are given to study the computational performance, the solution quality, and scalability of the proposed method.