IDEAS home Printed from https://ideas.repec.org/a/eee/appene/v368y2024ics0306261924004227.html
   My bibliography  Save this article

Domestic P2P energy market design considering network reconfiguration and usage fees: Bi-level nonlinear programming and exact clearing algorithm

Author

Listed:
  • Li, Junkai
  • Ge, Shaoyun
  • Liu, Hong
  • Wang, Chengshan
  • Li, Huiqiang
  • Wang, Liyong

Abstract

The wide utilization of network reconfiguration brings new challenges to domestic peer-to-peer (P2P) energy market. Specifically, flexible and changeable system topology has a profound impact on electricity distance-based network charges which increases the difficulty in market participants' decision-making. To address this issue, the authors propose a hierarchical P2P energy market framework which integrates network reconfiguration and virtual P2P power flow-based network usage fee (NUF) mechanism. Then, this framework is modelled as a bi-level nonlinear programming which reflects the complex interation between system topology, network charges and stakeholders' strategies. In the upper-level, distribution system operator (DSO) aims to maximize its economic benefits and ensure network security through network reconfiguration. In the lower-level, prosumers form a cooperative coalition to obtain their own optimal strategies (i.e., join in P2P trading or transact with DSO) under network charge mechanism. Furthermore, a model formulation method and a sample-based algorithm are presented to clear the domestic P2P energy market and ensure the convergence. Numerical results demonstrate that the proposed market achieves a win-win situation for both prosumers and DSO. Meanwhile, the proposed reformulation method and solution algorithm not only guarantee the global optimality under finite iterations, but also possess high computational efficiency.

Suggested Citation

  • Li, Junkai & Ge, Shaoyun & Liu, Hong & Wang, Chengshan & Li, Huiqiang & Wang, Liyong, 2024. "Domestic P2P energy market design considering network reconfiguration and usage fees: Bi-level nonlinear programming and exact clearing algorithm," Applied Energy, Elsevier, vol. 368(C).
  • Handle: RePEc:eee:appene:v:368:y:2024:i:c:s0306261924004227
    DOI: 10.1016/j.apenergy.2024.123039
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0306261924004227
    Download Restriction: Full text for ScienceDirect subscribers only

    File URL: https://libkey.io/10.1016/j.apenergy.2024.123039?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:eee:appene:v:368:y:2024:i:c:s0306261924004227. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/wps/find/journaldescription.cws_home/405891/description#description .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.