Railway Crew Rostering: Tailored Optimization Solutions in Daily Use in Berlin

Abstract We are presenting a crew planning optimization project for the train drivers of an urban rail transportation company. The core is about crew rostering, i.e., defining over a certain period of time (e.g., one year) for each train driver sequences of working days and rest days, and also specifying whether working days shall contain either some early, late, or night shift. But the project was not only about solving just one classical crew rostering problem. Rather, during the last three years, the entire process of crew rostering had been investigated. Apart from having modeled, solved, and implemented two different variants of crew rostering—a cyclic and an acyclic one—there have been designed and used three further optimization models for less typical surrounding sub-processes, as well as a simple crew assignment model. During the design and implementation process of these six optimization models, the focus had been put on their annual and daily usability, respectively. In particular, many practical requirements had been collected and implemented in rather straightforward ways. The result is a family of mathematical optimization models, whose results cover the valid annual crew rosters from the year 2024 on, as well as the daily assignment of specific duties to train drivers from May 2025 on at S-Bahn Berlin GmbH.

Authors

Institutions

Publication Details

Journal
Urban Rail Transit
Published
2026-05-30
DOI
https://doi.org/10.1007/s40864-026-00272-0
Primary Topic
Railway Systems and Energy Efficiency
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Railway Crew Rostering: Tailored Optimization Solutions in Daily Use in Berlin

Christian Liebchen, Christoph Türk, Benedikt Vornhusen
Urban Rail Transit
Railway Systems and Energy Efficiency
article

Railway Crew Rostering: Tailored Optimization Solutions in Daily Use in Berlin

Christian Liebchen, Christoph Türk, Benedikt Vornhusen
article en

Abstract

Abstract We are presenting a crew planning optimization project for the train drivers of an urban rail transportation company. The core is about crew rostering, i.e., defining over a certain period of time (e.g., one year) for each train driver sequences of working days and rest days, and also specifying whether working days shall contain either some early, late, or night shift. But the project was not only about solving just one classical crew rostering problem. Rather, during the last three years, the entire process of crew rostering had been investigated. Apart from having modeled, solved, and implemented two different variants of crew rostering—a cyclic and an acyclic one—there have been designed and used three further optimization models for less typical surrounding sub-processes, as well as a simple crew assignment model. During the design and implementation process of these six optimization models, the focus had been put on their annual and daily usability, respectively. In particular, many practical requirements had been collected and implemented in rather straightforward ways. The result is a family of mathematical optimization models, whose results cover the valid annual crew rosters from the year 2024 on, as well as the daily assignment of specific duties to train drivers from May 2025 on at S-Bahn Berlin GmbH.

Urban Rail Transit
Technical University of Applied Sciences Wildau (DE), John Deere (Germany) (DE)
Sustainable cities and communities
Openalex Percentile: Top 6%
Railway Systems and Energy Efficiency
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.