This paper was published through Galoá and has a deposited DOI. To cite this paper, use one of the standards below:
In case you are one of the co-authors and want to register this paper in your Lattes, use the following code: doi > 10.59254/sbpo-2025-212179
If you've NEVER registered a DOI in your Lattes, check our tutorial!This paper proposes a specialized metaheuristic algorithm, based on tabu search, to solve the optimal switching operations sequencing (SOS) problem in the reconfiguration of electric power distribution networks. The primary objective is to transition the initial radial topology to an optimal radial configuration, minimizing the amount of energy not supplied throughout the switching process. At each step, switch operations generate intermediate topologies that must satisfy two conditions: (i) the energized portion of the network must remain radial, and (ii) all operational constraints are strictly maintained. Due to the high complexity of the SOS problem, a specialized tabu search, enhanced with diversification and intensification strategies, is employed to efficiently explore the solution space and prevent cycling. Computational tests were carried out using systems of different sizes from the literature. The results showed that the method achieves high-quality solutions in a computational time compatible with real applications.
With nearly 200,000 papers published, Galoá empowers scholars to share and discover cutting-edge research through our streamlined and accessible academic publishing platform.
Learn more about our products:
This proceedings is identified by a DOI , for use in citations or bibliographic references. Attention: this is not a DOI for the paper and as such cannot be used in Lattes to identify a particular work.
Check the link "How to cite" in the paper's page, to see how to properly cite the paper