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

Location-routing optimization problem for electric vehicle charging stations in an uncertain transportation network: An adaptive co-evolutionary clustering algorithm

Author

Listed:
  • Wu, Jiabin
  • Li, Qihang
  • Bie, Yiming
  • Zhou, Wei

Abstract

The rapid growth of Electric Vehicles (EVs) has led to issues such as insufficient and unevenly distributed charging stations, posing an increasingly severe challenge. This not only means higher economic and time costs for EV users traveling to charging stations, but also indicates that EVs need to incur additional energy consumption. To address these challenges, this paper first establishes an extended space-time-state network to describe the temporal variability and uncertainty of the traffic environment. Secondly, considering the impact of the energy consumption incurred by EVs traveling to charging stations (CSs) on the layout of CSs, a co-evolutionary optimization model of the location-routing problem is proposed. To solve the model, a two-stage Adaptive Co-evolutionary Clustering Algorithm (ACECA) integrating an adaptive clustering framework and a co-evolutionary mechanism is designed. Finally, the experiment results indicate that there exists a game between a short-term economic investment and long-term benefits of energy conservation and emission reduction. Moreover, ACECA demonstrates stronger solution performance and robustness compared to other algorithms, with the resulting CS location schemes showing superior advantages in energy conservation and in cost saving for users. The research findings can provide theoretical support for the planning of charging station locations for electric vehicles.

Suggested Citation

  • Wu, Jiabin & Li, Qihang & Bie, Yiming & Zhou, Wei, 2024. "Location-routing optimization problem for electric vehicle charging stations in an uncertain transportation network: An adaptive co-evolutionary clustering algorithm," Energy, Elsevier, vol. 304(C).
  • Handle: RePEc:eee:energy:v:304:y:2024:i:c:s0360544224019169
    DOI: 10.1016/j.energy.2024.132142
    as

    Download full text from publisher

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

    File URL: https://libkey.io/10.1016/j.energy.2024.132142?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:energy:v:304:y:2024:i:c:s0360544224019169. 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.journals.elsevier.com/energy .

    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.