“…Most metaheuristics have the following features: they are inspired from nature, they do not use the objective function's Hessian or gradient matrix, they make use of stochastic components, and they have many parameters that need to be adapted to the problem [18]. The following artificial intelligence based optimization methods have been successfully used to solve OPF problems: moth swarm algorithm, MSA [19]; modified particle swarm optimization, MPSO [20]; modified differential evolution, MDE [21]; moth-flame optimization, MFO [22]; flower pollination algorithm, FPA [23]; adaptive real coded biogeography-based optimization, ARCBO and real coded biogeography-based optimization, RCBBO [24]; grey wolf algorithm, GWO and differential evolution, DE [25]; modified Gaussian bare bones imperialist competitive algorithm, MGBICA and Gaussian bare bones imperialist competitive algorithm, GBICA [26]; artificial bee colony, ABC [27]; simulated annealing and hybrid shuffle frog leaping algorithm [28]; Lévy mutation teaching-learning-based optimization, LTLBO [29]; teaching learning-based optimization, TLBO [30]; hybrid MPSO and shuffle frog leaping algorithms, HMPSOSFLA, and particle swarm optimization, PSO [31]; Gbest-guided artificial bee colony, GABC [32]; differential search algorithm, DSA [33]; efficient evolutionary algorithm, EEA and eclectic genetic algorithm, EGA [34]; particle swarm optimization with aging leader and challengers, ALCPSO [35]. The above optimization approaches have been developed to solve simple and multiobjective OPF problems.…”