A bi-linear optimization model for collaborative energy management in smart grid
Bibliographic record
Abstract
This paper addresses the residential energy cost optimization problem in smart grid. More precisely, it proposes an approximate optimization model and evaluates its performance with an exact model. Previously, we developed an exact model which considers energy trading between the households in the microgrid. In the proposed approach, all households determine the microgrid energy price and quantity in collaboration with others. The complexity of the model was further increased when the unfair cost distribution problem among the households was addressed. The final model is a multi-objective non-convex Mixed Integer Non-Linear Programming (MINLP) problem. Its complexity is NP-hard which means that using the resulting solution is not practical because the solution times increase exponentially according to the increase in the problem size. To tackle this issue, this paper proposes an approximate model by using bi-linear optimization to reduce the computational complexity. The bilinear model breaks down the MINLP model into multiple Mixed Integer Linear Programming (MILP) modules and iteratively solves these modules until it meets the terminating criterion. Results show that solution times of the bi-linear model are very low compared to the exact model. Moreover, 97% of the solutions generated by the bi-linear model are optimal solutions. The proposed model maintains Pareto optimality which means that no households will be worse off to improve the cost of others. The final solution minimizes the total cost of the households in the microgrid.
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.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 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".