2021
DOI: 10.1109/access.2020.3046536
|View full text |Cite
|
Sign up to set email alerts
|

A Forensic-Based Investigation Algorithm for Parameter Extraction of Solar Cell Models

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1

Citation Types

0
47
0

Year Published

2021
2021
2024
2024

Publication Types

Select...
9
1

Relationship

5
5

Authors

Journals

citations
Cited by 83 publications
(50 citation statements)
references
References 66 publications
0
47
0
Order By: Relevance
“…If the follower fitness is better than its corresponding leader, the follower became a leader and the leader changed to a follower as in (24). The leader's positions are improved based on random function as in (25), and (26). The best global score and position are identified as in (27).…”
Section: Cbmo Search Algorithm Proceduresmentioning
confidence: 99%
“…If the follower fitness is better than its corresponding leader, the follower became a leader and the leader changed to a follower as in (24). The leader's positions are improved based on random function as in (25), and (26). The best global score and position are identified as in (27).…”
Section: Cbmo Search Algorithm Proceduresmentioning
confidence: 99%
“…There is no doubt that the accuracy of the behavior of PVs is based on the estimated parameters, so the optimization techniques need further development to achieve high accuracy of these parameters. Additionally, in [43], another optimization method called forensic optimizer was developed for finding the optimal parameters of various solar cells. In [44], the gradient based optimizer was developed for three diode models.…”
Section: Introductionmentioning
confidence: 99%
“…These structures are influenced by natural events, such as swarming activities, mechanisms focused on nature, and physics. Genetic algorithm (GA) [18], [19], particle swarm optimization [20]- [22], enhanced leader particle swarm optimization algorithm (PSO) [23], niche particle swarm optimization in parallel computing algorithm [24], several versions of differential evolution (DE) [25]- [28], penalty-based DE algorithm [29], sunflower optimizer [30], grey wolf optimizer (GWO) [31], whale optimizer algorithm (WOA) [32], harris-hawk optimizer (HHO) [33], improved salp swarm algorithm (ISSA) [34], several version of JAYA algorithm [35], multiple learning backtracking search algorithm [36], coyote optimization algorithm [37], teaching-learning-based optimization and its various versions [38]- [44], political optimizer (PO) [4], evolutionary shuffled frog leaping algorithm [45], slime-mould optimizer (SMO) [46], [47], marine predator algorithm (MPA) [48], equilibrium optimizer (EO) [49], ions motion optimization (IMO) [50], improved PSO (IPSO) [51], Forensic-based investigation algorithm [52], and improved learning-search algorithm [53] are among good heuristic-based structures. Some studies have endeavored to hybridize a few of these strategies to boost their performance, such as hybrid grey wolf optimizer with cuckoo search algorithm [54], hybrid firefly with pattern search algorithms [55], hybrid grey wolf optimizer with particle swarm algorithm [56], hybrid WO with DE algorithm [26], hybrid GA with simulated annealing algorithm [18], etc.…”
Section: Introductionmentioning
confidence: 99%