IM Challenge
The summer semester of 2026 is just around the corner: the IM Challenge is back—this time with a problem posed by DB Regio. The challenge involves optimizing shift scheduling for regional passenger transport. You can find more information further down on this page.
The concept of the IM Challenge is explained in the following video using the example of the task of the IM Challenge 2021 (German only):
Teaser IM Challenge 2021 © Lehrstuhl IM
| Contact | |
| Module |
D-WW-WIWI-1013 |
| Scope and type | Project, 10 credit points |
|
|
| Exam |
|
| Dates |
|
| Content |
In contrast to many small scale academic examples, real-world planning problems from production management or logistics can often only be solved with considerable computational effort. For this reason, it has long been common practice in research to solve problems with higher complexity by supporting standard software (e.g. solvers) or to program corresponding solution algorithms. By facing the IM Challenge, advanced students of master or diploma courses be given the opportunity to familiarize themselves with a defined business problem and then to implement it independently and in a problem-oriented manner. The competition between the participants ("Who achieves the best solution?") provides additional motivation. |
|
IM Challenge 2025 |
The IM Challenge 2026 calls for a solution to a problem posed by DB Regio. The challenge involves creating shift schedules for train attendants, a highly complex planning problem in local rail passenger transport. In particular, when only a portion of all trains is to be staffed, this cannot be modeled using conventional planning systems and solution methods. As part of the Sina project between DB Regio AG and TU Dresden, a new approach to shift scheduling was developed that takes quotas into account and successfully supports planning through a software solution. However, there is still room for continuous improvement, and by participating in the IM Challenge, you can actively contribute to making it better. |