Demand-Driven Train Schedule Synchronization for High-Speed Rail Lines

Huimin Niu, Xiaopeng Tian, Xuesong Zhou

Research output: Contribution to journalArticle

25 Citations (Scopus)

Abstract

This paper addresses a new class of train scheduling problems with two interconnected high-speed rail lines under given and precise time-dependent origin-destination demand input. The proposed systematic schedule synchronization approach focuses on satisfying the requirements of transfer passengers from one rail line to another rail line. Aiming to minimize passenger waiting times at stations and crowding disutility in trains, a nonlinear optimization model for a single-line case is formulated to demonstrate the modeling framework of train scheduling problems. The model is then extended to a two-line case by explicitly taking into account the number of boarding and alighting passengers at the connection station. Using a state-space representation, a novel dynamic programming algorithm is designed to solve the single-line problem as a deterministic finite-state problem with sequential decisions. An integer coding-based genetic algorithm procedure is developed to solve the proposed model for general cases with two lines. A simplified real-world example illustrates that the designed schedule is beneficial to the through passengers and transfer passengers simultaneously.

Original languageEnglish (US)
Article number7091013
Pages (from-to)2642-2652
Number of pages11
JournalIEEE Transactions on Intelligent Transportation Systems
Volume16
Issue number5
DOIs
StatePublished - Oct 1 2015

Fingerprint

Rails
Synchronization
Scheduling
Dynamic programming
Genetic algorithms

Keywords

  • demand driven
  • dynamic programming
  • genetic algorithm
  • High-speed rail
  • train schedule synchronization

ASJC Scopus subject areas

  • Automotive Engineering
  • Computer Science Applications
  • Mechanical Engineering

Cite this

Demand-Driven Train Schedule Synchronization for High-Speed Rail Lines. / Niu, Huimin; Tian, Xiaopeng; Zhou, Xuesong.

In: IEEE Transactions on Intelligent Transportation Systems, Vol. 16, No. 5, 7091013, 01.10.2015, p. 2642-2652.

Research output: Contribution to journalArticle

@article{d1b5e5c9f3414bf3a56973ffc0d9c5a0,
title = "Demand-Driven Train Schedule Synchronization for High-Speed Rail Lines",
abstract = "This paper addresses a new class of train scheduling problems with two interconnected high-speed rail lines under given and precise time-dependent origin-destination demand input. The proposed systematic schedule synchronization approach focuses on satisfying the requirements of transfer passengers from one rail line to another rail line. Aiming to minimize passenger waiting times at stations and crowding disutility in trains, a nonlinear optimization model for a single-line case is formulated to demonstrate the modeling framework of train scheduling problems. The model is then extended to a two-line case by explicitly taking into account the number of boarding and alighting passengers at the connection station. Using a state-space representation, a novel dynamic programming algorithm is designed to solve the single-line problem as a deterministic finite-state problem with sequential decisions. An integer coding-based genetic algorithm procedure is developed to solve the proposed model for general cases with two lines. A simplified real-world example illustrates that the designed schedule is beneficial to the through passengers and transfer passengers simultaneously.",
keywords = "demand driven, dynamic programming, genetic algorithm, High-speed rail, train schedule synchronization",
author = "Huimin Niu and Xiaopeng Tian and Xuesong Zhou",
year = "2015",
month = "10",
day = "1",
doi = "10.1109/TITS.2015.2415513",
language = "English (US)",
volume = "16",
pages = "2642--2652",
journal = "IEEE Transactions on Intelligent Transportation Systems",
issn = "1524-9050",
publisher = "Institute of Electrical and Electronics Engineers Inc.",
number = "5",

}

TY - JOUR

T1 - Demand-Driven Train Schedule Synchronization for High-Speed Rail Lines

AU - Niu, Huimin

AU - Tian, Xiaopeng

AU - Zhou, Xuesong

PY - 2015/10/1

Y1 - 2015/10/1

N2 - This paper addresses a new class of train scheduling problems with two interconnected high-speed rail lines under given and precise time-dependent origin-destination demand input. The proposed systematic schedule synchronization approach focuses on satisfying the requirements of transfer passengers from one rail line to another rail line. Aiming to minimize passenger waiting times at stations and crowding disutility in trains, a nonlinear optimization model for a single-line case is formulated to demonstrate the modeling framework of train scheduling problems. The model is then extended to a two-line case by explicitly taking into account the number of boarding and alighting passengers at the connection station. Using a state-space representation, a novel dynamic programming algorithm is designed to solve the single-line problem as a deterministic finite-state problem with sequential decisions. An integer coding-based genetic algorithm procedure is developed to solve the proposed model for general cases with two lines. A simplified real-world example illustrates that the designed schedule is beneficial to the through passengers and transfer passengers simultaneously.

AB - This paper addresses a new class of train scheduling problems with two interconnected high-speed rail lines under given and precise time-dependent origin-destination demand input. The proposed systematic schedule synchronization approach focuses on satisfying the requirements of transfer passengers from one rail line to another rail line. Aiming to minimize passenger waiting times at stations and crowding disutility in trains, a nonlinear optimization model for a single-line case is formulated to demonstrate the modeling framework of train scheduling problems. The model is then extended to a two-line case by explicitly taking into account the number of boarding and alighting passengers at the connection station. Using a state-space representation, a novel dynamic programming algorithm is designed to solve the single-line problem as a deterministic finite-state problem with sequential decisions. An integer coding-based genetic algorithm procedure is developed to solve the proposed model for general cases with two lines. A simplified real-world example illustrates that the designed schedule is beneficial to the through passengers and transfer passengers simultaneously.

KW - demand driven

KW - dynamic programming

KW - genetic algorithm

KW - High-speed rail

KW - train schedule synchronization

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

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

U2 - 10.1109/TITS.2015.2415513

DO - 10.1109/TITS.2015.2415513

M3 - Article

AN - SCOPUS:84959509980

VL - 16

SP - 2642

EP - 2652

JO - IEEE Transactions on Intelligent Transportation Systems

JF - IEEE Transactions on Intelligent Transportation Systems

SN - 1524-9050

IS - 5

M1 - 7091013

ER -