Water cycle algorithm‐based optimal control strategy for efficient operation of an autonomous microgrid
Bibliographic record
Abstract
This study presents a novel water cycle algorithm (WCA)‐based optimal control strategy with the purpose of obtaining an efficient operation of an autonomous microgrid. The proposed control strategy is based on the proportional–integral (PI) controllers, which are optimally designed by the WCA. The optimisation process depends on the simulation‐based optimisation approach and the criteria of integral squared error are chosen as an objective function. The control scheme is applied to an autonomous, decentralised, operation of a microgrid with multiple electronically interfaced distributed generation units and their local loads. In the islanded mode, the proposed controller is used to control the voltages of the islanded system despite the microgrid load and topological variability and uncertainties. The frequency of the islanded system is dictated through the use of an internal oscillator. The effectiveness of the proposed controller is compared with that obtained using the genetic algorithm‐based PI controller. The validity of the proposed control strategy is extensively checked based on simulation studies in the PSCAD/EMTDC environment under different operating conditions of the microgrid. With the application of the WCA‐based optimal PI control scheme, the microgrid operation can be further enhanced.
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.000 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.000 | 0.000 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.001 | 0.001 |
| Open science | 0.001 | 0.000 |
| Research integrity | 0.000 | 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".