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

An improved teaching–learning-based optimization algorithm using Lévy mutation strategy for non-smooth optimal power flow

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
94
0

Year Published

2015
2015
2022
2022

Publication Types

Select...
8
2

Relationship

0
10

Authors

Journals

citations
Cited by 153 publications
(94 citation statements)
references
References 41 publications
0
94
0
Order By: Relevance
“…The necessary line and bus data of the system are taken from [13]. The dimension of this problem is 12 including 6 generator voltages, 4 transformers tap settings and 2 static var compensators.…”
Section: Numerical Results and Discussionmentioning
confidence: 99%
“…The necessary line and bus data of the system are taken from [13]. The dimension of this problem is 12 including 6 generator voltages, 4 transformers tap settings and 2 static var compensators.…”
Section: Numerical Results and Discussionmentioning
confidence: 99%
“…compared with Case 1.1. Furthermore, the comparison of system voltage profiles between Case 1.1 and Case 1.3 is presented in Figure 5, which [3] 0.093269 0.093952 0.094171 LTLBO [24] 0.0974 0.0983 0.1006 DE-PS [25] 0.0978 0.0997 0.1022 GABC [26] 0.1007 0.1052 0.1097 BBO [12] 0.1020 0.1105 0.1207 clearly shows the improvement of bus voltage profile. The simulation results of FCGCS and other methods summarized in Table 5 indicate the FCGCS method has powerful searching ability.…”
Section: Case 12 Active Power Lossesmentioning
confidence: 99%
“…The numerical results of the ITLBO were compared with those of the basic TLBO and other state-of-the-art optimization algorithms, such as the TLBO algorithm with Lévy mutation in the learner phase (LTLBO) [33], the genetic algorithm with multi-parent crossover (GAMPC) [34] and the self-regulation particle swarm optimization algorithm (SRPSO) [35]. The "D" refers to the dimension of the optimization problems.…”
Section: Experiments On Benchmark Functionsmentioning
confidence: 99%