Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
169 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
45 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Efficient Multi-Year Security Constrained AC Transmission Network Expansion Planning (1909.06139v1)

Published 13 Sep 2019 in eess.SY, cs.SY, and math.OC

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

We haven't generated a summary for this paper yet.