Dynamic Economic Load Dispatch Using Linear Programming and Mathematical-Based Models
Bibliographic record
Abstract
Economic dispatch (ED) is one of the most important topics in power system operation and planning. The main purpose of this paper is to develop simple and effective mathematical models for the ED problem. Two stages were considered to solve this problem. First, the ED problem is formulated using linear piecewise functions and then optimally solved using the LP technique at various load values. The effectiveness of the LP in optimally solving the ED problem is verified by applying it to two different test systems. The results are compared with those obtained using other ED optimization techniques. The LP optimization performance of the proposed method is found to be similar to those of the reported techniques. In the second stage, the data collected from the optimization process in the first stage are transferred to TuringBot software. This software is adopted to build efficient mathematical models for the optimal power generation (output parameters) as functions of the load values (input parameters). The main objective of these models is to easily evaluate the optimal power sharing of the generators in an online fashion under rapid variable loading conditions without the need to solve the ED-LP based problem. Optimization techniques, including the LP, generally require considerable simulation times for linearization and optimization code execution, particularly under fast load variations. Thus, the main features of the developed models in this paper are simplicity, accessibility, as well as the ability in obtaining an efficient and optimal solution with a faster execution time.
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.001 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.001 | 0.001 |
| Science and technology studies | 0.000 | 0.001 |
| Scholarly communication | 0.001 | 0.001 |
| Open science | 0.001 | 0.001 |
| Research integrity | 0.001 | 0.001 |
| Insufficient payload (model declined to judge) | 0.004 | 0.001 |
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".