智能电网中电动汽车的最优充电:特征描述与充谷算法
Optimal Charging of Electric Vehicles in Smart Grid: Characterization and Valley-Filling Algorithms
摘要:
电动汽车(EV)提供了一个有吸引力的长期解决方案,以减少对化石燃料的依赖和温室气体排放。然而,具有不同EV电池充电速率约束的EV车队(其分布在智能电网网络上)需要协调的充电调度以最小化发电和EV充电成本。在本文中,我们研究了一个联合最优潮流(OPF)和电动汽车充电问题,随着时间的推移充电电动汽车的OPF问题。虽然OPF问题通常是非凸且非光滑的,但最近表明,对于大多数实际电力网络,可以使用其凸对偶问题来最佳地解决OPF问题。在此基础上,我们研究了一种嵌套优化方法来分解联合OPF和EV充电问题。我们的特点是最佳的离线电动汽车充电时间表是一个山谷填充的配置文件,这使我们能够开发一个最佳的离线算法与计算复杂性,这是显着低于集中式内部点求解器。此外,我们提出了一个分散的在线算法,动态跟踪山谷填充配置文件。在IEEE 14节点系统上对算法进行了仿真,结果表明,在线算法在不同的设置下都具有接近最优的性能(与离线最优解相比有$<1%$相对差)。
英文摘要:
Electric vehicles (EVs) offer an attractive long-term solution to reduce the dependence on fossil fuel and greenhouse gas emission. However, a fleet of EVs with different EV battery charging rate constraints, that is distributed across a smart power grid network requires a coordinated charging schedule to minimize the power generation and EV charging costs. In this paper, we study a joint optimal power flow (OPF) and EV charging problem that augments the OPF problem with charging EVs over time. While the OPF problem is generally nonconvex and nonsmooth, it is shown recently that the OPF problem can be solved optimally for most practical power networks using its convex dual problem. Building on this zero duality gap result, we study a nested optimization approach to decompose the joint OPF and EV charging problem. We characterize the optimal offline EV charging schedule to be a valley-filling profile, which allows us to develop an optimal offline algorithm with computational complexity that is significantly lower than centralized interior point solvers. Furthermore, we propose a decentralized online algorithm that dynamically tracks the valley-filling profile. Our algorithms are evaluated on the IEEE 14 bus system, and the simulations show that the online algorithm performs almost near optimality ($<1%$ relative difference from the offline optimal solution) under different settings.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。