Abstract: Many problems in real life can be modeled as combinatorial optimization problems. Most of them are computationally difficult, i.e. there is no hope to find the optimal solution in polynomial time. In this talk, I will discuss different approaches to attack these problems. In particular, I will talk about some widely applied metaheuristics - Simulated Annealing, Tabu Search, Genetic Algorithms and Ant Colony Optimization.