Hybrid Particle Swarm Optimization Approach for Solving the Discrete OPF Problem Considering the Valve Loading Effects
Why this work is in the frame
A frame that forgets how it found something cannot be audited. These are the routes that admitted this work.
Bibliographic record
Abstract
This paper presents a hybrid particle swarm optimization algorithm (HPSO) as a modern optimization tool to solve the discrete optimal power flow (OPF) problem that has both discrete and continuous optimization variables. The problem is classified as constrained mixed integer nonlinear programming with multimodal characteristics. The objective functions considered are the system real power losses, fuel cost, and the gaseous emissions of the generating units. Two different types of fuel cost functions are considered in this study, namely the conventional quadratic function and the augmented quadratic function to introduce more accurate modeling that incorporates the valve loading effects. The latter model presents nondifferentiable and nonconvex regions that challenge most gradient-based optimization algorithms. The proposed algorithm makes use of the PSO, known for its global searching capabilities, to allocate the optimal control settings while Newton-Raphson algorithm minimizes the mismatch of the power flow equations. A hybrid inequality constraint handling mechanism that preserves only feasible solutions without the need to augment the original objective function is incorporated in the proposed approach. To demonstrate its robustness, the proposed algorithm was tested on the IEEE 30-bus system with six generating units. Several cases were investigated to test and validate the consistency of detecting optimal or near optimal solution for each objective. Results are compared to solutions obtained of MATPOWER software outcomes that employs sequential quadratic programming algorithm to solve the OPF. The impact of the proposed inequality constraint handling method in improving the HPSO performance is illustrated. Furthermore, a study of HPSO parameters tuning with regard to the OPF problem is presented and analyzed.
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.
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.001 | 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.001 | 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.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 it