A Novel Sooty Terns Algorithm for Deregulated MPC-LFC Installed in Multi-Interconnected System with Renewable Energy Plants
Bibliographic record
Abstract
This paper introduces a novel metaheuristic approach of sooty terns optimization algorithm (STOA) to determine the optimum parameters of model predictive control (MPC)-based deregulated load frequency control (LFC). The system structure consists of three interconnected plants with nonlinear multisources comprising wind turbine, photovoltaic model with maximum power point tracker, and superconducting magnetic energy storage under deregulated environment. The proposed objective function is the integral time absolute error (ITAE) of the deviations in frequencies and powers in tie-lines. The analysis aims at determining the optimum parameters of MPC via STOA such that ITAE is minimized. Moreover, the proposed STOA-MPC is examined under variation of the system parameters and random load disturbance. The time responses and performance specifications of the proposed STOA-MPC are compared to those obtained with MPC optimized via differential evolution, intelligent water drops algorithm, stain bower braid algorithm, and firefly algorithm. Furthermore, a practical case study of interconnected system comprising the Kuraymat solar thermal power station is analyzed based on actual recorded solar radiation. The obtained results via the proposed STOA-MPC-based deregulated LFC confirmed the competence and robustness of the designed controller compared to the other algorithms.
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.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".