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

Optimal reactive power dispatch using hybrid Nelder–Mead simplex based firefly algorithm

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
76
0
1

Year Published

2016
2016
2023
2023

Publication Types

Select...
6
4

Relationship

0
10

Authors

Journals

citations
Cited by 171 publications
(86 citation statements)
references
References 37 publications
(45 reference statements)
0
76
0
1
Order By: Relevance
“…Previous studies have investigated the VVC problems based on the multiple regulation devices. Reference [15] developed a hybrid algorithm for the joint optimization of OLTC adjusting and CBs switching to minimize the power losses and voltage violation of distribution networks. The authors in [16] proposed a coordinated OLTC and SVC control algorithm to improve operational efficiency and a two-stage method was adopted.…”
Section: Tijmentioning
confidence: 99%
“…Previous studies have investigated the VVC problems based on the multiple regulation devices. Reference [15] developed a hybrid algorithm for the joint optimization of OLTC adjusting and CBs switching to minimize the power losses and voltage violation of distribution networks. The authors in [16] proposed a coordinated OLTC and SVC control algorithm to improve operational efficiency and a two-stage method was adopted.…”
Section: Tijmentioning
confidence: 99%
“…Hybridized multiple heuristic algorithms are widely used for solution of ORPD problem. For example, hybrid shuffled frog leaping algorithm (SFLA) and regional seek algorithm known as NeldereMead (NM-SFLA) [12], hybrid modified teachingelearning algorithm (MTLA) and double differential evolution (DDE) [13], hybrid modified imperialist competitive algorithm (MICA) and invasive weed optimization (IWO) [14], firefly algorithm (FA) and Nelder Mead (NM) simplex method [15] are used for ORPD solution. The most significant advantage of hybrid algorithms is higher speed of convergence to the optimal solution.…”
Section: Literature Reviewmentioning
confidence: 99%
“…The method uses a simplex known as a polytope which has n + 1 vertices (or n + 1 test points) in n variables of objective function. To find the values that can minimize the objective function value, the method repeats reflection, contraction and expansion of the variables [30,31] by comparing function values at n + 1 test points and by avoiding the test point that gives the worst function value. More explanation to understand the algorithm is available in [32].…”
Section: Wind Farm Controllermentioning
confidence: 99%