Intelligent based technique for under voltage load shedding in power transmission systems
Bibliographic record
Abstract
The increasing demand of electric power energy and the presence of disturbances can be identified as the factors of voltage instability condition in a power system. A secure and reliable power system should be considered to ensure smooth delivery of electricity to the consumers. A power system may experience undesired event such as voltage instability condition leading to voltage collapse or cascading collapse if the system experiences lack of reactive power support. Thus, to avoid blackout and cascaded tripping, load shedding is the last resort to prevent a total damage. Under Voltage Load Shedding (UVLS) scheme is one of the possible methods which can be conducted by thepower system operators to avoid the occurrence of voltage instability condition. This paper presents the intelligent based technique for under voltage load shedding in power transmission systems. In this study, a computational based technique is developed in solving problem related to UVLS. The integration between a known computational intelligence-based technique termed as Evolutionary Programming (EP) with the under-voltage load shedding algorithm has been able to maintain the system operated within the acceptable voltage limit. Loss and minimum voltage control as the objective function implemented on the IEEE 30-Bus Reliability Test System (RTS) managed to optimally identify the optimal location and sizing for the load shedding scheme. Results from the studies, clearly indicate the feasibility of EP for load shedding scheme in loss and minimum voltage control in power system.
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.000 | 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.000 | 0.000 |
| Open science | 0.000 | 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".