基于无重访NSGA-II算法的配电网多目标重构

摘要

A non-revisited NSGA-II algorithm, which integrates BSP (binary space partitioning)-based non-revisiting mechanism and the non-dominated sorting genetic algorithm-II (NSGA-II) based on the ideology of multi-objective Pareto optimization, is constructed and is then used to solve the problem of distribution networks multi-objective reconfiguration with the consideration of loss minimization and the improvement of reliability. The proposed algorithm achieves a strictly non-revisited research, which avoids the recalculation of power flow and reliability of revisited schemes and saves the computing resources. The test results of IEEE 16-bus and IEEE 33-bus sample systems indicate that the proposed method can obtain the optimal solution in every target direction as well as an optimal Pareto frontier aggregates including a lot of non-dominated solutions in less iterations. According to incidence relations between network losses and reliability goals, along with the topology construction analysis of corresponding reconfiguration schemes, conclusions can be drawn that network losses are in apparent consistency with reliability goals in global scope of solution space, and whether out of the consideration of network loss optimization or reliability optimization, the topology of networks should be close to breadth-first tree rather than depth-first tree.%将基于空间二叉分割理论的无重访机制与基于多目标 Pareto 最优化思想的第二代非支配排序遗传算法(Non-dominated Sorting Genetic Algorithm-II, NSGA-II)相结合，构建了无重访NSGA-II算法，并应用于求解同时考虑网损降低和供电可靠性提高的多目标配电网络重构问题。所构建的无重访NSGA-II算法实现了严格意义上的不重复搜索，避免了重复方案的潮流及可靠性计算，节约了计算资源。IEEE16、IEEE33测试系统的计算结果表明能够在较少的迭代次数下得到每个目标方向上的最优解以及包含若干非支配解的Pareto最优前沿解集。根据网损与可靠性目标之间的关联关系及相应重构方案的拓扑结构分析表明在解空间的全局范围内网损与可靠性目标具有较明显的一致关联性，不论对于网损还是可靠性的优化，网络拓扑都应该接近广度优先树而规避深度优先树。