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 - Stochastic optimization algorithms
 
Syllabus adopted 2010-02-25 by Head of Programme (or corresponding)
Owner: MPCAS
7,5 Credits
Grading: TH - Five, Four, Three, Not passed
Education cycle: Second-cycle
Major subject: Bioengineering, Chemical Engineering, Engineering Physics
Department: 16 - PHYSICS


Teaching language: English
Open for exchange students
Block schedule: D

Course module   Credit distribution   Examination dates
Sp1 Sp2 Sp3 Sp4 Summer course No Sp
0199 Examination 7,5 c Grading: TH   7,5 c   25 Oct 2012 pm V,  17 Jan 2013 pm M,  27 Aug 2013 am V

In programs

MPSYS SYSTEMS, CONTROL AND MECHATRONICS, MSC PROGR, Year 2 (elective)
TKITE SOFTWARE ENGINEERING, Year 3 (compulsory elective)
MPENM ENGINEERING MATHEMATICS AND COMPUTATIONAL SCIENCE, MSC PROGR, Year 2 (elective)
MPCAS COMPLEX ADAPTIVE SYSTEMS, MSC PROGR, 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 engineering mathematics. .

Aim

The aim of the course is for the students to attain 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.

Learning outcomes (after completion of the course the student should be able to)


  • Implement and use several different classical optimization methods, e.g. gradient descent and penalty methods.

  • Describe and explain the basic properties of biological evolution, with emphasis on the parts that are relevant for evolutionary algorithms.

  • Define and implement (using Matlab) different versions of evolutionary algorithms, particle swarm optimization, and ant colony optimization, and apply the algorithms in the solution of optimization problems.

  • Compare different types of biologically inspired computation methods and identify suitable algorithms for a variety of applications.

Content

The course consists of the following topics:
- Classical optimization methods. Gradient descent. Convex functions. The lagrange multiplier method. Penalty methods.
- Evolutionary algorithms. Fundamentals of genetic algorithms, representations, genetic operators, selection mechanisms. Theory of genetic algorithms. Analytical properties of evolutionary algorithms. (Linear) genetic programming: representation and genetic operators.
- Particle swarm optimization. Fundamentals and applications.
- Ant colony optimization. Fundamentals and applications.
- Comparison of the different algorithms

Organisation

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

Literature

Wahde, M. Biologically inspired optimization methods: An introduction

Examination

The examination is based on a written exam and home problems.


Page manager Published: Thu 03 Nov 2022.