MMF310

Evolutionary Computation (FFR105)

LP I (first quarter), 2006

Basic information

Lecturer and examiner:

Mattias Wahde, tel. 772 3727, e-mail: mattias.wahde@chalmers.se

Course assistant:

David Sandberg, tel. 772 3696, e-mail: david.sandberg@chalmers.se

Literature:

Wahde, M. “Lecture notes in evolutionary computation” (Handouts in several parts – will be handed out by the author). In addition, the following book might be good to have: Mitchell, M. "An introduction to genetic algorithms" (Sold by Chalmers’ bookstore (Cremona)). In addition, some scientific papers may be included in the course literature, towards the end of the course. Note, however, that the course is mainly based on the lecture notes.

Preliminary program

The numbers in brackets [ ] in the Contents column refer to the handouts (parts 1-7).

Date	Time	Room	Contents
20060904	10.00-11.45	FL51	Introduction to evolutionary algorithms and their applications
20060911	10.00-11.45	FL51	Biological background of evolutionary algorithms [1]
20060914	13.15-17.00	FL61	Basics of evolutionary algorithms [2] Handout of home problem 1.
20060915	08.00-11.45	FL51	Using genetic algorithms: Introduction to programming, function optimization, Properties of genetic algorithms (I) [3, 4]
20060918	10.00-11.45	FL51	Properties of genetic algorithms (II) [4]
20060921	13.15-15.00	FL61	Exercise class (Problem solving)
20060922	10.00-11.45	FL51	Advanced genetic algorithms (I) [5]
20060925	10.00-11.45	FL51	Exercise class (Problem solving)
20060928	13.15-15.00	FL61	Advanced genetic algorithms (II) [5]
20061002	08.00-11.45	FL51	Advanced genetic algorithms (III) Survey of various kinds of evolutionary algorithms (e.g. genetic algorithms, genetic programming, evolution strategies etc.) [6] Deadline for home problem 1 Handout of home problem 2
20061005	13.15-15.00	FL61	Applications (I) [7]
20061016	10.00-11.45	FL51	Applications (II) [7]
20061019	13.15-15.00	FL61	Applications (III), analysis of home problems, Course summary [7]
20061020	10.00-11.45	FL51	Spare lecture (CANCELLED!!) Deadline for home problem 2

Recommended problems:

1.1, 2.1, 2.5, 3.1, 3.2, 3.3, 4.2, 4.4, 5.1, 5.4, 5.5, 6.1

Exercise classes:

Two exercise (problem-solving) classes will be held. The following problems will be solved:

20060921: 1.2, 2.4, 4.1, 4.3

20060925: 4.7a, 4.8, 5.3

Examination

The examination will consist of two sets of home problems, and an exam at the end of the course.

Home problems: The problem sheets will be handed out on 20060914 (set 1) and 20061002 (set 2), and should be handed in no later than 20061002 (set 1) and 20061020 (set 2). Maximum total score: 25p.

Set 1. For problem 1.2, you need the following data set: HP1.2data.txt.

Set 2.

For problem 2.1, you need the following data set: TSPcities2_1.m. The paths (for problem 2.1) can be plotted in many different ways. Here are three Matlab functions that you may use (you may, of course, write your own functions as well): InitTSPPlot.m, InitConnections.m, PlotPath.m. The PlotPath function requires a path in the form of a vector of city indices.

For problem 2.3, you need the following data set: FunctionData2.3.txt. You may also wish to use Matlab structs. A simple example of the usage of structs is given here: Main.m, InitPop.m. Download both files (to the same directory), start Matlab, and write >> Main.

Exam: The exam will take place on 20061021, 08.30 - 12.30, in the Mechanical Engineering building.

Maximum total score: 25p

The requirements for the various grades are as follows:

A minimum of 10p is required (Note!) on the exam. Grades will be set according to

ECTS: