“…This drawback is overridden by metaheuristic methods (MM), but they are more complicated in formulation with larger execution time requirements than HM. Therefore, many MM have been developed using ideas of nature behavior [9], which could be based on genetic algorithms [2], particle swarm optimization [3,10,11], tabu search [12,13], simulated annealing [13][14][15], variable scaling hybrid differential algorithm [16], ant colony [17,18], plant growth simulation [19,20], bacterial foraging [21], gray wolf [22], salp swarm [23], symbiotic organism search, hybrid cuckoo search [24], harmony search [25], and binary gravitational search [26], among others. On the other hand, mathematical optimization algorithms solve the reconfiguration problem by using conventional optimization techniques, for example, OPF by Bender Decomposition [8], mixedinteger convex programming [27,28], convex models [29], mixed-integer linear programming [30], and mixed-integer second-order cone programming [31].…”