A Computationally Efficient Method for Energy Allocation in Spot Markets With Application to Transactive Energy Systems
Bibliographic record
Abstract
Spot markets provide an interesting opportunity for profit maximization by energy trading based on immediate decisions on participant bids. However, their short market-clearing time can affect computational efficiency, search space, and reliability of price-energy allocation to bidding participants. Accordingly, developing a prompt and effective decision-making process plays a vital role in smooth energy delivery in these markets. This paper proposes an approach to alleviate the computational cost of the spot market aggregator in order to decide price-energy bids. The proposed bidding model is developed for the transactive energy systems, where the spot market aggregator utilizes the proposed method to maximize profit by choosing participants’ demand-side bids. The proposed method can efficiently manage participants’ combined energy and price information and avoid a highly complicated search space. It takes advantage of the multi-variable Taylor series approximation to create users’ individual cost functions. The approximated cost functions lead to user-specific bids that expedite the spot market transaction while maintaining aggregator profit. The resultant system is able to exercise profit maximization with high performance within milliseconds. The efficiency of this scheme is also demonstrated through a comparative study by using the particle swarm optimization method.
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.002 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.001 | 0.001 |
| Science and technology studies | 0.001 | 0.001 |
| 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.004 | 0.001 |
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".