METAHEURISTICS


    Metaheuristics can be conceived as general strategies for designing heuristic procedures with high performance. The metaheuristic strategies refer to the design of some of the fundamental types of heurisic procedures for solving an optimization problem.
    A heuristic (from the greek heuriskein, to find, to discover) a technique (consisting of a rule or a set of rules) with seeks (and hopefully finds) good solutions at a reasonable computational cost. A heuristic is approximate in the sense that it provides (hopefully) a good solution for relatively little effort, but it does not guarantee optimality.
    It exists a Metaheuristics Network web site with information about metaheuristics. There are lots of papers and books about them.
    There are plenty of websites with information about metaheuristics. Some examples are here, here (spanish), here or here
   
    To create this taxonomy of metaheuristics, the papers that I have used have been:
Metaheuristics in Combinatorial Optimization Michel Gendreau, Jean-Yves Potvin Annals of Operations Research 140, 189-213, 2005
Meta-heuristics: The State of Art Stefan Voss Local Search for Planning and Scheduling A. Nareyek (Ed.) LNAI 2148, pp. 1-23 2001
A Taxonomy of Evolutionary Algorithms in Combinatorial Optimization Patrice Calégari, Giovanni
Coray, Alain Hertz, Daniel Kobler and Pierre Kuonen, Journal of Heuristics, 5, 145-158 (1999)
Metaheuristics: A Global View Belén Melián, José A. Moreno Pérez, J. Marcos Moreno Vega Revista
Iberoamericana de Inteligencia Artificial Nº19 (2003) pp. 7-28 (Spanish)
A Taxonomy of Hybrid Metaheuristics E.-G. Talbi Journal of Heuristics, 8: 541-564, 2002
Handbook of Metaheuristics, Glover, Fred W; Kochenberger, Gary A. (Eds) International Series in
Operations Research & Management Science, Vol. 57
Metaheuristics: A bibliography Ibrahim H. Osman, Annals of Operations Research 63(1996)513-623