liu.seSearch for publications in DiVA
Change search
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
Late Train-Crew Rescheduling—a Model and a Heuristic Approach
Linköping University, Department of Science and Technology, Communications and Transport Systems. Linköping University, Faculty of Science & Engineering.
Linköping University, Department of Science and Technology, Communications and Transport Systems. Linköping University, Faculty of Science & Engineering.ORCID iD: 0000-0001-6829-8219
Linköping University, Department of Science and Technology, Communications and Transport Systems. Linköping University, Faculty of Science & Engineering.ORCID iD: 0000-0001-6880-8549
Linköping University, Department of Science and Technology, Communications and Transport Systems. Linköping University, Faculty of Science & Engineering.ORCID iD: 0000-0003-2548-5756
2025 (English)In: Transportation Research Procedia, ISSN 2352-1465, Vol. 86, p. 337-344Article in journal (Refereed) Published
Abstract [en]

In this paper, we reschedule the duties of train drivers one day before the operation. Due to absent drivers (e.g., because of sick leave), some trains have no driver. Thus, duties on the operation day need to be rescheduled. We start with a feasible crew schedule of the remaining operating drivers, a set of unassigned tasks which were assigned to the absent drivers, and a group of standby drivers with fixed start time, end time, start depot, and end depot. Our aim is to generate a crew schedule with as few cancelled driving tasks and changed tasks as possible. We developed a Mixed Integer Linear Programming (MILP) model for short-term crew rescheduling. We also present a Tabu-Search-Based approach with the same objective function and equivalent restrictions of our mathematical model. We compare the results of the MILP model solved by Gurobi 11.0 and of the Tabu-Search-Based approach. Our Tabu-Search-Based approach takes less time and memory occupation to compute a 'good-enough' result. We further test the performance of our approach under different circumstances. The data used in the experiments are real data provided by Mälartåg.

Place, publisher, year, edition, pages
Elsevier, 2025. Vol. 86, p. 337-344
Keywords [en]
Mixed integer linear programming; Railway crew rescheduling; Tabu search
National Category
Computer Sciences
Identifiers
URN: urn:nbn:se:liu:diva-214970DOI: 10.1016/j.trpro.2025.04.043Scopus ID: 2-s2.0-105007064915OAI: oai:DiVA.org:liu-214970DiVA, id: diva2:1970744
Available from: 2025-06-17 Created: 2025-06-17 Last updated: 2025-09-22

Open Access in DiVA

fulltext(433 kB)42 downloads
File information
File name FULLTEXT01.pdfFile size 433 kBChecksum SHA-512
0114b2cccde806a57e5a41157d4965b3c5dbdbdc45b246fb97aefc0265f6858da4694b665ede9034a3214c819362ca6ab65c7de699a09313589d8a767ff11f38
Type fulltextMimetype application/pdf

Other links

Publisher's full textScopus

Search in DiVA

By author/editor
Yu, LiyunHäll, Carl HenrikPeterson, AndersSchmidt, Christiane
By organisation
Communications and Transport SystemsFaculty of Science & Engineering
Computer Sciences

Search outside of DiVA

GoogleGoogle Scholar
Total: 42 downloads
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
urn-nbn

Altmetric score

doi
urn-nbn
Total: 74 hits
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