4.7 Article

An Extended M/M/K/K Queueing Model to Analyze the Profit of a Multiservice Electric Vehicle Charging Station

期刊

IEEE TRANSACTIONS ON VEHICULAR TECHNOLOGY
卷 70, 期 4, 页码 3007-3016

出版社

IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC
DOI: 10.1109/TVT.2021.3063887

关键词

Electric vehicle; scheduling; markov chain; queuing theory; battery swapping; optimization

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

The recent trend in plug-in electric vehicles involves investing in public charging stations to allow for battery charging and potentially generate profits. Various scheduling algorithms are used to optimize the use of resources at the charging stations and cater to different customer requirements. A comprehensive model for maximizing profits at multi-service charging stations is introduced, along with a mixed-integer linear programming problem for scheduling vehicle charging and discharging. Simulation results show increased profit and reduced vehicle delay with an increase in battery swapping requests.
Recent trends in plug-in electric vehicles (PEVs) include the investment in public charging stations (PCS) construction, wherein PEVs can charge their batteries, and PCS owners can make profits. Scheduling algorithms used in the PCS can optimally assign PCS resources to the vehicles in order to maximize their profit. Although the main purpose of the PCS is to provide charging capability, it needs to address other customer requirements such as different deadline constraints, battery swapping, and vehicle to grid (V2G). In this paper, we introduce a comprehensive model for multiservice PCS profit maximization in which battery charging, discharging, and swapping services are included. The model has been used in formulating a mixed-integer linear programming (MILP) problem wherein charging and discharging of vehicles are scheduled to maximize the PCS profit. We utilize queuing theory to analyze the performance of the model at the presence of random variables such as solar power, electricity price, state of charge (SoC), amount of discharge (AoD), battery capacity, and vehicle arrival time to the PCS. Low complexity and near-optimal online scheduling algorithm is proposed to complete the offline scheduling solution. Our simulation results show that more profit for the PCS and less delay for vehicles are better achieved when the number of vehicles requesting battery swapping service is increased. Extensive simulations are conducted to evaluate the impact of different parameters on long-term profit and the performance of the online algorithm.

作者

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

评论

主要评分

4.7
评分不足

次要评分

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

推荐

暂无数据
暂无数据