A Non-Iterative Algorithm for Clearing Two-Layer Energy-Sharing Markets with Voltage Constraints
Fuente:
arXiv
Saved in:
| Main Authors: | , , , |
|---|---|
| Format: | Preprint |
| Published: |
2026
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866911709083467776 |
|---|---|
| author | Liu, Tonghua Su, Yifan Wang, Zhaojian Liu, Feng |
| author_facet | Liu, Tonghua Su, Yifan Wang, Zhaojian Liu, Feng |
| contents | Real-time hierarchical energy-sharing markets are promising to coordinate large numbers of prosumers. Still, most existing clearing methods rely on linearized or DC power-flow models and do not explicitly handle reactive power or voltage-security constraints. With AC network constraints, the problem becomes a large-scale bilevel Mathematical Program with Equilibrium Constraints (MPEC) that is difficult to solve in real time. This paper develops a non-iterative clearing algorithm for two-layer energy-sharing markets with voltage constraints. We first derive an efficient best-response function for each lower-layer energy-sharing market and reduce the equilibrium search to one dimension by exploiting the pricing-coupling structure. We then embed this function into the upper-layer network-constrained problem and reformulate the bilevel MPEC as a single-level mixed-integer second-order cone program (MISOCP), which is computationally tractable. Case studies on the IEEE 123-bus system with 12,300 prosumers show that the proposed method preserves nodal voltages within prescribed limits and delivers solutions with maximum errors below 0.01\% in 0.829 s. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2605_23671 |
| institution | arXiv |
| publishDate | 2026 |
| record_format | arxiv |
| spellingShingle | A Non-Iterative Algorithm for Clearing Two-Layer Energy-Sharing Markets with Voltage Constraints Liu, Tonghua Su, Yifan Wang, Zhaojian Liu, Feng Optimization and Control Systems and Control Real-time hierarchical energy-sharing markets are promising to coordinate large numbers of prosumers. Still, most existing clearing methods rely on linearized or DC power-flow models and do not explicitly handle reactive power or voltage-security constraints. With AC network constraints, the problem becomes a large-scale bilevel Mathematical Program with Equilibrium Constraints (MPEC) that is difficult to solve in real time. This paper develops a non-iterative clearing algorithm for two-layer energy-sharing markets with voltage constraints. We first derive an efficient best-response function for each lower-layer energy-sharing market and reduce the equilibrium search to one dimension by exploiting the pricing-coupling structure. We then embed this function into the upper-layer network-constrained problem and reformulate the bilevel MPEC as a single-level mixed-integer second-order cone program (MISOCP), which is computationally tractable. Case studies on the IEEE 123-bus system with 12,300 prosumers show that the proposed method preserves nodal voltages within prescribed limits and delivers solutions with maximum errors below 0.01\% in 0.829 s. |
| title | A Non-Iterative Algorithm for Clearing Two-Layer Energy-Sharing Markets with Voltage Constraints |
| topic | Optimization and Control Systems and Control |
| url | https://arxiv.org/abs/2605.23671 |