This paper is a tutorial introduction to three recent yet widely used
general heuristics: Simulated Annealing, Tabu Search, and Genetic Algo
rithms. A relatively precise description and an example of application
are provided for each of the methods, as well as a tentative evaluati
on and comparison from a pragmatic point of view.