An Efficient Greedy Algorithm for Real-World Large-Scale Electric Vehicle Charging

Marius Hegele, Philipp Metzler,Sebastian Beichter,Friedrich Wiegel,Veit Hagenmeyer

PROCEEDINGS OF THE 2023 THE 14TH ACM INTERNATIONAL CONFERENCE ON FUTURE ENERGY SYSTEMS, E-ENERGY 2023(2023)

引用 0|浏览3
暂无评分
摘要
The increasing use of electric vehicles amplifies the demand for affordable charging infrastructure. By smart charging applications, operators of large-scale facilities of AC chargers can save costs on installation and lighten the load on distribution grids by avoiding high peaks and unbalanced loads. In the present paper, we consider the problem of phase-balancing in the context of non-ideal charging characteristics: some electric vehicles represent unbalanced loads to the grid, and some react to inputs in an unexpected nonlinear fashion. Furthermore, users expect a fair distribution of the limited charging power. In this light, we formally characterize fairness, choose to control load in real time and model smart charging as a time-discrete knapsack problem. In order to guarantee phase symmetry and increase charging efficiency, we develop a real current measurement filter and use it to solve the problem using a branch-and-bound algorithm and to approximate solutions with a greedy algorithm. We compare these solutions in representative simulations based on real charging data. Additionally, we evaluate the greedy algorithm on real charging infrastructure with up to 100 charging points. We conclude from the results that the greedy algorithm using measurements of charging behavior guarantees capacity and symmetry constraints and demonstrates comparatively adequate fair charging efficiency and applicability to computation on resource-constrained hardware.
更多
查看译文
关键词
smart charging,electric vehicle charging,knapsack problem,greedy approximation,branch and bound
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要