Geographical Peer Matching for P2P Energy Sharing
Romaric Duvignau, Vincenzo Gulisano, Marina Papatriantafilou, Ralf, Klasing

TL;DR
This paper presents a mathematical model and heuristics for geographically matching energy peers in P2P energy sharing systems, demonstrating cost-effective and computationally efficient solutions based on real-world data.
Contribution
It introduces a novel mathematical model and scalable heuristics for geographically peer matching in P2P energy sharing, addressing computational challenges.
Findings
Efficient cost savings achieved in real-world energy data simulations.
Algorithms reduce communication and computing requirements.
Scalable solutions enable practical large-scale energy communities.
Abstract
Significant cost reductions attract ever more households to invest in small-scale renewable electricity generation and storage. Such distributed resources are not used in the most effective way when only used individually, as sharing them provides even greater cost savings. Energy Peer-to-Peer (P2P) systems have thus been shown to be beneficial for prosumers and consumers through reductions in energy cost while also being attractive to grid or service providers. However, many practical challenges have to be overcome before all players could gain in having efficient and automated local energy communities; such challenges include the inherent complexity of matching together geographically distributed peers and the significant computations required to calculate the local matching preferences. Hence dedicated algorithms are required to be able to perform a cost-efficient matching of…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsSmart Grid Energy Management · Transportation and Mobility Innovations · Caching and Content Delivery
