2020
DOI: 10.1016/j.advengsoft.2020.102904
|View full text |Cite
|
Sign up to set email alerts
|

A novel grid-oriented dynamic weight parameter based improved variant of Jaya algorithm

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
7
0

Year Published

2020
2020
2024
2024

Publication Types

Select...
7
1

Relationship

3
5

Authors

Journals

citations
Cited by 14 publications
(8 citation statements)
references
References 49 publications
0
7
0
Order By: Relevance
“…In addition, DGs are directly integrated to the consumer side, unlike the centrally located power generating units situated far away from load centers and resulting in higher transmission losses [ 3 6 ]. However, connecting DG of inappropriate size to non-optimal location results in higher power losses and total cost, therefore offsetting the primary goal of connecting it to the distribution networks [ 7 10 ]. The optimal allocation of DGs, involves determining the best sizes and locations to satisfy the required goals while adhering to distribution network constraints.…”
Section: Introductionmentioning
confidence: 99%
“…In addition, DGs are directly integrated to the consumer side, unlike the centrally located power generating units situated far away from load centers and resulting in higher transmission losses [ 3 6 ]. However, connecting DG of inappropriate size to non-optimal location results in higher power losses and total cost, therefore offsetting the primary goal of connecting it to the distribution networks [ 7 10 ]. The optimal allocation of DGs, involves determining the best sizes and locations to satisfy the required goals while adhering to distribution network constraints.…”
Section: Introductionmentioning
confidence: 99%
“…A number of solutions [42,43] have been suggested to prevent premature convergence in optimization-based algorithms, with one particularly significant study being carried out by Zhang Y et al [44], who proposed that in the case of a premature convergence The proposed WOA-FS optimally selected those minimum number of highly important features that attained maximum classification accuracy for any given volume of consumption data and extracted features (as depicted in the square matrix, where Con n f n represents Con n : consumer number and f n : feature number). Before initiating the feature selection process through WOA, the number of iterations, number of search agents, convergence criteria, search space boundaries, decision variables, and the learning classifier had to be decided.…”
Section: Proposed Feature-engineering Methodsmentioning
confidence: 99%
“…A number of solutions [42,43] have been suggested to prevent premature convergence in optimization-based algorithms, with one particularly significant study being carried out by Zhang et al [44], who proposed that in the case of a premature convergence problem, the best existing solution should be preserved and the mutation process should continue until an improved solution is found; once an improved solution is found, the current optimal solution is updated, and the mutation process is stopped. In the current study, in order to avoid the problem of premature convergence, humpback whales in the WOA technique, during the prey search phase, searched for prey in a random manner according to their relative positions to one another.…”
Section: Proposed Feature-engineering Methodsmentioning
confidence: 99%
“…In contemporary literature, numerous studies [53][54][55][56][57][58][59][60][61][62][63][64] have proved the dominating performance of Jaya and Rao algorithms over different optimization algorithms applied in diverse fields. However, the Rao and Jaya algorithms also suffer from deficiencies of slow and premature convergence as they lose population diversity [63,[65][66][67].…”
Section: Existing Research and Itsmentioning
confidence: 99%