We consider the problem of scheduling shifts for train dispatchers: given legal and operational constraints, the dispatching work in geographical areas should be assigned to dispatchers. In previous work, we presented an integer-programming framework for scheduling one-day shifts, aiming to minimize the number of dispatchers needed. Here, we present a stronger formulation for this problem. Moreover, we handle several quality aspects of the resulting shifts: we exclude undesirable start times and too short shifts; and we present four approaches to handle unnecessary changes in the dispatcher-area assignments. With an experimental performance-evaluation, we show that the stronger model significantly reduces the runtime in all but one instance, with an average decrease of 82.2 percent. We can solve all real-world-sized instances in less than 10 seconds. Moreover, we compare the four handover-approaches on instances with different temporal and geographical resolutions, and show that the two promising approaches allow us to solve a real-world-sized instance.
Improving attractiveness of working shifts for train dispatchers
TRANSPORTMETRICA B
T. LIDÉN ET AL.
31.12.2024
21 pages
Aufsatz (Zeitschrift)
Elektronische Ressource
Englisch
Improving interface usability for train dispatchers in future traffic control systems
British Library Conference Proceedings | 1998
|Modern Problems of Assessing the Work Efficiency of Train Dispatchers
Springer Verlag | 2022
|Training Method of Communication Skills for Train Dispatchers in Abnormal Situations
British Library Online Contents | 2016
|