基于最短路算法和遗传算法的配电网络重构

SHORTEST PATH ALGORITHM AND GENETIC ALGORITHM BASED DISTRIBUTION SYSTEM RECONFIGURATION

提出了通过组合负荷实现寻优的重构方法。利用最短路径法按照某一顺序为每个负荷分别寻找供电路径 ,然后利用遗传算法选择最优的负荷排列顺序 ,从而实现在局部最优解中寻求全局最优解。通过将容量约束和电压约束转换成弧的权值 ,在网络形成的过程中就考虑这些约束 ,从而进一步保证了该算法高效地找到全局优化解。此方法很容易实现树状约束 ,并对多环的复杂结构网络也能高效地实现重构寻优。

A distribution system reconfiguration method, named shortest path genetic algorithm, is presented, which optimizes a network by ordering the loads instead of combining the branches or switches. A method based on shortest path algorithm is used to search the optimal power supply paths for a series of loads one by one, while genetic algorithm is used to search the optimal order of the loads. It is very easy to get a radial network by this method, in addition, voltage constraints and capacity constraints can be considered in the searching progress instead of just being verified after solutions have been obtained.