4.7 Article

Optimal dispatching of electric vehicles for providing charging on-demand service leveraging charging-on-the-move technology

出版社

PERGAMON-ELSEVIER SCIENCE LTD
DOI: 10.1016/j.trc.2022.103968

关键词

Electric vehicles; Mobile vehicle-to-vehicle charging; Vehicle routing problem

向作者/读者索取更多资源

Range anxiety and charging infrastructure scarcity are the main challenges for electric vehicle (EV) adoption. The mobile electric-vehicle-to-electric-vehicle (mE2) charging technology offers a solution by allowing EVs to charge each other on the move. This paper focuses on the efficient pairing and routing of electricity providers to demand by extending the Charging-as-a-Service (CaaS) strategy to mE2 charging service (CaaS(+)). The proposed Clustering-aid Decomposition and Merging (c-DM) algorithm optimizes the dispatch of electricity providers to serve the demand.
Range anxiety and charging infrastructure scarcity have been the main challenges for the mass adoption of electric vehicles (EVs). The emerging mobile electric-vehicle-to-electric-vehicle (mE2) charging technology offers a promising solution, which combines battery-to-battery and connected and autonomous vehicle technologies to enable an EV with an extra battery to charge another EV on the move. This paper focuses on the efficient pairing and routing of electricity providers (EPs) to demand (EDs) by extending the existing Charging-as-a-Service (CaaS) strategy to the mE2 charging service (referred to as CaaS(+)). We investigate the EP fleet management problem, which is mathematically modeled as a vehicle routing problem (i.e., mE2-VRP), aiming to optimally dispatch the minimum number of EPs to approach and serve the EDs. To adapt mE2 charging strategy to the online service involving large-scale EDs in practice, we develop a Clustering-aid Decomposition and Merging (c-DM) algorithm. It clusters the EDs according to their coalition potential so that we can decompose a large-scale mE2-VRP into smaller sub-problems which can be efficiently solved by parallel computing. Our numerical experiments built upon citywide (Chicago) and statewide (Florida) case studies confirm the efficiency of the proposed c-DM algorithm. It enables us to investigate the performance of CaaS(+) under a realistic large-scale setup. The results show that CaaS(+) will be applied in different proportions of EV flows to save EDs' travel time and mitigate traffic congestion to different extents in different network congestion and charging station coverage scenarios. The sensitivity analyses of EDs' energy inventory and range anxiety also provide some hints and suggestions for improving the service efficiency of CaaS(+).

作者

我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。

评论

主要评分

4.7
评分不足

次要评分

新颖性
-
重要性
-
科学严谨性
-
评价这篇论文

推荐

暂无数据
暂无数据