EV电池更换计划,I:集中式解决方案
Scheduling of EV Battery Swapping, I: Centralized Solution
摘要:
我们制定了一个最优调度问题的电池交换,分配给每个电动汽车(EV)的最佳站,以交换其耗尽的电池根据其当前位置和充电状态。该计划的目标是最小化总旅行距离和发电成本在两个站的分配和潮流变量,受EV范围的约束,电网运行约束和交流潮流方程。针对潮流方程的非凸性和配站问题的二元性,提出了一种基于二阶锥规划(SOCP)松弛最优潮流(OPF)和广义Benders分解的求解方法。当SOCP松弛是精确的时,该方法计算全局最优解。我们通过仿真评估所提出的算法的性能。该算法需要全局信息,适用于由同一运营商集中管理配电网络、站点和电动汽车的情况。在本文的第二部分,我们开发分布式解决方案的情况下,他们是由不同的组织,不共享私人信息。
英文摘要:
We formulate an optimal scheduling problem for battery swapping that assigns to each electric vehicle (EV) a best station to swap its depleted battery based on its current location and state of charge. The schedule aims to minimize total travel distance and generation cost over both station assignments and power flow variables, subject to EV range constraints, grid operational constraints and AC power flow equations. To deal with the nonconvexity of power flow equations and the binary nature of station assignments, we propose a solution based on second-order cone programming (SOCP) relaxation of optimal power flow (OPF) and generalized Benders decomposition. When the SOCP relaxation is exact, this approach computes a globally optimal solution. We evaluate the performance of the proposed algorithm through simulations. The algorithm requires global information and is suitable for cases where the distribution network, stations, and EVs are managed centrally by the same operator. In Part II of the paper, we develop distributed solutions for cases where they are operated by different organizations that do not share private information.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。