Optimal Distribution Network Reconfiguration Considering Fixed and Time-Varying Commerical Load Demand

This paper presents a new approach to solving the network reconfiguration (NR) problem of the distribution network (DN) with fixed and time-varying load demand using the dung beetle optimization algorithm (DBOA). This algorithm is an optimization technique for the behaviors of dung beetles, including ball-rolling, dancing, foraging, stealing, and reproducing. NR with time-varying load demand is a combinatorial problem that is difficult to solve. To minimize power loss and energy loss costs, it is necessary to identify the optimal radial structure for a DN. In order to evaluate the feasibility of the structure and to count the real power losses and its costs for different levels of demand, a DBOA with backward-forward load flow has been used for radial DN. MATLAB 2021b software has been used to implement the technique, and IEEE 33 bus test DN has been used to evaluate it. To validate and prove the effectiveness of the proposed algorithm, the obtained results were compared to those obtained in the literature.