Department of Information and Computing Sciences

Departement Informatica Onderwijs
Bachelor Informatica Informatiekunde Kunstmatige intelligentie Master Computing Science Game&Media Technology Artifical Intelligence Human Computer Interaction Business Informatics

Onderwijs Informatica en Informatiekunde

Vak-informatie Informatica en Informatiekunde

Optimization for sustainability

Course code:INFOMOFS
Credits:7.5 ECTS
Period:period 4 (week 17 through 26, i.e., 26-4-2021 through 2-7-2021; retake week 28)
Participants:up till now 29 subscriptions
Schedule:Official schedule representation can be found in MyTimetable
innovatie          Marjan van den Akker
lecture          Marjan van den Akker
Jan Posthoorn
Contents:The current energy transition leads to many changes in the energy as well as the mobility system. In this course, we study algorithmic techniques to optimize the performance of future energy systems and discuss topics from sustainable public transportation. We discuss Mixed Integer Linear Programming (MIP) formulations, branch-and-cut, and simulation. Students learn how to apply these techniques to different optimization problem related to energy systems, such as network design, unit commitment, load flow, demand response, and storage optimization. Moreover, we discuss question around electric buses, environmental friendly bus driving, and mulit-modal route planning . The topics in this course are related to recent research in the Algorithms and Complexity group.

In this course you learn algorithms and methods that are also used by companies to solve real-world problems.


  1. This course in primarily meant for students from the Computing Science master. The focus is on Operations Research and computer science. The required knowledge is mathematics and statistics at the level of the bachelor computer science, algorithms (e.g. Algorithms from the bachelor) and programming at the level of Imperative Programming.
  2. This course will not deal with political or policy issues in the domain of `sustainability', but is devoted entirely to (a selection of) the computational models and optimizing algorithms that are developing in the field.

In the course the students learn to:

  • Understand discrete-event simulation models and statistical analysis methods for these models
  • Create a discrete-event simulation model for a given system
  • Perform a scientific sound simulation study including statistical analysis
  • Understand optimization models for sustainable mobility and energy systems
  • Understand applications of optimization algorithms and simulation to sustainable mobility and energy systems
  • Assess and present scientific papers on optimization algorithms and simulation to sustainable mobility and energy systems
  • Identify and describe possibilities for applications of optimization algorithms and simulation to sustainable mobility and energy systems
Literature:material will be made available.
Course form:
  • lectures,
  • seminar: discussion and presentation of papers
Exam form:The grading consists of the following parts:
  • Hand-in exercises : 1) Simulation model (5%), 2) Input analysis (5%), 3) Optimization challenge energy and mobility (10%)
  • Simulation assignment : 40%
  • Seminar : 40%
To obtain a pass grade
  • The grade for the Optimization challenge exercise has to be at least 5.0
  • You attended the milestone and feedback meeting of the simulation assignment in person. It is not sufficient if the other member of your group attended.
  • You have attended the seminar sessions (exceptions for valid reasons are possible, contact teacher before the session)
Minimum effort to qualify for 2nd chance exam:Minimum required effort:
  • Your final grade is at least 4
  • You delivered the hand-in exercises on time.
  • You received a pass for the milestone of the simulation assignment
  • Exceptions on the above have to be approved by the study advisor.
You can take an additional exam for at most one out of hand-in exercises, simulation assignment, seminar; which one is decided in discussion with the teacher.