Optimising the travel time of a line plan

Simon Henry Bull, Jesper Larsen*, Richard Martin Lusby, Natalia Jurjevna Rezanova

*Corresponding author for this work

Research output: Contribution to journalJournal articleResearchpeer-review

Abstract

The line planning problem that arises in the planning of a passenger railway involves selecting a number of lines from a potential pool to provide sufficient passenger capacity, meeting operational requirements, while optimising some measure of line quality. We model, and solve, the problem of minimising the average passenger system time, including frequency-dependent estimates for switching between lines in collaboration with Danish State Railways (DSB). We present a multi-commodity flow formulation for the problem of freely routing passengers, coupled to discrete line-frequency decisions selecting lines from a predefined pool. The performance of the developed methodology is analysed on instances taken from the suburban commuter network, DSB S-tog, in Copenhagen, Denmark. We show that the proposed approach yields line plans that are superior from both an operator and a passenger perspective to line plans that have been implemented in practice.
Original languageEnglish
Journal4OR
Volume17
Issue number3
Pages (from-to)225-259
ISSN1619-4500
DOIs
Publication statusPublished - 2019

Keywords

  • Passenger railway optimisation
  • Line planning
  • Mixed integer programming Mathematics Subj

Cite this

Bull, Simon Henry ; Larsen, Jesper ; Lusby, Richard Martin ; Rezanova, Natalia Jurjevna. / Optimising the travel time of a line plan. In: 4OR. 2019 ; Vol. 17, No. 3. pp. 225-259.
@article{cda280fb0d54408dabb7de2e9b25cbff,
title = "Optimising the travel time of a line plan",
abstract = "The line planning problem that arises in the planning of a passenger railway involves selecting a number of lines from a potential pool to provide sufficient passenger capacity, meeting operational requirements, while optimising some measure of line quality. We model, and solve, the problem of minimising the average passenger system time, including frequency-dependent estimates for switching between lines in collaboration with Danish State Railways (DSB). We present a multi-commodity flow formulation for the problem of freely routing passengers, coupled to discrete line-frequency decisions selecting lines from a predefined pool. The performance of the developed methodology is analysed on instances taken from the suburban commuter network, DSB S-tog, in Copenhagen, Denmark. We show that the proposed approach yields line plans that are superior from both an operator and a passenger perspective to line plans that have been implemented in practice.",
keywords = "Passenger railway optimisation, Line planning, Mixed integer programming Mathematics Subj",
author = "Bull, {Simon Henry} and Jesper Larsen and Lusby, {Richard Martin} and Rezanova, {Natalia Jurjevna}",
year = "2019",
doi = "10.1007/s10288-018-0391-5",
language = "English",
volume = "17",
pages = "225--259",
journal = "4 O R",
issn = "1619-4500",
publisher = "Springer",
number = "3",

}

Optimising the travel time of a line plan. / Bull, Simon Henry; Larsen, Jesper; Lusby, Richard Martin ; Rezanova, Natalia Jurjevna.

In: 4OR, Vol. 17, No. 3, 2019, p. 225-259.

Research output: Contribution to journalJournal articleResearchpeer-review

TY - JOUR

T1 - Optimising the travel time of a line plan

AU - Bull, Simon Henry

AU - Larsen, Jesper

AU - Lusby, Richard Martin

AU - Rezanova, Natalia Jurjevna

PY - 2019

Y1 - 2019

N2 - The line planning problem that arises in the planning of a passenger railway involves selecting a number of lines from a potential pool to provide sufficient passenger capacity, meeting operational requirements, while optimising some measure of line quality. We model, and solve, the problem of minimising the average passenger system time, including frequency-dependent estimates for switching between lines in collaboration with Danish State Railways (DSB). We present a multi-commodity flow formulation for the problem of freely routing passengers, coupled to discrete line-frequency decisions selecting lines from a predefined pool. The performance of the developed methodology is analysed on instances taken from the suburban commuter network, DSB S-tog, in Copenhagen, Denmark. We show that the proposed approach yields line plans that are superior from both an operator and a passenger perspective to line plans that have been implemented in practice.

AB - The line planning problem that arises in the planning of a passenger railway involves selecting a number of lines from a potential pool to provide sufficient passenger capacity, meeting operational requirements, while optimising some measure of line quality. We model, and solve, the problem of minimising the average passenger system time, including frequency-dependent estimates for switching between lines in collaboration with Danish State Railways (DSB). We present a multi-commodity flow formulation for the problem of freely routing passengers, coupled to discrete line-frequency decisions selecting lines from a predefined pool. The performance of the developed methodology is analysed on instances taken from the suburban commuter network, DSB S-tog, in Copenhagen, Denmark. We show that the proposed approach yields line plans that are superior from both an operator and a passenger perspective to line plans that have been implemented in practice.

KW - Passenger railway optimisation

KW - Line planning

KW - Mixed integer programming Mathematics Subj

U2 - 10.1007/s10288-018-0391-5

DO - 10.1007/s10288-018-0391-5

M3 - Journal article

VL - 17

SP - 225

EP - 259

JO - 4 O R

JF - 4 O R

SN - 1619-4500

IS - 3

ER -