ELECTRICAL DISTRIBUTION NETWORKS RECONFIGURATION USING DYNAMIC PROGRAMMING

The reconfiguration of electrical distribution networks(REDNs) is formulated as a complex, large-scale combinatorial optimization problem. The mathematical model of REDN is proposed and it takes into account the restrictions such as voltage, capacity, load balance and etc.. The concepts about DP such as state, decision-making, strategy, course, index function, etc. are introduced and the DP algorithm for REDN is deduced. The concepts of effective-combination and benefit are defined. The method of reducing-dimensions can sharply lessen the number of combination states, and can improve the calculation efficiency. The proposed algorithm is applied to the IEEE 33-node, 69-node and practical engineering EDNs, and the results of voltage and system loss are compared with those obtained from some other methods, which show the accuracy, feasibility and engineering practicality.