2000
DOI: 10.1049/ip-gtd:20000337
|View full text |Cite
|
Sign up to set email alerts
|

Branch and bound algorithm for transmission system expansion planning using a transportation model

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

2
91
0
7

Year Published

2008
2008
2020
2020

Publication Types

Select...
7
2

Relationship

0
9

Authors

Journals

citations
Cited by 154 publications
(100 citation statements)
references
References 6 publications
2
91
0
7
Order By: Relevance
“…Under the constraint of using existing ROWs, 6 we now show that for a single line congestion case, proposed local corridor strengthening methodology will lead to near-optimal solution. Change in the susceptance across an existing ROW may be a consequence of either 1) addition of a new line in an existing ROW or 2) series compensation of an existing line.…”
Section: B Efficacy Of Proposed Heuristicmentioning
confidence: 78%
“…Under the constraint of using existing ROWs, 6 we now show that for a single line congestion case, proposed local corridor strengthening methodology will lead to near-optimal solution. Change in the susceptance across an existing ROW may be a consequence of either 1) addition of a new line in an existing ROW or 2) series compensation of an existing line.…”
Section: B Efficacy Of Proposed Heuristicmentioning
confidence: 78%
“…Equation (8) indicates that, when transmission line k in corridor ij is not selected for construction (I ij, k = 0), transmission lines from k + 1 to K ij will not be built. Thus, transmission line k + 1 in corridor ij will not be considered for construction until transmission line k has first been selected.…”
Section: Decision-making Constraints Of Tsosmentioning
confidence: 99%
“…In the recent period, Lattore et al [13] [32][33][34], disjunctive mixed integer programming [35], branch and bound algorithm [36], implicit enumeration [37,38], Benders decomposition [12, 39,40], maximum flow [12], hierarchical decomposition [41], sensitivity analysis [42,43], genetic algorithm (GA) [44][45][46][47][48][49], object-oriented programming [50], game-theory [51][52][53][54], simulated annealing [55,56], expert systems [57,58], fuzzy set [49,59,60], greedy randomised adaptive search [61], non-convex optimisation [62], tabu search [63], ant-colony [64], data-mining [65], particle swarm optimisation (PSO) [66][67][68][69], harmony search [70,71], artificial neural network (ANN) [72], game theory [73], and robust optimisation techniques [74][75]…”
Section: Grid Developmentmentioning
confidence: 99%