Evolutionary algorithms

Module Code
BI5004
Module Coordinators
Heinz-Uwe Hobohm
Teachers
Heinz-Uwe Hobohm
Short Description
Knowledge of the strength and particular areas of application of evolutionary algorithms.
Learning Objectives

Students know evolutionary algorithms, i.e. genetic algorithms or Koza's genetic programming and their application. They know of the strength and particular areas of application of evolutionary algorithms. Programming and testing of own applications.

Contents
  • Optimization of genoms
  • Travelling salesman problem
  • Ant colony optimization algorithm
  • Genetic Programming (GP)
  • Examples from the literature
Duration in Semester
1
Instruction Language
German
Total Effort
6 CrP; an estimated 180 hours, of which approximately 60 are spent in class.
Weekly School Hours
4
Method of Instruction
Lecture 1 sppw Practical Course 3 sppw
Requirements for the awarding of Credit Points
Acceptance of programmed algorithms
Evaluation Standard
according to examination regulations (§ 9)
Availability
Yearly
References
  • M. Mitchell: An introduction to genetic algorithms
  • D. Goldberg: Genetic algorithms
  • Poli, Langdon, McPhee: A field guide to genetic algorithms
  • U. Hobohm: Kursskript
Prerequisites
Programming skills in an object oriented programming language (preferably Java, C++).