Papers
Topics
Authors
Recent
Search
2000 character limit reached

Efficient Multi-Year Security Constrained AC Transmission Network Expansion Planning

Published 13 Sep 2019 in eess.SY, cs.SY, and math.OC | (1909.06139v1)

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.

Citations (11)

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Authors (3)

Collections

Sign up for free to add this paper to one or more collections.