“…When problem (1) is nonconvex and large-scale, it may have many local minimizers and it is a challenge to find its global minimum. For problem (1), there are many popular global optimization methods, such as the multi-start methods [11,20,26,43,73,85], the branch-and-bound methods [10,17,76,83], the genetic evolution algorithms [32,46,59,63] and their memetic algorithms [35,60,78,84].…”