Optimal integration of photovoltaic distributed generation in electrical distribution network using hybrid modified PSO algorithms
Bibliographic record
Abstract
The satisfaction of electricity customers and environmental constraints imposed have made the trend towards renewable energies making them more essential due to their advantages as reducing power losses and ameliorating system’s voltage profiles and reliability. This article addresses the optimal location and size of multiple distributed generations (DGs) based on solar photovoltaic panels (PV) connected to electrical distribution network (EDN) using the various proposed hybrid particle swarm optimization (PSO) algorithms based on chaotic maps and adaptive acceleration coefficients. These algorithms are implemented to optimally allocate the DGs based PV (PV-DG) into EDN by minimizing the multi-objective function (MOF), which is represented as the sum of three technical parameters of the total active power loss (TAPL), total voltage deviation (TVD), and total operation time (TOT) of overcurrent relays (OCRs). The effectiveness of the proposed PSO algorithms were validated on both standards IEEE 33-bus, and 69-bus. The optimal integrating of PV-DGs into EDNs reduced the TAPL percentage by 56.94 % for the IEEE 33-bus and by 61.17 % for the IEEE 69-bus test system, enhanced the voltage profiles while minimizing the TVD by 37.35 % and by 32.27 % for two EDNs, respectively.
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.000 | 0.001 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.000 | 0.000 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.001 | 0.000 |
| Open science | 0.001 | 0.000 |
| Research integrity | 0.001 | 0.000 |
| Insufficient payload (model declined to judge) | 0.001 | 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".