Search programme

​Use the search function to search amongst programmes at Chalmers. The programme overview and the programme syllabus relating to your studies are generally from the academic year you began your studies.

​​​

Syllabus for

Academic year
FFR105 - Evolutionary computation
 
Owner: FCMAS
5,0 Credits (ECTS 7,5)
Grading: TH - Five, Four, Three, Not passed
Level: C
Department: 16 - PHYSICS


Teaching language: English

Course module   Credit distribution   Examination dates
Sp1 Sp2 Sp3 Sp4 No Sp
0199 Examination 5,0 c Grading: TH   5,0 c   Contact examiner,  Contact examiner

In programs

TTFYA ENGINEERING PHYSICS, Year 4 (elective)
TITEA SOFTWARE ENGINEERING, Year 3 (elective)
FCMAS MSc PROGRAMME IN COMPLEX ADAPTIVE SYSTEMS, Year 1 (compulsory)

Examiner:

Professor  Mattias Wahde



Eligibility:

For single subject courses within Chalmers programmes the same eligibility requirements apply, as to the programme(s) that the course is part of.

Course specific prerequisites

Programming, basic mathematics.

Aim

The course provides basic knowledge of new methods in computer science inspired by evolutionary processes in nature, such as genetic algorithms, genetic programming, and artificial life. These are both relevant to technical applications, for example in optimization and design of autonomous systems, and for understanding biological systems, e.g., through simulation of evolutionary processes.

Content

The course consists of the following topics:
- Evolutionary algorithms. Fundamentals of genetic algorithms, representations, genetic operators, selection mechanisms. Theory of genetic algorithms. The schema theorem and extensions. Genetic programming: representation and genetic operators.
- Applications of evolutionary algorithms: Optimization problems. Data mining. Evolving neural networks. Design of autonomous systems. The credit assignment problem.
- Artificial life: Self-organization in evolutionary processes. Game theory and multi-agent systems. Models of coevolution. Collective behavior.

Organisation

The course is organized as a series of lectures. Some lectures are devoted to problem-solving.

Literature

Melanie Mitchell, Introduction to genetic algorithms, MIT Press, 1996. Handouts (provided by the lecturer).

Examination

Through homework problems during the course, a small midterm exam, and a final exam.


Page manager Published: Thu 03 Nov 2022.