Train scheduling for minimizing passenger waiting time with time-dependent demand and skip-stop patterns: Nonlinear integer programming models with linear constraints

Huimin Niu, Xuesong Zhou, Ruhu Gao

Research output: Contribution to journalArticle

114 Citations (Scopus)

Abstract

This paper focuses on how to minimize the total passenger waiting time at stations by computing and adjusting train timetables for a rail corridor with given time-varying origin-to-destination passenger demand matrices. Given predetermined train skip-stop patterns, a unified quadratic integer programming model with linear constraints is developed to jointly synchronize effective passenger loading time windows and train arrival and departure times at each station. A set of quadratic and quasi-quadratic objective functions are proposed to precisely formulate the total waiting time under both minute-dependent demand and hour-dependent demand volumes from different origin-destination pairs. We construct mathematically rigorous and algorithmically tractable nonlinear mixed integer programming models for both real-time scheduling and medium-term planning applications. The proposed models are implemented using general purpose high-level optimization solvers, and the model effectiveness is further examined through numerical experiments of real-world rail train timetabling test cases.

Original languageEnglish (US)
Pages (from-to)117-135
Number of pages19
JournalTransportation Research Part B: Methodological
Volume76
DOIs
StatePublished - Jun 1 2015

Fingerprint

Integer programming
scheduling
programming
Scheduling
demand
Rails
Planning
time
Waiting time
Train
planning
Experiments
experiment
Rail
Destination

Keywords

  • Nonlinear mixed integer programming
  • Passenger waiting time
  • Skip-stop pattern
  • Time-varying demand
  • Train timetable

ASJC Scopus subject areas

  • Transportation
  • Management Science and Operations Research

Cite this

@article{392fd7308ffc4025bd0dd962fa23bd29,
title = "Train scheduling for minimizing passenger waiting time with time-dependent demand and skip-stop patterns: Nonlinear integer programming models with linear constraints",
abstract = "This paper focuses on how to minimize the total passenger waiting time at stations by computing and adjusting train timetables for a rail corridor with given time-varying origin-to-destination passenger demand matrices. Given predetermined train skip-stop patterns, a unified quadratic integer programming model with linear constraints is developed to jointly synchronize effective passenger loading time windows and train arrival and departure times at each station. A set of quadratic and quasi-quadratic objective functions are proposed to precisely formulate the total waiting time under both minute-dependent demand and hour-dependent demand volumes from different origin-destination pairs. We construct mathematically rigorous and algorithmically tractable nonlinear mixed integer programming models for both real-time scheduling and medium-term planning applications. The proposed models are implemented using general purpose high-level optimization solvers, and the model effectiveness is further examined through numerical experiments of real-world rail train timetabling test cases.",
keywords = "Nonlinear mixed integer programming, Passenger waiting time, Skip-stop pattern, Time-varying demand, Train timetable",
author = "Huimin Niu and Xuesong Zhou and Ruhu Gao",
year = "2015",
month = "6",
day = "1",
doi = "10.1016/j.trb.2015.03.004",
language = "English (US)",
volume = "76",
pages = "117--135",
journal = "Transportation Research, Series B: Methodological",
issn = "0191-2615",
publisher = "Elsevier Limited",

}

TY - JOUR

T1 - Train scheduling for minimizing passenger waiting time with time-dependent demand and skip-stop patterns

T2 - Nonlinear integer programming models with linear constraints

AU - Niu, Huimin

AU - Zhou, Xuesong

AU - Gao, Ruhu

PY - 2015/6/1

Y1 - 2015/6/1

N2 - This paper focuses on how to minimize the total passenger waiting time at stations by computing and adjusting train timetables for a rail corridor with given time-varying origin-to-destination passenger demand matrices. Given predetermined train skip-stop patterns, a unified quadratic integer programming model with linear constraints is developed to jointly synchronize effective passenger loading time windows and train arrival and departure times at each station. A set of quadratic and quasi-quadratic objective functions are proposed to precisely formulate the total waiting time under both minute-dependent demand and hour-dependent demand volumes from different origin-destination pairs. We construct mathematically rigorous and algorithmically tractable nonlinear mixed integer programming models for both real-time scheduling and medium-term planning applications. The proposed models are implemented using general purpose high-level optimization solvers, and the model effectiveness is further examined through numerical experiments of real-world rail train timetabling test cases.

AB - This paper focuses on how to minimize the total passenger waiting time at stations by computing and adjusting train timetables for a rail corridor with given time-varying origin-to-destination passenger demand matrices. Given predetermined train skip-stop patterns, a unified quadratic integer programming model with linear constraints is developed to jointly synchronize effective passenger loading time windows and train arrival and departure times at each station. A set of quadratic and quasi-quadratic objective functions are proposed to precisely formulate the total waiting time under both minute-dependent demand and hour-dependent demand volumes from different origin-destination pairs. We construct mathematically rigorous and algorithmically tractable nonlinear mixed integer programming models for both real-time scheduling and medium-term planning applications. The proposed models are implemented using general purpose high-level optimization solvers, and the model effectiveness is further examined through numerical experiments of real-world rail train timetabling test cases.

KW - Nonlinear mixed integer programming

KW - Passenger waiting time

KW - Skip-stop pattern

KW - Time-varying demand

KW - Train timetable

UR - http://www.scopus.com/inward/record.url?scp=84961292059&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84961292059&partnerID=8YFLogxK

U2 - 10.1016/j.trb.2015.03.004

DO - 10.1016/j.trb.2015.03.004

M3 - Article

AN - SCOPUS:84961292059

VL - 76

SP - 117

EP - 135

JO - Transportation Research, Series B: Methodological

JF - Transportation Research, Series B: Methodological

SN - 0191-2615

ER -