Partition-based bus renumbering effect on interior point-based OPF solution
Partition-based bus renumbering effect on interior point-based OPF solution
复制标题
DOI：
10.1109/tpec.2018.8312115
复制
发表时间：
2018-02
期刊：
影响因子：
--
通讯作者：
M. Mehrtash;A. Kargarian;A. Mohammadi
中科院分区：
文献类型：
--
作者：
M. Mehrtash;A. Kargarian;A. Mohammadi
优化问题的约束系数矩阵的形式对求解过程有很大的影响，特别是在采用迭代算法时。在电力系统中，节点编号的顺序影响电力系统的图邻接矩阵，从而影响最优潮流问题的约束系数矩阵。改变约束系数矩阵可能会改变最优潮流的求解时间。在本文中，我们表明，总线数量的顺序影响的AC和DC的最优潮流问题的解决时间时，使用基于内点法的求解器。我们提出了一个分区为基础的总线重新编号算法，解决OPF问题之前实施。该算法构造了一个模式化的约束系数矩阵，加快了最优潮流的求解过程。IEEE 118节点系统和13659节点欧洲输电系统的算例表明，该算法在缩短最优潮流求解时间方面是有效的。该方法的实施导致约65%的时间节省时，Matpower用于解决最优潮流。
The form of constraint coefficient matrix of an optimization problem significantly affects the solution procedure for finding the optimal results, especially when iterative algorithms are implemented. In power systems, the order of bus numbers affects the power system's graph adjacency matrix and accordingly affects the optimal power flow (OPF) problem's constraint coefficient matrix. Changing this constraint coefficient matrix might change the OPF solution time. In this paper, we show that the order of bus numbers affects the solution time of AC and DC OPF problems when an interior point method-based solver is used. We propose a partition-based bus renumbering algorithm to be implemented before solving the OPF problem. This algorithm constructs a well-patterned constraint coefficient matrix and speeds up the OPF solution procedure. Numerical results on the IEEE 118-bus system and the 13659-bus European transmission system show effectiveness of the proposed algorithm in reducing the OPF's solution time. Implementation of the proposed method leads to about 65% of timesaving when Matpower is used to solve OPF.