Modified Whale Optimization Algorithm for Solar Cell and PV Module Parameter Identification
Bibliographic record
Abstract
The whale optimization algorithm (WOA) is a powerful swarm intelligence method which has been widely used in various fields such as parameter identification of solar cells and PV modules. In order to better balance the exploration and exploitation of WOA, we propose a novel modified WOA (MWOA) in which both the mutation strategy based on Levy flight and a local search mechanism of pattern search are introduced. On the one hand, Levy flight can make the algorithm get rid of the local optimum and avoid stagnation; thus, it is able to prevent the algorithm from losing diversity and to increase the global search capability. On the other hand, pattern search, a direct search method, has not only high convergence rate but also good stability, which can boost the local optimization ability of the WOA. Therefore, the combination of these two mechanisms can greatly improve the capability of WOA to obtain the best solution. In addition, MWOA may be employed to estimate parameters in single diode model (SDM), double diode model (DDM), and PV modules and to identify unknown parameters of two different types of PV modules under diverse light irradiance and temperature conditions. The analytical results demonstrate the validity and the practicality of MWOA for estimating parameters of solar cells and PV modules.
Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.
How this classification was reachedexpand
Full frame machine prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. The Gemma side is a direct model label for every work in the frame, read from the title-only record. The Codex side is a classifier learned from the 10,348 direct Codex labels and calibrated to design-weighted sample rates; fields without enough sample support carry no Codex call. Candidate is the union of the two sides; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels.
Distilled classifier scores by category (both heads)
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.001 | 0.002 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.001 | 0.001 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.001 | 0.001 |
| Open science | 0.001 | 0.001 |
| Research integrity | 0.001 | 0.001 |
| Insufficient payload (model declined to judge) | 0.002 | 0.000 |
Machine scores (provisional)
The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.
Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from itClassification
machine, unvalidatedMachine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.
How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".