Distribution Network Reconfiguration Based on an Improved Arithmetic Optimization Algorithm

Abstract

Aiming to address the defects of the arithmetic optimization algorithm (AOA), such as easy fall into local optimums and slow convergence speed during the search process, an improved arithmetic optimization algorithm (IAOA) is proposed and applied to the study of distribution network reconfiguration. Firstly, a reconfiguration model is established to reduce network loss, and a cosine control factor is introduced to reconfigure the math optimization accelerated (MOA) function to coordinate the algorithm’s global exploration and local exploitation capabilities. Subsequently, a reverse differential evolution strategy is introduced to improve the overall diversity of the population and Weibull mutation is performed on the better-adapted individuals generated in each iteration to ensure the quality of the optimal individuals generated in each iteration and strengthen the algorithm’s ability to approach the optimal solution. The performance of the improved algorithm is also tested using eight basis functions. Finally, simulation analysis is carried out by taking the IEEE33 and IEEE69 node systems and a real power distribution system as examples; the results show that the proposed algorithm can help to reconfigure the system quickly, and the system node voltages and network losses were significantly improved after the reconfiguration.

Keywords

• arithmetic optimization algorithm
• distribution network reconfiguration
• nodal voltage
• network losses