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

Rule-based system for determining unit locations of a developed generation expansion plan for transmission planning

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
12
0

Year Published

2008
2008
2019
2019

Publication Types

Select...
7
1
1

Relationship

0
9

Authors

Journals

citations
Cited by 26 publications
(12 citation statements)
references
References 6 publications
0
12
0
Order By: Relevance
“…Line_Loading ≤ LL max (8) Where (i, j) ∈ Ω and: S = Branch-node incidence matrix In this study, the objective function was different from those which were considered in [1][2][3][4][5][6][7][8][9][10][11][12][13][14][15][16][17][18][19][20][23][24][25][26][27]29,30] and in part of the problem constraints, ij f is considered as an additional constraint. In addition to the abovementioned changes, also Line_Loading constraint was considered as a new constraint in order to ensure adequacy of the network after expansion.…”
Section: Methodsmentioning
confidence: 99%
See 1 more Smart Citation
“…Line_Loading ≤ LL max (8) Where (i, j) ∈ Ω and: S = Branch-node incidence matrix In this study, the objective function was different from those which were considered in [1][2][3][4][5][6][7][8][9][10][11][12][13][14][15][16][17][18][19][20][23][24][25][26][27]29,30] and in part of the problem constraints, ij f is considered as an additional constraint. In addition to the abovementioned changes, also Line_Loading constraint was considered as a new constraint in order to ensure adequacy of the network after expansion.…”
Section: Methodsmentioning
confidence: 99%
“…Some others proposed different approaches for solution of this problem considered various parameters such as uncertainty in demand [5] , reliability criteria [4,25,26] and economic factors [27] . Also, some of them investigated this problem and generation expansion planning together [28,29] . Recently, different methods such as GRASP [3] , Bender decomposition [6] , HIPER [17] branch and bound algorithm [30] , sensitivity analysis [15] , genetic algorithm [1,11,20,24] , simulated annealing [16] and Tabu search [12] have been proposed for solution of the STNEP problem.…”
Section: Introductionmentioning
confidence: 99%
“…A rule-based method is the motion coordinating rule that is composed of some pairs of a condition part and a motion part. In the rule-based method, agents observe the environment and select their motion whose condition part corresponds to the current environment [5]. Previous studies have proposed a simulation-based method using a rule-based method.…”
Section: A Backgroundmentioning
confidence: 99%
“…However, the method belongs to the category of the static planning techniques. The expert system based methods have been also investigated to deal with this problem [4,5]. Nevertheless, the optimality of the http://dx.doi.org/10.1016/j.ijepes.2014.…”
Section: Introductionmentioning
confidence: 99%