配电网络重构是一个复杂的非线性组合优化问题。
Distribution network reconfiguration is a complex and nonlinear combinatorial optimization problem.
该算法可以灵活地用于配电网综合规划问题的求解，其子算法也可用于馈线路径规划问题及配电网网络重构问题的求解。
The methodology can be used to solve the integration planning problem of distribution network as well as the route planning of feeder and reconfiguration of distribution network flexibly.
损失最小化的配电网络重构是一个复杂的，大型的组合优化问题。
Distribution network reconfiguration for loss minimization is a complex, large-scale combinatorial optimization problem.
配电网络重构是在满足各种运行约束条件下，以网损最小或供电可靠性最高为目标，它是一个典型的非线性整数组合优化问题，常规的数学优化方法难以求解。
The purpose of distribution network reconfiguration is to obtain the minimum network loss and the maximum reliability while meeting all kinds of operational restrictions.
建立了配电网络重构的图的多划分模型，提出了基于图的谱划分的算法，用于求解大规模配电网络的馈线间重构问题。
This paper proposes a novel spectral partitioning algorithm, viz. recursive spectral bisection, for weighted graph partitioning that models large scale distribution feeder reconfiguration problem.
建立了配电网络重构的图的多划分模型，提出了基于图的谱划分的算法，用于求解大规模配电网络的馈线间重构问题。
This paper proposes a novel spectral partitioning algorithm, viz. recursive spectral bisection, for weighted graph partitioning that models large scale distribution feeder reconfiguration problem.
应用推荐