DM812 – Metaheuristics

Second quarter 2008: Monday 10-12 and Thursday 8-10 starting November 3, 2008, in IMADA Seminarrum.


1. 03.11.2008 Revision on Heuristics and Generalized Local Search Machines [slides by H. Hoos and T. Stützle]
2. 06.11.2008 Simulated Annealing, Markov Chains and Convergence Analysis [slides]
3. 10.11.2008 Experimental analysis and configuration tools [slides]
4. 13.11.2008 Laboratory [slides] [data1] [data2] [wrapper-race] [plot.race] [doc]
5. 17.11.2008 Scatter Search and Path Relinking [slides]
6. 20.11.2008 Evolutionary Algorithms [slides]
7. 24.11.2008 Paper discussion
8. 27.11.2008 Ant Colony Optimization [slides]
9. 01.12.2008 No Free Lunch Theorem [exercises] [slides]
10. 04.12.2008 Machine Learning and Estimation of Distribution Algorithms [slides]
11. 08.12.2008 Paper discussion
12. 11.12.2008 Cross Entropy Method and Continuous Optimization [slides]
13. 15.12.2008 Nelder Mead Method + Paper Discussion [slides]
14. 18.12.2008 Metaheuristics for Continuous Optimization and Other Topics [slides]



  • [B1] Stochastic Local Search: Foundations and Applications, H. Hoos and T. Stützle, 2005, Morgan Kaufmann

  • [B2] Handbook of Approximation Algorithms and Metaheuristics. T.F. Gonzalez, Chapman & Hall/CRC Computer and Information Science, 2007.

  • [B3] Search methodologies: introductory tutorials in optimization and decision support techniques E.K. Burke & G. Kendall, 2005, Springer, New York

  • [B4] Theoretical Aspects of Local Search. W. Michiels, E. Aarts, & J. Korst, Springer Berlin Heidelberg, 2007

  • [B5] Ant Colony Optimization M. Dorigo and T. Stützle, 2004, The MIT Press.

  • [B6] Handbook of Metaheuristics Handbook of Metaheuristics F. Glover & G. Kochenberger (ed.) Kluwer Academic Publishers, Norwell, MA, USA, 2002, 57

  • [B7] Local Search in Combinatorial Optimization Local Search in Combinatorial Optimization, E. Aarts & J. Lenstra (ed.) John Wiley & Sons, New York, NY, USA, 1997


  • [A1] Optimization by Simulated Annealing. S. Kirkpatrick, D. Gelatt & M. P. Vecchi. Science, 1983, 220, 671-680

  • [A9] The No Free Lunch and Problem Description Length Schumacher, C.; Vose, M. D. & Whitley, Proceedings of the Genetic and Evolutionary Computation Conference (GECCO-2001), Morgan Kaufmann Publishers, San Francisco, CA, USA, 2001, 565-570

  • [A16] Simplex Method for Function Minimization. Nelder, J. A. & Mead, R. A The Computer Journal, 1965, 7, 308-313

  • [A18] Strategies for the Parallel Implementation of Metaheuristics Cung, V.; Martins, S. L.; Ribeiro, C. C. & Roucairol. Essays and Surveys in Metaheuristics, Kluwer Academic Publishers, 2001.


  • Object-oriented framework for population-based metaheuristics: ParadisEO


Project assignment:

  • Text (launched December 14, 2008)

Hand in deadline: Monday, January 19, 2008

Course Evaluation

Students’ Evaluation. Action plan in response to students’ evaluation.