Developing an Appropriate Energy Trading Algorithm and Techno-Economic Analysis between Peer-to-Peer within a Partly Independent Microgrid
Bibliographic record
Abstract
The intimidating surge in the procurement of Distributed Energy Resources (DER) has increased the number of prosumers, creating a new possibility of local energy trading across the community. This project aims to formulate the peer-to-peer energy (P2P) sharing model to encourage the DERs to share surplus energy among the consumers. An effective pricing method is developed based on the supply-demand ratio (SDR) with the importance of self-optimization, which allows the prosumers to maximize their energy sharing and profits. To implement this pricing method, a simplified dynamic matchmaking algorithm has been deployed to introduce the Outstanding Prosumer to interact with existing consumers to increase the efficiency and profitability of the trade network. Consumers also benefit from this model, as they can pick the most economical energy supplier instead of relying on the utility grid. The prosumer with high excess energy and the consumer with the highest energy demand will be prioritized to maintain the SDR ratio to one or greater than one. Here, all the above-stated features of the peer-to-peer energy trading have been demonstrated with some calculations to back up some tangible results. Finally, a case study is simulated among the residents of Dhaka, Bangladesh, to demonstrate how peers can profit from participating in trading at a given time. Comparing the results with and without P2P trading, there has been a 17.54% reduction in an electric bill on a typical day of July, and a 49.53% reduction in the interaction with the grid.
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.001 | 0.000 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.001 | 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 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".