IDEAS home Printed from https://ideas.repec.org/a/eee/ejores/v315y2024i3p926-951.html
   My bibliography  Save this article

An exact algorithm for maximum electric vehicle flow coverage problem with heterogeneous chargers, nonlinear charging time and route deviations

Author

Listed:
  • Park, Hyunwoo
  • Lee, Chungmok

Abstract

Typical electric vehicles (EVs) should be recharged multiple times to reach a long distance due to the limited travel ranges. The EV flow covering problem determines the locations of charging stations to maximize the “covered” OD flows, respecting a given budget for the new charging stations. This paper proposes an exact algorithm for solving the problem by considering the heterogeneous EV chargers, nonlinear charging time, and route deviations from the shortest distance paths. We develop an exact Benders decomposition-based algorithm, in which the Benders subproblem utilizes a nested cut-generation via a customized labeling algorithm. Two methods for solving the Benders subproblem are developed, which are combined to accelerate the Benders cut generation. In addition, we present a heuristic algorithm based on the proposed exact algorithm for the larger-sized problems. The computational results show that the proposed algorithm could solve real-life problems. Especially, the heuristic algorithm could solve problems up to 339 nodes and 500 km of the EV’s travel range. The extensive computational study shows that addressing the multiple charger types, the charging time, and the deviation routes can be crucial to provide realistic charging infrastructure for EVs.

Suggested Citation

  • Park, Hyunwoo & Lee, Chungmok, 2024. "An exact algorithm for maximum electric vehicle flow coverage problem with heterogeneous chargers, nonlinear charging time and route deviations," European Journal of Operational Research, Elsevier, vol. 315(3), pages 926-951.
    • Handle: RePEc:eee:ejores:v:315:y:2024:i:3:p:926-951
    DOI: 10.1016/j.ejor.2023.12.019
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0377221723009529
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.ejor.2023.12.019?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:ejores:v:315:y:2024:i:3:p:926-951. 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/locate/eor .

    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.