Electromagnetism-Like Mechanism Algorithms And Segmentation Strategies For Discrete Classes Of Distribution Network Dynamic Reconfiguration

The essence of distribution network reconfiguration is changing the network structure to optimize network operations in accordance with the constraint conditions of slip capacity, node voltage and the number of switching operations, to reduce line losses, balance load and improve voltage quality.Distribution network topology analysis and power flow calculation is the basis of distribution network reconfiguration. In this aticle.node branch matrixs are used to describe the distribution network, which can reflect the dynamic changes of the network; variety power flow calculation methods are analyed, combined with distribution characteristics, selecting the Ex-back method as a method of distribution system power flow calculation.Distribution network reconfiguration can be divided into static reconfiguration and dynamic reconfiguration according to the processing time variable.The static reconfiguration is under one moment, when the load is invariable, so it can’t meet the request of the actual movement,thus commonly used in plan domain.Dynamic reconfiguration solves the network optimization question which is in the entire movement time interval, when the load changes unceasingly, conforms to the actual need.This article has emphatically analyzed the difference of static reconfiguration and the static reconfiguration, pointed out static reconfiguration is the foundation of the dynamic reconfiguration, but dynamic reconfiguration is not the simple superimposition of the static reconfiguration.In this paper, fistly, electromagnetism-like mechanism (EM) algorithm are using to solve distribution network static reconfiguration. The EM algorithm is a new artificial intelligence algorithms, widely used in various areas of optimization. This article has improved the insufficient of the EM algorithm stocks update strategies and local search. Discrete the original EM algorithm discrete sequence, to enable it to solve the discrete constraints optimization problem. The effectiveness of the method is proposed by simulation example.In this paper,dynamic reconfiguration is researched at the basis of static reconfiguration. Distribution network dynamic reconfiguration include two core issues:the assignment of the limited times reconfiguration program and the coordinate of multi-stage program. To deal with the first question, at the basis of static reconfiguration, a structure offset function is defined to evaluate each time the gap of the actual structure and the optimal structure, to divide the reconfiguration interval by the merger of similar period. For the second question, the switch constraints is integration into the objective function, sub-sub-step dynamic search method is used to find the optimal solution on the whole period. The effectiveness of the method is proposed by simulation example.