Stable matching-enhanced MOEA/D for solving multi-objective optimal power flow problems
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
Optimal Power Flow (OPF) plays a fundamental role in the secure and efficient management of power systems, both in system design and real-time operation. Existing OPF approaches often struggle with the problem’s non-linearity, non-convexity, and mixed-variable characteristics, which hinder convergence and compromise solution diversity. This paper addresses these challenges by applying a multi-objective evolutionary algorithm based on decomposition (MOEA/D) enhanced with stable matching theory . The proposed method ensures a balanced and effective trade-off between solution accuracy and diversity in multi-objective optimization. Comparative evaluations against well-established algorithms demonstrate the superior performance of the proposed approach in approximating the Pareto front, improving computational efficiency, and maintaining solution diversity. The results highlight the effectiveness of the method in addressing OPF problems with conflicting objectives such as cost minimization, loss reduction, and voltage stability enhancement. This research provides a new perspective on applying stable matching mechanisms into evolutionary algorithms for power system optimization.
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.000 | 0.000 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.000 | 0.001 |
| Science and technology studies | 0.000 | 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