An Adaptive Large Neighborhood Search Heuristic for the Electric Vehicle Routing Problems with Time Windows and Recharging Strategies

This study addresses a new electric vehicle routing problem with time windows and recharging strategies (EVRPTW-RS), where two recharging policies (i.e., full or partial recharging) and three recharging technologies (i.e., normal, rapid, and ultra-rapid) are considered. For this problem, we first de...

Full description

Saved in:
Bibliographic Details
Main Authors: Ya-ru Duan, Yong-shi Hu, Peng Wu
Format: Article
Language:English
Published: Wiley 2023-01-01
Series:Journal of Advanced Transportation
Online Access:http://dx.doi.org/10.1155/2023/1200526
Tags: Add Tag
No Tags, Be the first to tag this record!
_version_ 1832555300485332992
author Ya-ru Duan
Yong-shi Hu
Peng Wu
author_facet Ya-ru Duan
Yong-shi Hu
Peng Wu
author_sort Ya-ru Duan
collection DOAJ
description This study addresses a new electric vehicle routing problem with time windows and recharging strategies (EVRPTW-RS), where two recharging policies (i.e., full or partial recharging) and three recharging technologies (i.e., normal, rapid, and ultra-rapid) are considered. For this problem, we first develop a mixed-integer linear programming model defined in a series of vertices including a depot, a series of recharging stations, and a set of customers. Due to the strong NP-hardness of EVRPTW-RS, a tailored adaptive large neighborhood search heuristic (ALNS) which contains a number of advanced efficient procedures tailored to handle the proposed problem is developed. Numerical experiments for benchmark instances generated based on the Greater Toronto Area and Ontario in Canada are conducted to evaluate the performance of the proposed model and ALNS. Computational results demonstrate that the ALNS is highly effective in solving EVRPTW-RS and outperforms commercial solver CPLEX. Moreover, the advantages of the proposed recharging strategies are illustrated and some recommendations are provided for stakeholders when using electric vehicles for delivery.
format Article
id doaj-art-ff8550bc8c5f488c8a4bd470dfe5626c
institution Kabale University
issn 2042-3195
language English
publishDate 2023-01-01
publisher Wiley
record_format Article
series Journal of Advanced Transportation
spelling doaj-art-ff8550bc8c5f488c8a4bd470dfe5626c2025-02-03T05:48:36ZengWileyJournal of Advanced Transportation2042-31952023-01-01202310.1155/2023/1200526An Adaptive Large Neighborhood Search Heuristic for the Electric Vehicle Routing Problems with Time Windows and Recharging StrategiesYa-ru Duan0Yong-shi Hu1Peng Wu2School of Transportation EngineeringSchool of Transportation EngineeringSchool of Economics and ManagementThis study addresses a new electric vehicle routing problem with time windows and recharging strategies (EVRPTW-RS), where two recharging policies (i.e., full or partial recharging) and three recharging technologies (i.e., normal, rapid, and ultra-rapid) are considered. For this problem, we first develop a mixed-integer linear programming model defined in a series of vertices including a depot, a series of recharging stations, and a set of customers. Due to the strong NP-hardness of EVRPTW-RS, a tailored adaptive large neighborhood search heuristic (ALNS) which contains a number of advanced efficient procedures tailored to handle the proposed problem is developed. Numerical experiments for benchmark instances generated based on the Greater Toronto Area and Ontario in Canada are conducted to evaluate the performance of the proposed model and ALNS. Computational results demonstrate that the ALNS is highly effective in solving EVRPTW-RS and outperforms commercial solver CPLEX. Moreover, the advantages of the proposed recharging strategies are illustrated and some recommendations are provided for stakeholders when using electric vehicles for delivery.http://dx.doi.org/10.1155/2023/1200526
spellingShingle Ya-ru Duan
Yong-shi Hu
Peng Wu
An Adaptive Large Neighborhood Search Heuristic for the Electric Vehicle Routing Problems with Time Windows and Recharging Strategies
Journal of Advanced Transportation
title An Adaptive Large Neighborhood Search Heuristic for the Electric Vehicle Routing Problems with Time Windows and Recharging Strategies
title_full An Adaptive Large Neighborhood Search Heuristic for the Electric Vehicle Routing Problems with Time Windows and Recharging Strategies
title_fullStr An Adaptive Large Neighborhood Search Heuristic for the Electric Vehicle Routing Problems with Time Windows and Recharging Strategies
title_full_unstemmed An Adaptive Large Neighborhood Search Heuristic for the Electric Vehicle Routing Problems with Time Windows and Recharging Strategies
title_short An Adaptive Large Neighborhood Search Heuristic for the Electric Vehicle Routing Problems with Time Windows and Recharging Strategies
title_sort adaptive large neighborhood search heuristic for the electric vehicle routing problems with time windows and recharging strategies
url http://dx.doi.org/10.1155/2023/1200526
work_keys_str_mv AT yaruduan anadaptivelargeneighborhoodsearchheuristicfortheelectricvehicleroutingproblemswithtimewindowsandrechargingstrategies
AT yongshihu anadaptivelargeneighborhoodsearchheuristicfortheelectricvehicleroutingproblemswithtimewindowsandrechargingstrategies
AT pengwu anadaptivelargeneighborhoodsearchheuristicfortheelectricvehicleroutingproblemswithtimewindowsandrechargingstrategies
AT yaruduan adaptivelargeneighborhoodsearchheuristicfortheelectricvehicleroutingproblemswithtimewindowsandrechargingstrategies
AT yongshihu adaptivelargeneighborhoodsearchheuristicfortheelectricvehicleroutingproblemswithtimewindowsandrechargingstrategies
AT pengwu adaptivelargeneighborhoodsearchheuristicfortheelectricvehicleroutingproblemswithtimewindowsandrechargingstrategies