Course syllabus for Stochastic optimization algorithms

Course syllabus adopted 2024-01-31 by Head of Programme (or corresponding).

Overview

  • Swedish nameStokastiska optimeringsmetoder
  • CodeFFR105
  • Credits7.5 Credits
  • OwnerMPCAS
  • Education cycleSecond-cycle
  • Main field of studyBioengineering, Chemical Engineering, Engineering Physics
  • DepartmentMECHANICS AND MARITIME SCIENCES
  • GradingTH - Pass with distinction (5), Pass with credit (4), Pass (3), Fail

Course round 1

  • Teaching language English
  • Application code 11122
  • Maximum participants200 (at least 10% of the seats are reserved for exchange students)
  • Block schedule
  • Open for exchange studentsYes

Credit distribution

0199 Examination 7.5 c
Grading: TH
7.5 c
  • 30 Okt 2024 am J
  • 07 Jan 2025 am J
  • 28 Aug 2025 am J

In programmes

Examiner

Go to coursepage (Opens in new tab)

Eligibility

General entry requirements for Master's level (second cycle)
Applicants enrolled in a programme at Chalmers where the course is included in the study programme are exempted from fulfilling the requirements above.

Specific entry requirements

English 6 (or by other approved means with the equivalent proficiency level)
Applicants enrolled in a programme at Chalmers where the course is included in the study programme are exempted from fulfilling the requirements above.

Course specific prerequisites

Basic programming and courses in linear algebra and mathematical analysis or corresponding

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 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. Ethical aspects of machine learning

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 including compulsory elements

The examination is based on a written exam (50 %) and compulsory home problems (50 %).

The course examiner may assess individual students in other ways than what is stated above if there are special reasons for doing so, for example if a student has a decision from Chalmers on educational support due to disability.