Fast solution of radial distribution networks with automated compensation and reconfiguration

摘要

Optimal operation of radial distribution networks with automated compensation and reconfiguration requires the solution of a combinatorial optimisation problem, since the variables re the on/off status of capacitor bask and the open/close status of tie-switches. The solution approaches recently proposed use iterative algorithms such as genetic algorithms, simulated annealing and tabu search, for which the network needs to be solved in different configurations and at different compensation levels. The aim of this evaluation is that of attributing a quality index to each solution so that all the solutions can be suitably ordered. In an automated network, any configuration can be obtained from another one through a set of elementary moves, each consisting of the change of status of a pair of tie-switches.