IDEAS home Printed from https://ideas.repec.org/a/taf/tprsxx/v60y2022i13p4268-4294.html
   My bibliography  Save this article

Electric vehicle routing problem with flexible deliveries

Author

Listed:
  • Mir Ehsan Hesam Sadati
  • Vahid Akbari
  • Bülent Çatay

Abstract

Growing concerns about the climate change have forced governments to initiate tighter environmental regulations and tougher emission reduction targets, increasing the interest on electromobility. Logistics operators started employing electric vehicles (EVs) and must face new operational planning challenges. Moreover, with an ever-growing interest in e-commerce, parcel delivery is taking new shapes by offering flexible delivery options to the customers. To mitigate these issues, we introduce the Electric Vehicle Routing Problem with Flexible Deliveries (EVRP-FD), where the customers are served using a fleet of EVs that can recharge their batteries along their routes. In this problem, a customer may specify different delivery locations for different time windows. Our objective is to serve the customers while minimising the total travelled distance using minimum number of vehicles. We first give the mathematical model and then develop a hybrid Variable Neighbourhood Search coupled with Tabu Search by proposing new mechanisms to solve the problem effectively. Then, we verify the performance of our algorithm on instances from the literature. We also introduce new instances for the EVRP-FD and perform an extensive computational study to investigate the trade-offs associated with different operational factors. Finally, we present a case study in Nottingham, UK to provide further insights.

Suggested Citation

  • Mir Ehsan Hesam Sadati & Vahid Akbari & Bülent Çatay, 2022. "Electric vehicle routing problem with flexible deliveries," International Journal of Production Research, Taylor & Francis Journals, vol. 60(13), pages 4268-4294, July.
  • Handle: RePEc:taf:tprsxx:v:60:y:2022:i:13:p:4268-4294
    DOI: 10.1080/00207543.2022.2032451
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1080/00207543.2022.2032451
    Download Restriction: Access to full text is restricted to subscribers.

    File URL: https://libkey.io/10.1080/00207543.2022.2032451?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.

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Du, Jianhui & Zhang, Zhiqin & Wang, Xu & Lau, Hoong Chuin, 2023. "A hierarchical optimization approach for dynamic pickup and delivery problem with LIFO constraints," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 175(C).
    2. Vahid Akbari & İhsan Sadati & F. Sibel Salman & Davood Shiri, 2023. "Minimizing total weighted latency in home healthcare routing and scheduling with patient prioritization," OR Spectrum: Quantitative Approaches in Management, Springer;Gesellschaft für Operations Research e.V., vol. 45(3), pages 807-852, September.
    3. Liu, Lujie & Xiao, Yiyong & Yang, Jun, 2024. "Daily optimization of maintenance routing and scheduling in a large-scale photovoltaic power plant with time-varying output power," Applied Energy, Elsevier, vol. 360(C).
    4. Seyfi, Majid & Alinaghian, Mahdi & Ghorbani, Erfan & Çatay, Bülent & Saeid Sabbagh, Mohammad, 2022. "Multi-mode hybrid electric vehicle routing problem," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 166(C).

    More about this item

    Statistics

    Access and download statistics

    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:taf:tprsxx:v:60:y:2022:i:13:p:4268-4294. 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: Chris Longhurst (email available below). General contact details of provider: http://www.tandfonline.com/TPRS20 .

    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.