Open AccessThe Electric Vehicle Routing Problem with Time Windows under Travel Time Uncertainty
Author(s) -
Dan Wang,
Hong Zhou
Publication year - 2021
Publication title -
journal of physics. conference series
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.21
H-Index - 85
eISSN - 1742-6596
pISSN - 1742-6588
DOI - 10.1088/1742-6596/2095/1/012032
Subject(s) - vehicle routing problem , computer science , mathematical optimization , metaheuristic , travel time , electric vehicle , routing (electronic design automation) , operations research , algorithm , engineering , transport engineering , mathematics , power (physics) , computer network , physics , quantum mechanics
Due to environmental friendliness, electric vehicles have become more and more popular nowadays in the transportation system. For many express companies, it is more and more important to meet the predetermined time window of customers. The uncertainty in travel times often causes uncertain energy consumption and uncertain recharging time, thus electric vehicles may miss the time windows of customers. Therefore, this paper addresses the electric vehicle routing problem with time windows under travel time uncertainty, which aims to determine the optimal delivery strategy under travel time uncertainty. To solve this problem, a robust optimization model is built based on the route-dependent uncertainty sets. However, considering the complexity of the problem, the robust model can only solve few instances including the small number of customers. Thus, a hybrid metaheuristic consisting of the adaptive large neighborhood search algorithm and the local search algorithm is proposed. The results show that the algorithm can obtain the optimal solution for the small-sized instances and the large-sized instances.