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

A personalized network-aware price design for electric vehicle charging using a sequential Stackelberg game

Author

Listed:
  • Cheng, Rui
  • Liu, Gengming
  • Liu, Wenxia
  • Shi, Qingxin
  • Chen, Qifang

Abstract

This study develops a personalized network-aware price design for electric vehicle (EV) charging in an unbalanced distribution network to achieve the social welfare maximization while respecting distribution network constraints. Under this price design, the independent distribution system operator (IDSO), as the leader, and aggregators, as followers, engage in a sequential Stackelberg game to determine the personalized network-aware retail price profiles and the EV charging schedules for customers. This design integrates not only network-level constraints, including peak demand limits, voltage limits, and line congestion limits, into the personalized network-aware retail price profiles, but also customer-level personalized preference, attribute and locational information, leading to an informative structure of those retail price profiles. Finally, the convergence and optimality properties of this design, based on the fast dual decomposition algorithm, are established.

Suggested Citation

  • Cheng, Rui & Liu, Gengming & Liu, Wenxia & Shi, Qingxin & Chen, Qifang, 2025. "A personalized network-aware price design for electric vehicle charging using a sequential Stackelberg game," Applied Energy, Elsevier, vol. 381(C).
    • Handle: RePEc:eee:appene:v:381:y:2025:i:c:s0306261924025297
    DOI: 10.1016/j.apenergy.2024.125145
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0306261924025297
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.apenergy.2024.125145?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:381:y:2025:i:c:s0306261924025297. 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.