arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2305.01032math.OCcs.SYeess.SY
收藏

电力系统分布式优化中基于径向划分与谱参数选择的方法

Radial Partitioning with Spectral Penalty Parameter Selection in Distributed Optimization for Power Systems

Mehdi Karimi

AI总结:

本文提出基于径向划分和谱参数选择的分布式优化算法,并开发DiCARP软件包,在更少迭代次数下获得比基于组件的DO更精确的最优潮流解。

摘要:

本文针对最优潮流(OPF)问题,在智能划分的基础上提出了基于组的分布式优化(DO)算法。将网络的图进行径向划分作为一种系统化方法被引入,用于把大规模问题拆分为更易处理的子问题,这些子问题有望通过凸松弛等方法高效求解。针对基于组的DO,引入了谱参数选择作为DO中至关重要的超参数选择步骤。创建了软件包DiCARP,该软件包使用Pyomo优化包在Python中实现。我们在不同电力网络实例上的数值结果表明,与基于组件的DO相比,所设计的算法在更少的迭代次数下能为测试问题返回更精确的解。我们的结果证实了智能划分和参数选择对于网络上大规模优化问题的重要性。

英文摘要:

This paper proposes group-based distributed optimization (DO) algorithms on top of intelligent partitioning for the optimal power flow (OPF) problems. Radial partitioning of the graph of a network is introduced as a systematic way to split a large-scale problem into more tractable sub-problems, which can potentially be solved efficiently with methods such as convex relaxations. Spectral parameter selection is introduced for group-based DO as a crucial hyper-parameter selection step in DO. A software package DiCARP is created, which is implemented in Python using the Pyomo optimization package. Our numerical results for different power network instances show that our designed algorithm returns more accurate solutions to the tested problems with fewer iterations than component-based DO. Our results confirm the importance of smart partitioning and parameter selection for large-scale optimization problems on networks.

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

↑