Scholarlink

<p>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&#xa0;2024 on, as well as the daily assignment of specific duties to train drivers from May&#xa0;2025 on at S-Bahn Berlin&#xa0;GmbH.</p>

错误：搜索内容不能为空，请输入英文关键词
错误：关键词超出字数限制，请精简
高级检索

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

  • 期刊论文

  • 出版模式：

    开放获取

  • 发表日期：

    2026年5月30日

查看全文
  • Christian Liebchen,
  • Christoph Türk,
  • Benedikt Vornhusen

摘要

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.