Tie-line Security Regions in High Dimension for Renewable Accommodations
Wei Lin, Hua Jiang, Zhifang Yang

TL;DR
This paper introduces a fast, decomposition-based method to compute high-dimensional tie-line security regions, enabling efficient renewable accommodation and reducing curtailments in interconnected power systems.
Contribution
It proposes a novel decomposition approach that simplifies high-dimensional security region calculations by leveraging dispatch levels and tie-line aggregation.
Findings
Method reduces computational burden significantly.
Effective in multiple test systems including IEEE 9-bus and 661-bus.
Helps in minimizing renewable curtailments.
Abstract
Tie-line power exchanges among regional power systems facilitate renewable accommodations. Power exchanges can be calculated via a tie-line security region that provides the feasible region of the coupling parameters among regional power systems. However, a tie-line security region is a high-dimension polytope due to multiple time periods and border buses inherently in power system operations, leading to the considerable computational burden. A fast calculation method for tie-line security regions in high dimension is studied in this paper. The high-dimension polytope across all the time periods is decomposed as a Cartesian production of lower-dimension polytopes at each time period by leveraging dispatch levels of generations. For each lower-dimension polytope, the computational burden brought by multiple border buses is alleviated by aggregating tie-line power. Also, minimum renewable…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsRailway Systems and Energy Efficiency · HVDC Systems and Fault Protection · Power System Optimization and Stability
