liu.seSearch for publications in DiVA
12343 of 4
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • oxford
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
Optimization Models for Shift Scheduling for Train Dispatchers
Linköping University, Department of Science and Technology, Communications and Transport Systems. Linköping University, Faculty of Science & Engineering.
2024 (English)Licentiate thesis, comprehensive summary (Other academic)
Abstract [en]

Train dispatchers play a vital role for safe and efficient railway operations. Their role includes several tasks, such as controlling train movements, maneuvering railway infrastructures (e.g., switches and signals), communicating with train crew and maintenance contractors. Dispatching centers operate around the clock, resulting in a high risk of fatigue for dispatchers, especially during night shifts. Moreover, dispatchers’ cognitive performance deteriorates when workload levels are too high. Although workload is a subjective measure, it is correlated with task load, i.e., the number of tasks executed in a given period of time. A preventive approach against too high workload levels is to account for the task load already during the scheduling phase. Currently, shifts are scheduled manually, which is a very complex task that cannot guarantee a satisfying quality both in terms of high efficiency and balanced workload levels.

The aim of this thesis is to create a scheduling framework, based on mathematical optimization models, that supports shift planners in their work. The framework helps in automatizing the scheduling process and improves the quality of the resulting shifts. Our initial approach is to use our models to figure out the required staffing levels and produce baseline schedules, and then improve these by increasing their attractiveness. To achieve this goal, we conduct three related studies considering the case of Malm¨o dispatching center. The studies result in different optimization models for shift scheduling of train dispatchers. We present the complete results in the following three papers:

In the first paper, we build an optimization model for one-day shift scheduling, where the objective function is to minimize the number of needed dispatchers. Moreover, we analyze the impact on the computation time of different parameters, such as the number of geographical areas and how these are combined. The results of the experiments are obtained within acceptable run times for real-world size instances. In the second paper, we suggest a stronger formulation of the previous model; in addition, we focus on improving the quality of the shifts. The improvements consider avoiding undesirable start times (between 00 and 05 am) and too short shifts (shorter than 6h). Our major contribution in this paper is giving four approaches for defining and modeling area-dispatcher-assignment switches, called handovers,  which occur when a dispatcher changes the assigned controlled areas during a shift. Two of these approaches gave promising results for solving real-world size instances to optimality within acceptable run times.

In the third paper, we increase the time horizon from one day to a week. We do this by combining the resulting shifts from some instances in the second paper where we consider a list of legal constraints, such as resting time between shifts, weekly rest and the total weekly working hours. In addition, we analyze the impact of the variability in shift lengths on the quality of the weekly schedules. 

Place, publisher, year, edition, pages
Linköping: Linköping University Electronic Press, 2024. , p. 42
Series
Linköping Studies in Science and Technology. Licentiate Thesis, ISSN 0280-7971 ; 2005
National Category
Transport Systems and Logistics
Identifiers
URN: urn:nbn:se:liu:diva-207822DOI: 10.3384/9789180757959ISBN: 9789180757942 (print)ISBN: 9789180757959 (electronic)OAI: oai:DiVA.org:liu-207822DiVA, id: diva2:1900850
Presentation
2024-10-15, K3, Kåkenhus, Campus Norrköping, Norrköping, 10:15
Opponent
Supervisors
Available from: 2024-09-25 Created: 2024-09-25 Last updated: 2024-09-30Bibliographically approved
List of papers
1. Shift Scheduling for Train Dispatchers
Open this publication in new window or tab >>Shift Scheduling for Train Dispatchers
2023 (English)In: Book of Abstracts / [ed] Rob Goverde, Francesco Corman, Ivan Belošević, Sanjin Milinković, The Faculty of Transport and Traffic Engineering, University of Belgrade, Serbia , 2023, p. 120-120Conference paper, Oral presentation with published abstract (Other academic)
Abstract [en]

Train dispatchers monitor and control train traffi c from a dispatching center, which isresponsible for a certain region in the railway network. This region is divided into subareas, where each train dispatcher controls one or several subareas at any time. Giventhe high safety concerns of their profession, dispatchers’ working shifts should fulfi lseveral legal and operational constraints, such as bounds on the length of shifts andon the resting periods between shifts. To construct shift schedules for train dispatchers is a complex and time-consuming process that is currently done manually. In thispaper, we present an optimization framework to automate this process, based on amodel for single-day shifts. Here, we focus on the objective of minimizing the numberof dispatchers as a baseline for future objectives. We present experimental results forreal-world sized data (number of geographical areas and train movements in the orderof magnitude as for one dispatching center in Sweden, covering the southern partof the country). We study the impact on the run time for diff erent input parameters,namely: the total number of geographical areas, the maximum number of geographical areas that can be assigned to a dispatcher in any period, changes in adjacencybetween the geographical areas, and the number of geographical areas that eachdispatcher is qualifi ed to monitor. The run time for the instances is between 19 and305 seconds

Place, publisher, year, edition, pages
The Faculty of Transport and Traffic Engineering, University of Belgrade, Serbia, 2023
Keywords
Integer Programming; Shift scheduling; Railway dispatching; Area combination
National Category
Transport Systems and Logistics
Identifiers
urn:nbn:se:liu:diva-194790 (URN)978-86-7395-467-7 (ISBN)
Conference
10th International Conference on Railway Operations Modelling and Analysis (ICROMA), Belgrade, Serbia, April 25th – 28th, 2023
Available from: 2023-06-12 Created: 2023-06-12 Last updated: 2024-09-25
2. Improving attractiveness of working shifts for train dispatchers
Open this publication in new window or tab >>Improving attractiveness of working shifts for train dispatchers
2024 (English)In: Transportmetrica B: Transport Dynamics, ISSN 2168-0566, Vol. 12, no 1, article id 2380912Article in journal (Refereed) Published
Abstract [en]

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.

Place, publisher, year, edition, pages
TAYLOR & FRANCIS LTD, 2024
Keywords
Train dispatcher shift scheduling; integer programming; shift scheduling; handovers
National Category
Computational Mathematics
Identifiers
urn:nbn:se:liu:diva-206260 (URN)10.1080/21680566.2024.2380912 (DOI)001281119000001 ()
Note

Funding Agencies|Trafikverket [TRV 2020/99267]

Available from: 2024-08-14 Created: 2024-08-14 Last updated: 2024-09-25

Open Access in DiVA

fulltext(3323 kB)0 downloads
File information
File name FULLTEXT01.pdfFile size 3323 kBChecksum SHA-512
2f9b3b61da29361c8298aa722603a3944f31e13445596d1c85e8b2133fbe430d32f64a18b301c545e8e5b60a0c16c0ef2d5fc95cc447f945f69badd1e1370ea3
Type fulltextMimetype application/pdf
Order online >>

Other links

Publisher's full text

Authority records

Zahir, Rabii

Search in DiVA

By author/editor
Zahir, Rabii
By organisation
Communications and Transport SystemsFaculty of Science & Engineering
Transport Systems and Logistics

Search outside of DiVA

GoogleGoogle Scholar
The number of downloads is the sum of all downloads of full texts. It may include eg previous versions that are now no longer available

doi
isbn
urn-nbn

Altmetric score

doi
isbn
urn-nbn
12343 of 4
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • oxford
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf