arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2303.05005eess.SYcs.SY
收藏

基于并行计算的可靠性约束配电网规划

Parallel Computing Based Solution for Reliability-Constrained Distribution Network Planning

Yaqi Sun, Wenchuan Wu, Yi Lin, Hai Huang, Hao Chen

摘要:

配电网扩建规划的主要目标是在满足一定可靠性要求的前提下,实现投资最小化。可靠性约束配电网规划(RcDNP)问题可以归结为混合整数线性规划(MILP)问题,特别是对于大规模的配电网,MILP问题的计算量非常大。本文提出了一种基于并行计算的RcDNP问题加速算法。将RcDNP问题分解为一个骨干网格和若干个具有协调性的横向网格问题。在此基础上,提出了一种具有加速策略的增广拉格朗日算法,用于求解协调规划问题。该方法通过与主干网格规划问题协调,并行求解横向网格问题。为了解决非凸性的存在,高斯-赛德尔迭代采用的可行域的凸包的分解方法。在适当的条件下,证明了算法的最优性和收敛性。数值试验表明,该方法可以显著减少计算时间,使RcDNP方法更适用于实际问题。

英文摘要:

The main goal of distribution network (DN) expansion planning is essentially to achieve minimal investment constrained with specified reliability requirements. The reliability-constrained distribution network planning (RcDNP) problem can be cast an instance of mixed-integer linear programming (MILP) which involves ultra-heavy computation burden especially for large scale DNs. In this paper, we propose a parallel computing-based acceleration algorithm for solve RcDNP problem. The RcDNP is decomposed into a backbone grid and several lateral grid problems with coordination. Then a parallelizable augmented Lagrangian algorithm with acceleration strategy is developed to solve the coordination planning problems. In this method, the lateral grid problems are solved in parallel through coordinating with the backbone grid planning problem. To address the presence of nonconvexity, Gauss-Seidel iteration is adopted on the convex hull of the feasible region constructed by the decomposition method. Under mild conditions, the optimality and convergence of this algorithm is proven. The numerical tests show the proposed method can significantly reduce the computation time and make the RcDNP applicable for real-world problems.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑