当前位置: X-MOL 学术IEEE Trans. Smart. Grid. › 论文详情
Our official English website, www.x-mol.net, welcomes your feedback! (Note: you will need to create a separate account there.)
Coordinated Planning of Transportation and Electric Power Networks With the Proliferation of Electric Vehicles
IEEE Transactions on Smart Grid ( IF 8.6 ) Pub Date : 2020-04-23 , DOI: 10.1109/tsg.2020.2989751
Wei Gan , Mohammad Shahidehpour , Mingyu Yan , Jianbo Guo , Wei Yao , Aleksi Paaso , Liuxi Zhang , Jinyu Wen

The interdependency of transportation and electric power networks is becoming tighter due to the proliferation of electric vehicles (EVs), which introduces additional difficulties in the planning of the two networks. This paper presents the enhanced solution for the coordinated planning of multiple facilities in the two networks, including electric power lines, transportation roads, energy storage systems and fast charging stations. In order to calculate the optimal solution for the proposed coordinated planning problem, we introduce the applications of linear optimization theory including Karush–Kuhn–Tucker conditions, the big M method, and a linear expression of power loss to transform the nonlinear planning problem into a mixed-integer quadratically constrained programming (MIQCP) formulation, which is solved by commercial solvers. The proposed MIQCP formulation is decomposed into two corresponding subproblems by Lagrangian relaxation to represent transportation and electric power networks. The case studies validate the proposed planning model and demonstrate that the proposed solution can enhance the coordinated network planning with the proliferation of EVs.

中文翻译:

随着电动汽车的普及,运输和电力网络的协调规划

由于电动汽车(EV)的激增,交通运输和电力网络的相互依赖性越来越严格,这给这两个网络的规划带来了额外的困难。本文提出了一种增强的解决方案,用于协调两个网络中多个设施的协调规划,包括电力线,交通道路,储能系统和快速充电站。为了计算所提出的协调计划问题的最优解,我们介绍了线性优化理论的应用,包括Karush–Kuhn–Tucker条件,big M方法以及功率损耗的线性表达式,可将非线性规划问题转化为混合整数二次约束编程(MIQCP)公式,由商业求解器解决。拉格朗日松弛将提出的MIQCP公式分解为两个相应的子问题,以表示交通运输和电力网络。案例研究验证了所提出的规划模型,并证明了所提出的解决方案可以随着电动汽车的普及而增强协调网络规划。
更新日期:2020-04-23
down
wechat
bug