{'fraction_non_alphanumeric': 0.028073572120038724, 'fraction_numerical': 0.0, 'mean_word_length': 5.8933333333333335, 'pattern_counts': {'":': 0, '<': 0, '<?xml version=': 0, '>': 0, 'https://': 0, 'lorem ipsum': 0, 'www.': 0, 'xml': 0}, 'pii_count': 0, 'substrings_counts': 0, 'word_list_counts': {'cursed_substrings.json': 0, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
A comparative study of several metaheuristic algorithms for optimization problems

This article presents a study of a recent metaheuristic optimization method, the search and rescue algorithm (SAR), against four known metaheuristic optimization algorithms, the Salp Swarm Algorithm (SSA), the Cuckoo Search Algorithm (CSA), the Firefly Algorithm (FA), and the Grey Wolf Optimization Algorithm (GWO). An evaluation of its performance against the other algorithms will be performed by the means of thirteen mathematical benchmarks functions, afterwards a study of the optimization of five multi-dimensional mathematical problems will be investigated, the optimization of the Dejoung function, the Cosine Mixture function, the Griewank function, the Rastrigin function, and the Rosenbrok function, while the dimension of these problems increases from five to thirty. Furthermore, a discussion and a conclusion about the results obtained by each algorithm face to the resolution of these complex multi-dimensional problems will be drawn.