“…Many of real-world optimization problems involve with complexities such as nonlinearity, nonconvexity, nonsmoothness, nondifferentiability, mixed integer nature, and discontinuous domain, which challenge the numerical optimization methods [3]. Accordingly, to tackle the mentioned complexities, several metaheuristic optimization techniques have been proposed in the literature in the recent decades such as genetic algorithm (GA) [4], particle swarm optimization (PSO) [5,6], ant colony optimization (ACO) [7,8], honey bee mating optimization (HBMO) [9,10], artificial bee colony (ABC) [11,12], bacterial foraging (BF) [13], clonal selection algorithm (CSA) [14], invasive weed optimization (IWO) [15], shuffled frog leaping (SFL) [16], evolutionary algorithm (EA) [17], differential evolution (DE) [18], Correspondence to: O. Abedinia, E-mail: abediniaoveis@ gmail.com simulated annealing (SA) [19], and gravitational search algorithm (GSA) [20,21]. Due to their high flexibility, simplicity and modeling efficiency, these optimization methods have been widely used in many scientific and engineering areas.…”