IDEAS home Printed from https://ideas.repec.org/a/gam/jeners/v16y2023i12p4576-d1166120.html
   My bibliography  Save this article

Large Neighborhood Search for Electric Vehicle Fleet Scheduling

Author

Listed:
  • Steffen Limmer

    (Honda Research Institute Europe GmbH, 63073 Offenbach, Germany)

  • Johannes Varga

    (Institute of Logic and Computation, Vienna University of Technology, 1040 Vienna, Austria)

  • Günther Robert Raidl

    (Institute of Logic and Computation, Vienna University of Technology, 1040 Vienna, Austria)

Abstract

This work considers the problem of planning how a fleet of shared electric vehicles is charged and used for serving a set of reservations. While exact approaches can be used to efficiently solve small to medium-sized instances of this problem, heuristic approaches have been demonstrated to be superior in larger instances. The present work proposes a large neighborhood search approach for solving this problem, which employs a mixed integer linear programming-based repair operator. Three variants of the approach using different destroy operators are evaluated on large instances of the problem. The experimental results show that the proposed approach significantly outperforms earlier state-of-the-art methods on this benchmark set by obtaining solutions with up to 8.5% better objective values.

Suggested Citation

  • Steffen Limmer & Johannes Varga & Günther Robert Raidl, 2023. "Large Neighborhood Search for Electric Vehicle Fleet Scheduling," Energies, MDPI, vol. 16(12), pages 1-14, June.
  • Handle: RePEc:gam:jeners:v:16:y:2023:i:12:p:4576-:d:1166120
    as

    Download full text from publisher

    File URL: https://www.mdpi.com/1996-1073/16/12/4576/pdf
    Download Restriction: no

    File URL: https://www.mdpi.com/1996-1073/16/12/4576/
    Download Restriction: no
    ---><---

    References listed on IDEAS

    as
    1. Guy Desaulniers & Fausto Errico & Stefan Irnich & Michael Schneider, 2016. "Exact Algorithms for Electric Vehicle-Routing Problems with Time Windows," Operations Research, INFORMS, vol. 64(6), pages 1388-1405, December.
    2. Bongiovanni, Claudia & Kaspi, Mor & Geroliminis, Nikolas, 2019. "The electric autonomous dial-a-ride problem," Transportation Research Part B: Methodological, Elsevier, vol. 122(C), pages 436-456.
    3. Benjamin Schaden & Thomas Jatschka & Steffen Limmer & Günther Robert Raidl, 2021. "Smart Charging of Electric Vehicles Considering SOC-Dependent Maximum Charging Powers," Energies, MDPI, vol. 14(22), pages 1-33, November.
    4. Michael Schneider & Andreas Stenger & Dominik Goeke, 2014. "The Electric Vehicle-Routing Problem with Time Windows and Recharging Stations," Transportation Science, INFORMS, vol. 48(4), pages 500-520, November.
    5. Maksymilian Mądziel & Tiziana Campisi, 2023. "Energy Consumption of Electric Vehicles: Analysis of Selected Parameters Based on Created Database," Energies, MDPI, vol. 16(3), pages 1-18, February.
    6. Ilham Naharudinsyah & Steffen Limmer, 2018. "Optimal Charging of Electric Vehicles with Trading on the Intraday Electricity Market," Energies, MDPI, vol. 11(6), pages 1-12, June.
    7. Schneider, M. & Stenger, A. & Goeke, D., 2014. "The Electric Vehicle Routing Problem with Time Windows and Recharging Stations," Publications of Darmstadt Technical University, Institute for Business Studies (BWL) 62382, Darmstadt Technical University, Department of Business Administration, Economics and Law, Institute for Business Studies (BWL).
    8. Su, Yue & Dupin, Nicolas & Puchinger, Jakob, 2023. "A deterministic annealing local search for the electric autonomous dial-a-ride problem," European Journal of Operational Research, Elsevier, vol. 309(3), pages 1091-1111.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Cortés-Murcia, David L. & Prodhon, Caroline & Murat Afsar, H., 2019. "The electric vehicle routing problem with time windows, partial recharges and satellite customers," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 130(C), pages 184-206.
    2. LIAN, Ying & LUCAS, Flavien & SÖRENSEN, Kenneth, 2022. "The electric on-demand bus routing problem with partial charging and nonlinear functions," Working Papers 2022005, University of Antwerp, Faculty of Business and Economics.
    3. Ma, Tai-Yu & Fang, Yumeng & Connors, Richard D. & Viti, Francesco & Nakao, Haruko, 2024. "A hybrid metaheuristic to optimize electric first-mile feeder services with charging synchronization constraints and customer rejections," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 185(C).
    4. Su, Yue & Dupin, Nicolas & Puchinger, Jakob, 2023. "A deterministic annealing local search for the electric autonomous dial-a-ride problem," European Journal of Operational Research, Elsevier, vol. 309(3), pages 1091-1111.
    5. Zhang, Li & Liu, Zhongshan & Yu, Lan & Fang, Ke & Yao, Baozhen & Yu, Bin, 2022. "Routing optimization of shared autonomous electric vehicles under uncertain travel time and uncertain service time," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 157(C).
    6. Zhou, Yu & Meng, Qiang & Ong, Ghim Ping, 2022. "Electric Bus Charging Scheduling for a Single Public Transport Route Considering Nonlinear Charging Profile and Battery Degradation Effect," Transportation Research Part B: Methodological, Elsevier, vol. 159(C), pages 49-75.
    7. Roel M. Post & Paul Buijs & Michiel A. J. uit het Broek & Jose A. Lopez Alvarez & Nick B. Szirbik & Iris F. A. Vis, 2018. "A solution approach for deriving alternative fuel station infrastructure requirements," Flexible Services and Manufacturing Journal, Springer, vol. 30(3), pages 592-607, September.
    8. Ana Bricia Galindo-Muro & Riccardo Cespi & Stephany Isabel Vallarta-Serrano, 2023. "Applications of Electric Vehicles in Instant Deliveries," Energies, MDPI, vol. 16(4), pages 1-18, February.
    9. Tengkuo Zhu & Stephen D. Boyles & Avinash Unnikrishnan, 2024. "Battery Electric Vehicle Traveling Salesman Problem with Drone," Networks and Spatial Economics, Springer, vol. 24(1), pages 49-97, March.
    10. Timothy M. Sweda & Irina S. Dolinskaya & Diego Klabjan, 2017. "Adaptive Routing and Recharging Policies for Electric Vehicles," Transportation Science, INFORMS, vol. 51(4), pages 1326-1348, November.
    11. Raeesi, Ramin & Zografos, Konstantinos G., 2020. "The electric vehicle routing problem with time windows and synchronised mobile battery swapping," Transportation Research Part B: Methodological, Elsevier, vol. 140(C), pages 101-129.
    12. Alberto Ceselli & Ángel Felipe & M. Teresa Ortuño & Giovanni Righini & Gregorio Tirado, 2021. "A Branch-and-Cut-and-Price Algorithm for the Electric Vehicle Routing Problem with Multiple Technologies," SN Operations Research Forum, Springer, vol. 2(1), pages 1-33, March.
    13. Maximilian Schiffer & Michael Schneider & Grit Walther & Gilbert Laporte, 2019. "Vehicle Routing and Location Routing with Intermediate Stops: A Review," Transportation Science, INFORMS, vol. 53(2), pages 319-343, March.
    14. Raeesi, Ramin & Zografos, Konstantinos G., 2022. "Coordinated routing of electric commercial vehicles with intra-route recharging and en-route battery swapping," European Journal of Operational Research, Elsevier, vol. 301(1), pages 82-109.
    15. Azra Ghobadi & Mohammad Fallah & Reza Tavakkoli-Moghaddam & Hamed Kazemipoor, 2022. "A Fuzzy Two-Echelon Model to Optimize Energy Consumption in an Urban Logistics Network with Electric Vehicles," Sustainability, MDPI, vol. 14(21), pages 1-31, October.
    16. Rui Chen & Xinglu Liu & Lixin Miao & Peng Yang, 2020. "Electric Vehicle Tour Planning Considering Range Anxiety," Sustainability, MDPI, vol. 12(9), pages 1-17, May.
    17. Koyuncu, Işıl & Yavuz, Mesut, 2019. "Duplicating nodes or arcs in green vehicle routing: A computational comparison of two formulations," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 122(C), pages 605-623.
    18. Asghari, Mohammad & Mirzapour Al-e-hashem, S. Mohammad J., 2021. "Green vehicle routing problem: A state-of-the-art review," International Journal of Production Economics, Elsevier, vol. 231(C).
    19. Zu-Jun Ma & Fei Yang & Ying Dai & Zuo-Jun Max Shen, 2021. "The Migratory Beekeeping Routing Problem: Model and an Exact Algorithm," INFORMS Journal on Computing, INFORMS, vol. 33(1), pages 319-335, January.
    20. Amirmahdi Tafreshian & Neda Masoud & Yafeng Yin, 2020. "Frontiers in Service Science: Ride Matching for Peer-to-Peer Ride Sharing: A Review and Future Directions," Service Science, INFORMS, vol. 12(2-3), pages 44-60, June.

    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:gam:jeners:v:16:y:2023:i:12:p:4576-:d:1166120. 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.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with 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: MDPI Indexing Manager (email available below). General contact details of provider: https://www.mdpi.com .

    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.