Ülevaade metaheuristilistest meetoditest ja rändkaupmehe ülesande lahendamine GRASP meetodiga
This bachelor thesis gives an overview of metaheuristics, what they are and what are they used for. Several metaheuristic algorithms are briefly examined which are divided into two groups based on how many solution candidates at a time a given algorithm operates with: trajectory methods, which operate with a single solution candidate at a time and population methods which operate with more than one solution candidates at a time. A brief criticism towards ”novel” metaheuristics is given which introduce new terminology to describe the algorithm but don’t offer new ideas. And finally a metaheuristic called GRASP is applied on the Travelling Salesman problem the size of 1000 ”cities”.