Network Reconfiguration for Loss Reduction Using Tabu Search and a Voltage Drop

Abstract

This paper introduces a new algorithm designed to address the challenge of distribution network reconfiguration, employing the tabu search metaheuristic in conjunction with the voltage drop concept. Distinguishing itself from existing methods, our proposed approach not only utilizes voltage drop for obtaining the initial solution but also introduces a novel technique for generating a candidate solution neighborhood. This method leverages both randomness and voltage drop, ensuring a smooth and steady descent during algorithm execution. The primary goal of our algorithm is to minimize active power losses within distribution networks. To validate its effectiveness, the proposed method underwent testing on three commonly referenced distribution systems: the 33-Bus, 69-Bus, and 94-Bus systems, widely acknowledged in the literature. A pivotal aspect of our work involves the synergy of the tabu search algorithm with a combination of both random and deterministic methods for generating neighbors. This strategic amalgamation plays a crucial role, enabling rapid execution while consistently yielding high-quality solutions. Additionally, the adoption of the electric distance method for generating the initial solution adds significant value, offering a commendable solution with minimal computational effort. Comparative assessments against other algorithms documented in the literature underscore the superior efficiency of our proposed algorithm.