  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.
