Fast distribution network reconfiguration with graph theory

Abstract

Owing to mixed-integer and non-linear properties, the distribution network reconfiguration (DNRC) problem has been widely addressed with meta-heuristic algorithms. To accelerate the solution process, two essential components of meta-heuristic algorithms are investigated in this study: solution representation and fitness evaluation. Instead of the popular binary and integer numbers, decimal encoding is employed. Decoding is based on the proposed probability-based loop destruction strategy. The fitness evaluation is based on the power flow calculation of radial network. Different from backward/forward sweep method, the advantageous direct solution technique is utilised, where the matrix generation process has been accelerated. Both improvements are based on the graph theory and fully explained with illustrative examples. Case studies are implemented on five benchmark systems. The superiority of the proposed methods over their advanced counterparts has been established with intensive comparisons. Finally, these methods are integrated into a standard particle swarm optimisation framework for the solution of DNRC. Results indicate that the proposals significantly improve the solution efficiency without the loss of quality.