“…In references [7,11] and [12] have formulated MINLP models to locate and dimension DG and their solutions have been obtained using GAMS, the main advantage of these implementations is that the authors have concentrated their efforts to obtain accurate optimization models for representing the optimization problem; however, the GAMS package has a high probability of reporting local solutions due to the non-convex nature of the exact MINLP model. Regarding the combinatorial optimization, i.e., metaheuristics, in literature can be found multiple approaches to solve the optimal location and sizing DG, some of them are: krill-herd optimization algorithm [1,13]; genetic algorithms [14,15,16,17]; particle swarm optimization [3,18,19]; sunflower optimization algorithm [20]; population-based incremental learning [8]; tabu search algorithm [21,22]; and flower pollination algorithm [23,24], among others.…”