Efficient Multi-Year Security Constrained AC Transmission Network Expansion Planning

TL;DR

This paper introduces an efficient four-stage methodology for multi-year, security-constrained AC transmission network expansion planning, significantly reducing computational complexity for large systems.

Contribution

It presents a novel, computationally efficient approach with logical strategies for dynamic AC TNEP, addressing the high computational burden of existing methods.

Findings

Successfully applied to Garver 6, IEEE 24, and 118 bus systems

Demonstrates significant reduction in computational time

Capable of handling large, complex systems efficiently

Abstract

Solution of multi-year, dynamic AC Transmission network expansion planning (TNEP) problem is gradually taking center stage of planning research owing to its potential accuracy. However, computational burden for a security constrained AC TNEP is huge compared to that with DC TNEP. For a dynamic, security constrained AC TNEP problem, the computational burden becomes so very excessive that solution for even moderately sized systems becomes almost impossible. Hence, this paper presents an efficient, four-stage solution methodology for multi-year, network N-1 contingency and voltage stability constrained, dynamic ACTNEP problems. Several intelligent logical strategies are developed and applied to reduce the computational burden of optimization algorithms. The proposed methodology is applied to Garver 6, IEEE 24 and 118 bus systems to demonstrate its efficiency and ability to solve TNEP for varying system sizes.