2012
DOI: 10.1016/j.ijepes.2012.06.046
|View full text |Cite
|
Sign up to set email alerts
|

Congestion management based roulette wheel simulation for optimal capacity selection: Probabilistic transmission expansion planning

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1

Citation Types

0
28
0
1

Year Published

2013
2013
2024
2024

Publication Types

Select...
4
4

Relationship

1
7

Authors

Journals

citations
Cited by 28 publications
(29 citation statements)
references
References 20 publications
0
28
0
1
Order By: Relevance
“…Similarly, we demonstrate that the test of voltage stability of transmission line follows from the joint consideration of the real and complex power flow Eqs. (1) and (2). In this apprehension, the specific possible considerations are given subsequently.…”
Section: Test For the Validity Of The Proposed Modelmentioning
confidence: 99%
See 1 more Smart Citation
“…Similarly, we demonstrate that the test of voltage stability of transmission line follows from the joint consideration of the real and complex power flow Eqs. (1) and (2). In this apprehension, the specific possible considerations are given subsequently.…”
Section: Test For the Validity Of The Proposed Modelmentioning
confidence: 99%
“…The goal of this research paper is to advance the state-of-art in the power system reliability [1][2][3] and voltage stability [4][5][6]. It is well known that for effective power system planning, the appropriate reactive compensation [3,[6][7][8][9][10][11] is essential with a set of proper network parameters (resistance (R) and reactance (X and C)) and associated planning.…”
Section: Introductionmentioning
confidence: 99%
“…Including the above mentioned costs into a weighted graph, the shortest distance between the starting point and the termination point of a path can be determined using shortest path algorithms. If the weights assigned to the edges of the graph are costs per km of transmission line, the shortest path algorithm delivers the minimum transmission system cost between two vertices (15).…”
Section: Optimization Of Investment Time Points and Grid Topologymentioning
confidence: 99%
“…Mathematical optimization methods include linear programming [6]- [8], quadratic programming, non-linear programming [9], integer programming and mixedinteger programming [10]- [14] and their combinations. For high dimensional non-convex problems these methods become computationally expensive and have been enhanced by heuristic methods [15]- [17]. The most popular include sensitivity analysis [18], [19], genetic algorithms [20]- [25], simulated annealing [26]- [28], tabu search [29], [30] and particle swarm optimization [31], [32].…”
Section: Introductionmentioning
confidence: 99%
“…[1][2][3][4][5][6][7][8][9][10][11][12][13]. Using these techniques, TEP has, over the years, evolved from cost-based to value-based approaches [9][10][11][12][13][14]. In the value-based approach, Min-cut-max-flow (MCMF) algorithm and load flow based curtailment strategy have been used to calculate expected demand/ energy not served (EDNS/EENS) [1,3,8,12], as reliability measures.…”
mentioning
confidence: 99%