Mathematical optimization versus Metaheuristic techniques: A performance comparison for reconfiguration of distribution systems

Reconfiguration is a complex combinatorial problem in which the topology of distribution systems is modified by the opening/closing of interconnection switches aiming techno-economic benefits (e.g., minimization of losses). Numerous optimization methods have been developed to solve the reconfiguration problem, although a comparative analysis of their performances is still a challenging task due to the nature of the methods, differences in their implementation, and used computational equipment. To fulfill that gap, this paper assesses classical models along with metaheuristics already applied in the specialized literature considering the reported losses and computational effort. To eliminate differences due to implementation and equipment, two proposed metrics are assessed using a reference specialized power flow: 'equivalent time' and 'equivalent number of power flows'. The quality of the solutions was compared for standard test systems (33, 136, and 417 buses) and a ranking of the methods was produced. It was concluded that linear and conic programming models find the optimal solution for low and medium-size systems; moreover, the linear model requires lower computational effort than the conic and the nonlinear programming formulations. On the other hand, it was verified that metaheuristics need lower computational effort and provide better solutions for large-size systems compared to classical optimization.

Automated summary

This paper evaluates classical models and metaheuristics in the reconfiguration problem, comparing their performances using two proposed metrics. The study shows that linear and conic programming models find optimal solutions for small and medium-sized systems, while metaheuristics require lower computational effort and provide better solutions for large systems.