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

Heuristic optimization based approach for identification of power system dynamic equivalents

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
4
1

Citation Types

1
17
0
2

Year Published

2017
2017
2024
2024

Publication Types

Select...
5
1
1

Relationship

1
6

Authors

Journals

citations
Cited by 21 publications
(25 citation statements)
references
References 10 publications
1
17
0
2
Order By: Relevance
“…start and P i . shut , we use (18) to calculate the spinning reserve capacity in (7) when sampling the feasible unit on-off schemes:…”
Section: Representative Set Of Feasible Unit On-off Schemesmentioning
confidence: 99%
See 1 more Smart Citation
“…start and P i . shut , we use (18) to calculate the spinning reserve capacity in (7) when sampling the feasible unit on-off schemes:…”
Section: Representative Set Of Feasible Unit On-off Schemesmentioning
confidence: 99%
“…Since the inherent nature of mixed-integer nonlinearity of the UC problem, many algorithms have been used to search the optimal UC scheme, such as the dynamic programming method [2,3], heuristic methods [4][5][6][7], the mixed integer programming method [8,9], the Lagrangian relaxation method [10,11], and the genetic algorithm method [12,13]. Generally, the common way is to turn the UC problem into a two-stage optimization problem, with determination of unit on-off scheme as the first stage and scheduling the generation output as the second stage.…”
Section: Introductionmentioning
confidence: 99%
“…So far, many efforts are devoted to reduce the power system model using classical approaches based on modal analysis [4][5][6][7][8][9], coherency concept [10,11], or a combination of both [12]. However, using classical approaches may not be a good choice due to the continuous growth of the network and the non-availability of neighbors' system parameters and configurations that are the key information of these analytical approaches [13,14]. To overcome these shortcomings of classical approaches, measurement based approaches have been proposed [15,16].…”
Section: Introductionmentioning
confidence: 99%
“…The performances of recently developed metaheuristic algorithms to solve the dynamic equivalence problem are addressed in [14,[33][34][35][36]. Although optimization algorithms such as PSO [34], Grey Wolf Optimizer (GWO) [35] and Salp Swarm Algorithm (SSA) [36], are able to solve the dynamic equivalence problem, accuracy of the solution is not guaranteed.…”
Section: Introductionmentioning
confidence: 99%
“…Despite its similarities to some of the popular heuristic methods, the uniqueness of the MVMO is the use of a special mapping function to mutate candidate solutions according to the statistics of the best candidate solutions. MVMO has shown promising performance in some other optimization problems of power systems [7][8][9].…”
Section: Introductionmentioning
confidence: 99%