Investigating the history and comparing the performance of metaheuristic and heuristic algorithms

Investigating the history and comparing the performance of metaheuristic and heuristic algorithms

yeganeh rasouli1 mahdi jafari2 sahar sedighi3

1) Master of Computer Science, Islamic Azad University, South Tehran Branch, Iran
2) Master of Aerospace Student, Islamic Azad University, Research Sciences Branch, Iran
3) Master student of Chemistry, Islamic Azad University, Central Tehran Branch, Iran

IOI Code : XBGE-FZAEG
Publication : 11th International Conference on New Solutions in Engineering, Information Science and Technology of the Century ahead(icietconf.com)
Abstract :
    Meta Heuristic algorithms, sometimes called metaheuristic algorithms, are a group of algorithms used to solve optimization problems. In computer science, artificial intelligence, and optimization, the discovery algorithm is either a heuristic or an innovative algorithm that solves problems that classical solutions are too slow to solve, or is an approximate solution to problems that classical methods cannot find accurate answers to. They need to evaluate a large number of possible cases to determine an accurate answer. The time it takes to find an accurate answer is often more than a lifetime. The heurists will play an effective role in resolving such issues by using methods that require fewer evaluations and provide answers within acceptable time limits. In this research, we examine the heuristic, metaheuristic algorithms and their types

Keywords : optimization meta innovation metaheuristic algorithm heuristic