“…They are adaptable and can return several solutions to a single problem in a single simulation run. Several well-known optimization techniques have attempted to overcome these issues, including: Genetic algorithm (GA) [25], moth swarm optimization algorithm (MSA) [26],differential evolution (DE) [27], [28],simulated annealing (SA) [29], particle swarm optimization (PSO) [30], [31], spider monkey optimization (SMO) [32], grey wolf optimizer (GWO) [33], gravitational search algorithm (GSA), [34],fire fly algorithm (FFA) [35], spiral optimization algorithm (SOA) [36], harmony search algorithm (HSA) [37], [38], harris hawks optimization (HHO) [39], squirrel search algorithm (SSA) [40], artificial bee colony (ABC) [41], sine-cosine algorithm (SCA) [42], differential evolution (DE) [43], bacterial forging algorithm (BFA) [44], Fluid search optimization (FSO) [45], improved ABC (IABC) [46], modified BFA (MBFA) [47], hybrid hierarchical evolution (HHE) [48], whale optimization algorithm (WOA) [49], chaos turbo PSO (CTPSO) [50], hybrid particle swarm gravitational search algorithm (PSOGSA) [51], multi-objective PSO (MOPSO) [52], new global PSO (NGPSO) [53], quantum inspired glowworm swarm optimization (QGSO) [54], multi-objective DE based PSO (MODE/PSO) [55], combination of continuous greedy randomized adaptive search procedure and modified differential evolution (CGRASP-MDE), combination of continuous greedy randomized adaptive search procedure and self-adaptive differential evolution (C-GRASP-SaDE) [56], successful history-based adaptive DE variants with linear population size reduction (L-SHADE) and improved L-SHADE (IL-SHADE) [57].…”