OPTIMAL ECONOMIC AND ENVIRONMENTAL OPERATION OF ELECTRIC POWER SYSTEMS VIA MODERN META-HEURISTIC OPTIMIZATION ALGORITHMS
Bibliographic record
Abstract
Due to world-wide escalating fuel costs, increasing demand for electricity, and growing concern for the environment, power utilities strive for optimal economic operation of their electric networks. Striking a balance between profitable energy choices and environmentally-friendly practices is the main goal of this thesis. The dynamic economic dispatch (DED) occupies a prominent place in power system operation and control. However, there is a paucity of studies of the DED problem, as it has not been as thoroughly investigated as other electric power system optimization areas. The nonlinear and non-convex characteristics are more prevalent in the DED problem. Therefore, it is possible that computational methods may not yield a global extrema as many local extrema may be encountered, and, in this case, obtaining a truly optimal solution presents a challenge.\n\tTwo modern meta-heuristic optimization algorithms are utilized to solve the DED problem. The artificial bee colony (ABC) algorithm is a recently introduced population-based algorithm motivated by the intelligent foraging behaviour of the honeybee swarm. This thesis proposes a novel meta-heuristic optimization algorithm inspired by the intelligent behaviour or survival instincts of a sensory-deprived human being. The sensory-deprived optimization algorithm (SDOA) uses the exploration and exploitation processes simultaneously and distinctly from other algorithms. After solving different benchmark optimization functions, the SDOA efficiency is evident with results that outperform or match those attained by other well-known methods.\n\tTo enhance the utilized algorithmsâ performances in solving the dynamic economic and emission dispatch problems, a new constrained search-tactic is offered. Two groups of test cases are used to validate the effectiveness of the proposed algorithms. The first one is designated to solve the single objective function scenario and to verify the presented constrained search-tactic. The second group focuses on the multiple objective functionsâ scenario as well as an attempt to integrate a renewable source and analyze its impact. The outcomes of ABC and SDOA algorithms are compared with those of other older and known methods. The promising results in both utilized algorithms show great potential that can be employed in several electric power system optimization areas.
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 distilled prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. Learned from the 10,348 direct Codex labels and 10,348 direct Gemma labels. Candidate is the union of thresholded teacher heads; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels or direct frontier model labels.
Codex and Gemma teacher scores by category
| 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.001 |
| Open science | 0.000 | 0.000 |
| Research integrity | 0.000 | 0.000 |
| Insufficient payload (model declined to judge) | 0.000 | 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 teacher head, 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".