Overview of Metaheuristic Algorithms
Saman M. Almufti, Awaz Ahmad Shaban, Zeravan Arif Ali, Rasan Ismael Ali, Jayson A. Dela Fuente, Renas Rajab Asaad
Abstract
Metaheuristic algorithms are optimization algorithms that are used to address complicated issues that cannot be solved using standard approaches. These algorithms are inspired by natural processes such as genetics, swarm behavior, and evolution, and they are used to explore a broad search space to identify the global optimum of a problem. Genetic algorithms, particle swarm optimization, ant colony optimization, simulated annealing, and tabu search are examples of popular metaheuristic algorithms. These algorithms have been widely utilized to address complicated issues in domains like as engineering, finance, and computer science. In general, the history of metaheuristic algorithms spans several decades and involves the development of various optimization algorithms that are inspired by natural systems. Metaheuristic algorithms have become a valuable tool in solving complex optimization problems in various fields, and they are likely to continue to play an important role in the development of new technologies and applications.