A Time-Dependent Electric Vehicle Routing Problem With Congestion Tolls
Ruiyou Zhang, Jingmei Guo, Junwei Wang
Abstract
Scheduling the recharging of electric vehicle fleets under different scenarios is an important but open problem. One important scenario is that vehicles travel at different speeds in different periods since traffic congestion is common in urban areas nowadays. Therefore, in this article, a novel time-dependent electric vehicle routing problem with congestion tolls is proposed. If a vehicle enters a peak period, a fixed congestion toll needs to be paid in this problem. A mixed integer linear programming model is established and an adaptive large neighborhood search (ALNS) heuristic is designed to solve the model. The model and solving method are validated and evaluated extensively with benchmark instances. Results indicate that a certain level of congestion tolls could prevent vehicles from entering peak periods and relieve road congestions significantly. Furthermore, the ALNS heuristic could provide much better solutions for the problem than typical optimization software, such as Gurobi, in much shorter running time.