A heuristic for real-time crew rescheduling during small disruptions

Thijs Verhaegh, Dennis Huisman, Pieter-Jan Fioole, Juan C Vera Lizcano

Research output: Contribution to journalArticleScientificpeer-review

Abstract

Due to unforeseen problems, disruptions occur in passenger railway operations. Proper real-time crew management is needed to prevent disruptions to spread over space and time. Netherlands Railways has algorithmic support from a solver to obtain good crew rescheduling solutions during big disruptions. However, small disruptions are still manually solved by human dispatchers who have limited solving capacity. In this paper the rescheduling for crews during small disruptions is modeled as inserting an uncovered task in a feasible set of duties. The problem is solved as an iterative-deepening depth-first search in a tree. To reduce computation time, we use several ideas to prune unpromising parts of the tree. We have tested the heuristic on about 5000 test instances obtained from real-world data. These tests show that the heuristic delivers good and desirable rescheduling solutions within at most 2 s.
LanguageEnglish
Pages325-342
JournalPublic Transport
Volume9
Issue number1
DOIs
StatePublished - Jul 2017

Keywords

  • crew rescheduling
  • depth-first iterative-deepening
  • heuristic
  • railway optimization
  • real-time scheduling

Cite this

Verhaegh, Thijs ; Huisman, Dennis ; Fioole, Pieter-Jan ; Vera Lizcano, Juan C. / A heuristic for real-time crew rescheduling during small disruptions. In: Public Transport. 2017 ; Vol. 9, No. 1. pp. 325-342
@article{dd730c0da86848e7b74323ff52ca972c,
title = "A heuristic for real-time crew rescheduling during small disruptions",
abstract = "Due to unforeseen problems, disruptions occur in passenger railway operations. Proper real-time crew management is needed to prevent disruptions to spread over space and time. Netherlands Railways has algorithmic support from a solver to obtain good crew rescheduling solutions during big disruptions. However, small disruptions are still manually solved by human dispatchers who have limited solving capacity. In this paper the rescheduling for crews during small disruptions is modeled as inserting an uncovered task in a feasible set of duties. The problem is solved as an iterative-deepening depth-first search in a tree. To reduce computation time, we use several ideas to prune unpromising parts of the tree. We have tested the heuristic on about 5000 test instances obtained from real-world data. These tests show that the heuristic delivers good and desirable rescheduling solutions within at most 2 s.",
keywords = "crew rescheduling, depth-first iterative-deepening, heuristic, railway optimization, real-time scheduling",
author = "Thijs Verhaegh and Dennis Huisman and Pieter-Jan Fioole and {Vera Lizcano}, {Juan C}",
year = "2017",
month = "7",
doi = "10.1007/s12469-017-0155-1",
language = "English",
volume = "9",
pages = "325--342",
journal = "Public Transport",
issn = "1613-7159",
publisher = "Springer Verlag",
number = "1",

}

A heuristic for real-time crew rescheduling during small disruptions. / Verhaegh, Thijs; Huisman, Dennis; Fioole, Pieter-Jan; Vera Lizcano, Juan C.

In: Public Transport, Vol. 9, No. 1, 07.2017, p. 325-342.

Research output: Contribution to journalArticleScientificpeer-review

TY - JOUR

T1 - A heuristic for real-time crew rescheduling during small disruptions

AU - Verhaegh,Thijs

AU - Huisman,Dennis

AU - Fioole,Pieter-Jan

AU - Vera Lizcano,Juan C

PY - 2017/7

Y1 - 2017/7

N2 - Due to unforeseen problems, disruptions occur in passenger railway operations. Proper real-time crew management is needed to prevent disruptions to spread over space and time. Netherlands Railways has algorithmic support from a solver to obtain good crew rescheduling solutions during big disruptions. However, small disruptions are still manually solved by human dispatchers who have limited solving capacity. In this paper the rescheduling for crews during small disruptions is modeled as inserting an uncovered task in a feasible set of duties. The problem is solved as an iterative-deepening depth-first search in a tree. To reduce computation time, we use several ideas to prune unpromising parts of the tree. We have tested the heuristic on about 5000 test instances obtained from real-world data. These tests show that the heuristic delivers good and desirable rescheduling solutions within at most 2 s.

AB - Due to unforeseen problems, disruptions occur in passenger railway operations. Proper real-time crew management is needed to prevent disruptions to spread over space and time. Netherlands Railways has algorithmic support from a solver to obtain good crew rescheduling solutions during big disruptions. However, small disruptions are still manually solved by human dispatchers who have limited solving capacity. In this paper the rescheduling for crews during small disruptions is modeled as inserting an uncovered task in a feasible set of duties. The problem is solved as an iterative-deepening depth-first search in a tree. To reduce computation time, we use several ideas to prune unpromising parts of the tree. We have tested the heuristic on about 5000 test instances obtained from real-world data. These tests show that the heuristic delivers good and desirable rescheduling solutions within at most 2 s.

KW - crew rescheduling

KW - depth-first iterative-deepening

KW - heuristic

KW - railway optimization

KW - real-time scheduling

U2 - 10.1007/s12469-017-0155-1

DO - 10.1007/s12469-017-0155-1

M3 - Article

VL - 9

SP - 325

EP - 342

JO - Public Transport

T2 - Public Transport

JF - Public Transport

SN - 1613-7159

IS - 1

ER -