Efficient Multi-Year Security Constrained AC Transmission Network Expansion Planning
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.
NurtureToken New!

Token crowdsale for this paper ends in

Buy Nurture Tokens

Authors

Are you an author of this paper? Check the Twitter handle we have for you is correct.

Soumya Das (edit)
Ashu Verma (edit)
P. R. Bijwe (add twitter)
Ask The Authors

Ask the authors of this paper a question or leave a comment.

Read it. Rate it.
#1. Which part of the paper did you read?

#2. The paper contains new data or analyses that is openly accessible?
#3. The conclusion is supported by the data and analyses?
#4. The conclusion is of scientific interest?
#5. The result is likely to lead to future research?

Github
User:
None (add)
Repo:
None (add)
Stargazers:
0
Forks:
0
Open Issues:
0
Network:
0
Subscribers:
0
Language:
None
Youtube
Link:
None (add)
Views:
0
Likes:
0
Dislikes:
0
Favorites:
0
Comments:
0
Other
Sample Sizes (N=):
Inserted:
Words Total:
Words Unique:
Source:
Abstract:
None
09/15/19 06:04PM
8,502
2,143
Tweets
Nobody has tweeted about this paper.
Images
Related