A new realistic optimization-free economic load dispatch method based on maps gathered from sliced fuel-cost curves
Bibliographic record
Abstract
Many methods have been introduced as economic load dispatchers. However, all these methods depend on the optimization field, where most of these studies mainly focus on how to strengthen the optimization algorithms themselves. This means the mystery key that segregate between the good and bad ELD solvers is the optimization algorithm itself. However, there is a practical fact known in many real power stations that the generators set-points, assigned by automation centers, are actually in discrete form. Thus, the solutions presented in the literature are infeasible if they are seen from this practical point of view. One of the approaches is to use combinational optimization algorithms. Because most of ELD problems have limited number of generating units, so all the solutions can be extracted by slicing the fuel-cost function of each unit in order to have a full map of all feasible solutions. Based on that, the exact optimal solution as well as all other best solutions can be easily obtained by this method. The main challenge that could be faced with this optimization-free method is when the dimension of the given ELD problem is large, because the discrete search space exponentially increases as the number of variables or/and slicing resolution increases. This challenge can be avoided if that ELD problem is correctly formulated based on real configurations of electric power stations. Some numerical experiments are given to illustrate the mechanism of the proposed technique.
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.001 | 0.001 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.001 | 0.001 |
| Open science | 0.001 | 0.001 |
| Research integrity | 0.000 | 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".