Abstract
Metaheuristics are generic search strategies that can be adapted to solve complex problems. This paper describes in simple terms the most popular metaheuristics for combinatorial optimization problems. It also emphasizes the main contributions of the Canadian research community in the development and application of metaheuristics.