An Electric Vehicle(EV)is an appropriate substitution for traditional transportation means for diminishing greenhouse gas emissions.However,decision-makers are beset by the limited driving range caused by the low batt...An Electric Vehicle(EV)is an appropriate substitution for traditional transportation means for diminishing greenhouse gas emissions.However,decision-makers are beset by the limited driving range caused by the low battery capacity and the long recharging time.To resolve the former issue,several transportation companies increases the travel distance of the EV by establishing recharging stations in various locations.The proposed Electric Vehicle-Routing Problem with Time Windows(E-VRPTW)and recharging stations are constructed in this context;it augments the VRPTW by reinforcing battery capacity constraints.Meanwhile,super-recharging stations are gradually emerging in the surroundings.They can decrease the recharging time for an EV but consume more energy than regular stations.In this paper,we first extend the E-VRPRTW by adding the elements of super-recharging stations.We then apply a two-stage heuristic algorithm driven by a dynamic programming process to solve the new proposed problem to minimize the travel and total recharging costs.Subsequently,we compare the experimental results of this approach with other algorithms on several sets of benchmark instances.Furthermore,we analyze the impact of super-recharging stations on the total cost of the logistic plan.展开更多
Over the past decade,electric vehicles(EVs)have been considered in a growing number of models and methods for vehicle routing problems(VRPs).This study presents a comprehensive survey of EV routing problems and their ...Over the past decade,electric vehicles(EVs)have been considered in a growing number of models and methods for vehicle routing problems(VRPs).This study presents a comprehensive survey of EV routing problems and their many variants.We only consider the problems in which each vehicle may visit multiple vertices and be recharged during the trip.The related literature can be roughly divided into nine classes:Electric traveling salesman problem,green VRP,electric VRP,mixed electric VRP,electric location routing problem,hybrid electric VRP,electric dial-a-ride problem,electric two-echelon VRP,and electric pickup and delivery problem.For each of these nine classes,we focus on reviewing the settings of problem variants and the algorithms used to obtain their solutions.展开更多
基金supported by the Science and Technology Innovation Team of Shaanxi Province(No.2023-CX-TD07)the Special Project in Major Fields of Guangdong Universities(No.2021ZDZX1019)+4 种基金the Major Projects of Guangdong Education Department for Foundation Research and Applied Research(Nos.2017KZDXM081 and 2018KZDXM066)the Guangdong Provincial University Innovation Team Project(No.2020KCXTD045)the Hunan Key Laboratory of Intelligent Decision-making Technology for Emergency Management(No.2020TP1013)the Research Topic of China Logistics Association and China Federation of Logistics and Purchasing(No.2022CSLKT3-151)National Social Science Fund Project(No.22BJL114).
文摘An Electric Vehicle(EV)is an appropriate substitution for traditional transportation means for diminishing greenhouse gas emissions.However,decision-makers are beset by the limited driving range caused by the low battery capacity and the long recharging time.To resolve the former issue,several transportation companies increases the travel distance of the EV by establishing recharging stations in various locations.The proposed Electric Vehicle-Routing Problem with Time Windows(E-VRPTW)and recharging stations are constructed in this context;it augments the VRPTW by reinforcing battery capacity constraints.Meanwhile,super-recharging stations are gradually emerging in the surroundings.They can decrease the recharging time for an EV but consume more energy than regular stations.In this paper,we first extend the E-VRPRTW by adding the elements of super-recharging stations.We then apply a two-stage heuristic algorithm driven by a dynamic programming process to solve the new proposed problem to minimize the travel and total recharging costs.Subsequently,we compare the experimental results of this approach with other algorithms on several sets of benchmark instances.Furthermore,we analyze the impact of super-recharging stations on the total cost of the logistic plan.
基金This work was partially supported by the National Natural Science Foundation of China(Grant Nos.71971090,71571077,and 71531009).
文摘Over the past decade,electric vehicles(EVs)have been considered in a growing number of models and methods for vehicle routing problems(VRPs).This study presents a comprehensive survey of EV routing problems and their many variants.We only consider the problems in which each vehicle may visit multiple vertices and be recharged during the trip.The related literature can be roughly divided into nine classes:Electric traveling salesman problem,green VRP,electric VRP,mixed electric VRP,electric location routing problem,hybrid electric VRP,electric dial-a-ride problem,electric two-echelon VRP,and electric pickup and delivery problem.For each of these nine classes,we focus on reviewing the settings of problem variants and the algorithms used to obtain their solutions.
