“…The search algorithms, including local search algorithms and global search algorithms, theoretically can get a better solution, compared with the traditional iterative algorithms. However, the former, including the steepest descent [24], conjugate gradient [25], and direct binary search (DBS) [26] algorithms, tend to fall into local extreme points and cannot jump out. The latter mainly includes the simulated annealing (SA) algorithm [27], genetics algorithm (GA) [28][29][30], particle swarm optimization (PSO) [31][32][33], etc.…”