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

A Multi-objective Shuffled Bat algorithm for optimal placement and sizing of multi distributed generations with different load models

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
4
1

Citation Types

0
41
0

Year Published

2017
2017
2023
2023

Publication Types

Select...
4
2
1

Relationship

0
7

Authors

Journals

citations
Cited by 102 publications
(41 citation statements)
references
References 30 publications
0
41
0
Order By: Relevance
“…(1) Traditional LF solvers: The traditional LF solution methods, aiming at solving equality and inequality constraints, predominately include: • Other LF methods and frameworks as in [33,[42][43][44]51,53,66,80,90,92]; in addition to LF frameworks as multi-criteria stochastic planning model (MCSPM) with central limit theorem (CLT) [34] and IBVT in [56].…”
Section: Load Flow Solution Methods (S)mentioning
confidence: 99%
“…(1) Traditional LF solvers: The traditional LF solution methods, aiming at solving equality and inequality constraints, predominately include: • Other LF methods and frameworks as in [33,[42][43][44]51,53,66,80,90,92]; in addition to LF frameworks as multi-criteria stochastic planning model (MCSPM) with central limit theorem (CLT) [34] and IBVT in [56].…”
Section: Load Flow Solution Methods (S)mentioning
confidence: 99%
“…Some of the Paretobased MOO algorithms that were utilized in solving the DG allocation problem include improved multiobjective HSA, 27 multiobjective shuffled bat algorithm, 28 improved differential search algorithm, 29 improved nondominated sorting GA-II (NSGA-II), 30 multiobjective Taguchi approach (MOTA), 31 Pareto frontier-based DE, 32 and nondominated sorting TLBO. Hence, the problem of allocating DGs in RDS becomes a complex multiobjective optimization (MOO) problem since it is quite hard to simultaneously optimize multiple conflicting objectives.…”
Section: Introductionmentioning
confidence: 99%
“…In view of the considered DG allocation problem, the Pareto approach is more suitable than the conventional weighted sum approach because, in Pareto approach, the trade-off nondominated solutions are obtained in just a single run whereas the weighted sum approach requires multiple runs by varying the weights (usually, in steps) to find the trade-off nondominated solutions. Some of the Paretobased MOO algorithms that were utilized in solving the DG allocation problem include improved multiobjective HSA, 27 multiobjective shuffled bat algorithm, 28 improved differential search algorithm, 29 improved nondominated sorting GA-II (NSGA-II), 30 multiobjective Taguchi approach (MOTA), 31 Pareto frontier-based DE, 32 and nondominated sorting TLBO. 33 It may be observed from literature survey that only a few number of studies are available that have utilized the Pareto-based MOO methods 17,[27][28][29][30][31][32][33] as compared with the conventional weighted sum method.…”
Section: Introductionmentioning
confidence: 99%
“…Sequential quadratic programming has been employed in [27] to obtain set of optimal solutions to minimize total real power loss and cost of DG. In addition to loss and voltage deviation minimization, cost minimization is also considered as objective [28]. Shuffled Bat algorithm has been employed in solving optimization.…”
Section: Introductionmentioning
confidence: 99%
“…Pareto front has been obtained in both and compromised solution has been selected from set of solutions. The best solution has been selected by fuzzy decision-making in [27] and while it has been done by max-min technique in [28].…”
Section: Introductionmentioning
confidence: 99%