A Modified Hybrid Particle Swarm Optimization With Bat Algorithm Parameter Inspired Acceleration Coefficients for Solving Eco-Friendly and Economic Dispatch Problems
Bibliographic record
Abstract
The paper presents a modified hybrid particle swarm optimization with bat algorithm parameter inspired acceleration coefficients (MHPSO-BAAC) without and with the constriction factor to find the optimal solution of the economic dispatch problems (EDPs) incorporating conventional as well as hybrid and renewable energy sources (RESs) based plants. The algorithm is designed by modifying the recently presented hybrid PSO and BA (HPSOBA) algorithm applied for the achievement of the optimal solution of the EDPs. The modified algorithm is implemented to solve EDPs of all RESs-based power systems for three scenarios, without constraints, with time-varying demand, and with the consideration of regional load sharing dispatch (RLSD). The performance of the algorithm is also verified through the implementation of various combinations of hybrid as well as thermal power plants (TPPs). The case of TPPs consists of three different scenarios: 1) a small-scale system with constraints like ramp-rate limits (RRLs), prohibited operating zones (POZs), and power losses; 2) a medium-scale power system with consideration of emission-economic dispatch (EED); 3) a large-scale power system with valve-point loading (VPL) effect. The results of the designed MHPSO-BAAC algorithm are compared with the various metaheuristic algorithms available in the literature and the comparative analysis shows the superior performance of the developed algorithm in terms of fuel cost reduction, fast convergence, and computational 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.000 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.000 | 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.001 | 0.001 |
| 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".