“…They have no strict requirements on the form of optimization problems and can avoid the influences of the initial condition sensitivity and gradient information. Up to now, the successfully implemented metaheuristic methods include simulated annealing [3], genetic algorithm [4,5], particle swarm optimization [6][7][8], differential evolution [9,10], artificial bee colony [11,12], harmony search [13][14][15][16][17], biogeography-based optimization [18][19][20][21][22], teaching-learning-based optimization [23][24][25], firefly algorithm [26], crisscross optimization algorithm [27,28], bat algorithm [29], grey wolf optimizer [30,31], cuckoo search [32][33][34], ant lion optimizer [35], exchange market algorithm [36], symbiotic organisms search [37,38], backtracking search algorithm [39,40], interior search algorithm [41], whale optimization algorithm [42], mine blast algorithm [43], and hybrid methods [44][45]…”