Multi Dimension-Based Optimal Allocation of Uncertain Renewable Distributed Generation Outputs with Seasonal Source-Load Power Uncertainties in Electrical Distribution Network Using Marine Predator Algorithm
Bibliographic record
Abstract
In the last few years, the integration of renewable distributed generation (RDG) in the electrical distribution network (EDN) has become a favorable solution that guarantees and keeps a satisfying balance between electrical production and consumption of energy. In this work, various metaheuristic algorithms were implemented to perform the validation of their efficiency in delivering the optimal allocation of both RDGs based on multiple photovoltaic distributed generation (PVDG) and wind turbine distributed generation (WTDG) to the EDN while considering the uncertainties of their electrical energy output as well as the load demand’s variation during all the year’s seasons. The convergence characteristics and the results reveal that the marine predator algorithm was effectively the quickest and best technique to attain the best solutions after a small number of iterations compared to the rest of the utilized algorithms, including particle swarm optimization, the whale optimization algorithm, moth flame optimizer algorithms, and the slime mold algorithm. Meanwhile, as an example, the marine predator algorithm minimized the seasonal active losses down to 56.56% and 56.09% for both applied networks of IEEE 33 and 69-bus, respectively. To reach those results, a multi-objective function (MOF) was developed to simultaneously minimize the technical indices of the total active power loss index (APLI) and reactive power loss index (RPLI), voltage deviation index (VDI), operating time index (OTI), and coordination time interval index (CTII) of overcurrent relay in the test system EDNs, in order to approach the practical case, in which there are too many parameters to be optimized, considering different constraints, during the uncertain time and variable data of load and energy production.
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.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.001 |
| Research integrity | 0.001 | 0.001 |
| 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".