scholarly journals The Electric Vehicle Routing Problem with Time Windows under Travel Time Uncertainty

2021 ◽  
Vol 2095 (1) ◽  
pp. 012032
Author(s):  
Dan Wang ◽  
Hong Zhou

Abstract 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.

2017 ◽  
Vol 2017 ◽  
pp. 1-13 ◽  
Author(s):  
Shifeng Chen ◽  
Rong Chen ◽  
Jian Gao

The Vehicle Routing Problem (VRP) is a classical combinatorial optimization problem. It is usually modelled in a static fashion; however, in practice, new requests by customers arrive after the initial workday plan is in progress. In this case, routes must be replanned dynamically. This paper investigates the Dynamic Vehicle Routing Problem with Time Windows (DVRPTW) in which customers’ requests either can be known at the beginning of working day or occur dynamically over time. We propose a hybrid heuristic algorithm that combines the harmony search (HS) algorithm and the Variable Neighbourhood Descent (VND) algorithm. It uses the HS to provide global exploration capabilities and uses the VND for its local search capability. In order to prevent premature convergence of the solution, we evaluate the population diversity by using entropy. Computational results on the Lackner benchmark problems show that the proposed algorithm is competitive with the best existing algorithms from the literature.


2021 ◽  
Vol 15 (4/5) ◽  
pp. 444
Author(s):  
Zhenping Li ◽  
Guohua Wu ◽  
Ke Zhang ◽  
Shuxuan Li ◽  
Chenglin Xiao ◽  
...  

Sign in / Sign up

Export Citation Format

Share Document