2021
DOI: 10.1108/compel-06-2021-0197
|View full text |Cite
|
Sign up to set email alerts
|

Grey wolf optimizer algorithm for the performance predetermination of variable speed self-excited induction generators

Abstract: Purpose This paper aims to apply grey wolf optimizer (GWO) algorithm for steady state analysis of self-excited induction generators (SEIGs) supplying isolated loads. Design/methodology/approach Taking the equivalent circuit of SEIG, the impedances representing the stator, rotor and the connected load are reduced to a single loop impedance in terms of the unknown frequency, magnetizing reactance and core loss resistance for the given rotor speed. This loop impedance is taken as the objective function and mini… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2

Citation Types

0
4
0

Year Published

2023
2023
2024
2024

Publication Types

Select...
4
1

Relationship

1
4

Authors

Journals

citations
Cited by 7 publications
(4 citation statements)
references
References 22 publications
0
4
0
Order By: Relevance
“…After finding X m , the core loss resistance (R m ) and induced electromotive force (EMF) (E G ) are obtained using equations ( 6) and (1), respectively. With induced EMF (E G ) as reference phasor, the expressions for various performance values of SEIG, derived using its equivalent circuit (Ramachandran et al, 2022;Rakesh et al, 2012)) as shown in Figure 1, are as follows: Load phase voltage:…”
Section: Application Of Binary Search Algorithmmentioning
confidence: 99%
See 3 more Smart Citations
“…After finding X m , the core loss resistance (R m ) and induced electromotive force (EMF) (E G ) are obtained using equations ( 6) and (1), respectively. With induced EMF (E G ) as reference phasor, the expressions for various performance values of SEIG, derived using its equivalent circuit (Ramachandran et al, 2022;Rakesh et al, 2012)) as shown in Figure 1, are as follows: Load phase voltage:…”
Section: Application Of Binary Search Algorithmmentioning
confidence: 99%
“…The values of the unknowns ( a , X m ) have lower and upper bounds of (0.5, 30) and (1,120), respectively. Subsequently R m is calculated as given in Ramachandran et al. (2022) and Yazıcı and Yaylacı (2023).…”
Section: Comparison Of Binary Search Algorithm With Other Algorithmsmentioning
confidence: 99%
See 2 more Smart Citations