Balancing a one-way corridor capacity and safety-oriented reliability: A stochastic optimization approach for metro train timetabling

Jiateng Yin, Lixing Yang, Xuesong Zhou, Tao Tang, Ziyou Gao

Research output: Contribution to journalArticle

2 Citations (Scopus)

Abstract

In urban rail transit systems of large cities, the headway and following distance of successive trains have been compressed as much as possible to enhance the corridor capacity to satisfy extremely high passenger demand during peak hours. To prevent train collisions and ensure the safety of trains, a safe following distance of trains must be maintained. However, this requirement is subject to a series of complex factors, such as the uncertain train braking performance, train communication delay, and driver reaction time. In this paper, we propose a unified mathematical framework to analyze the safety-oriented reliability of metro train timetables with different corridor capacities, that is, the train traffic density, and determine the most reliable train timetable for metro lines in an uncertain environment. By employing a space-time network representation in the formulations, the reliability-based train timetabling problem is formulated as a nonlinear stochastic programming model, in which we use 0-1 variables to denote the time-dependent velocity and position of all involved trains. Several reformulation techniques are developed to obtain an equivalent mixed integer programming model with quadratic constraints (MIQCP) that can be solved to optimality by some commercial solvers. To improve the computational efficiency of the MIQCP model, we develop a dual decomposition solution framework that decomposes the primal problem into several sets of subproblems by dualizing the coupling constraints across different samples. An exact dynamic programming combined with search space reduction strategies is also developed to solve the exact optimal solutions of these subproblems. Two sets of numerical experiments, which involve a relatively small-scale case and a real-world instance based on the operation data of the Beijing subway Changping Line are implemented to verify the effectiveness of the proposed approaches.

Original languageEnglish (US)
Pages (from-to)297-320
Number of pages24
JournalNaval Research Logistics
Volume66
Issue number4
DOIs
StatePublished - Jun 1 2019
Externally publishedYes

Fingerprint

Timetabling
Stochastic Optimization
Balancing
Programming Model
Safety
Decompose
Quadratic Constraint
Communication Delay
Stochastic Programming
Reaction Time
Line
Mixed Integer Programming
Reformulation
Nonlinear Programming
Braking performance
Computational Efficiency
Search Space
Dynamic Programming
Stochastic Model
Driver

Keywords

  • dual decomposition
  • dynamic programming
  • reliability-based train timetabling
  • stochastic optimization

ASJC Scopus subject areas

  • Modeling and Simulation
  • Ocean Engineering
  • Management Science and Operations Research

Cite this

Balancing a one-way corridor capacity and safety-oriented reliability : A stochastic optimization approach for metro train timetabling. / Yin, Jiateng; Yang, Lixing; Zhou, Xuesong; Tang, Tao; Gao, Ziyou.

In: Naval Research Logistics, Vol. 66, No. 4, 01.06.2019, p. 297-320.

Research output: Contribution to journalArticle

@article{34d5c9d54ef04944962e838efcae526d,
title = "Balancing a one-way corridor capacity and safety-oriented reliability: A stochastic optimization approach for metro train timetabling",
abstract = "In urban rail transit systems of large cities, the headway and following distance of successive trains have been compressed as much as possible to enhance the corridor capacity to satisfy extremely high passenger demand during peak hours. To prevent train collisions and ensure the safety of trains, a safe following distance of trains must be maintained. However, this requirement is subject to a series of complex factors, such as the uncertain train braking performance, train communication delay, and driver reaction time. In this paper, we propose a unified mathematical framework to analyze the safety-oriented reliability of metro train timetables with different corridor capacities, that is, the train traffic density, and determine the most reliable train timetable for metro lines in an uncertain environment. By employing a space-time network representation in the formulations, the reliability-based train timetabling problem is formulated as a nonlinear stochastic programming model, in which we use 0-1 variables to denote the time-dependent velocity and position of all involved trains. Several reformulation techniques are developed to obtain an equivalent mixed integer programming model with quadratic constraints (MIQCP) that can be solved to optimality by some commercial solvers. To improve the computational efficiency of the MIQCP model, we develop a dual decomposition solution framework that decomposes the primal problem into several sets of subproblems by dualizing the coupling constraints across different samples. An exact dynamic programming combined with search space reduction strategies is also developed to solve the exact optimal solutions of these subproblems. Two sets of numerical experiments, which involve a relatively small-scale case and a real-world instance based on the operation data of the Beijing subway Changping Line are implemented to verify the effectiveness of the proposed approaches.",
keywords = "dual decomposition, dynamic programming, reliability-based train timetabling, stochastic optimization",
author = "Jiateng Yin and Lixing Yang and Xuesong Zhou and Tao Tang and Ziyou Gao",
year = "2019",
month = "6",
day = "1",
doi = "10.1002/nav.21847",
language = "English (US)",
volume = "66",
pages = "297--320",
journal = "Naval Research Logistics",
issn = "0894-069X",
publisher = "John Wiley and Sons Inc.",
number = "4",

}

TY - JOUR

T1 - Balancing a one-way corridor capacity and safety-oriented reliability

T2 - A stochastic optimization approach for metro train timetabling

AU - Yin, Jiateng

AU - Yang, Lixing

AU - Zhou, Xuesong

AU - Tang, Tao

AU - Gao, Ziyou

PY - 2019/6/1

Y1 - 2019/6/1

N2 - In urban rail transit systems of large cities, the headway and following distance of successive trains have been compressed as much as possible to enhance the corridor capacity to satisfy extremely high passenger demand during peak hours. To prevent train collisions and ensure the safety of trains, a safe following distance of trains must be maintained. However, this requirement is subject to a series of complex factors, such as the uncertain train braking performance, train communication delay, and driver reaction time. In this paper, we propose a unified mathematical framework to analyze the safety-oriented reliability of metro train timetables with different corridor capacities, that is, the train traffic density, and determine the most reliable train timetable for metro lines in an uncertain environment. By employing a space-time network representation in the formulations, the reliability-based train timetabling problem is formulated as a nonlinear stochastic programming model, in which we use 0-1 variables to denote the time-dependent velocity and position of all involved trains. Several reformulation techniques are developed to obtain an equivalent mixed integer programming model with quadratic constraints (MIQCP) that can be solved to optimality by some commercial solvers. To improve the computational efficiency of the MIQCP model, we develop a dual decomposition solution framework that decomposes the primal problem into several sets of subproblems by dualizing the coupling constraints across different samples. An exact dynamic programming combined with search space reduction strategies is also developed to solve the exact optimal solutions of these subproblems. Two sets of numerical experiments, which involve a relatively small-scale case and a real-world instance based on the operation data of the Beijing subway Changping Line are implemented to verify the effectiveness of the proposed approaches.

AB - In urban rail transit systems of large cities, the headway and following distance of successive trains have been compressed as much as possible to enhance the corridor capacity to satisfy extremely high passenger demand during peak hours. To prevent train collisions and ensure the safety of trains, a safe following distance of trains must be maintained. However, this requirement is subject to a series of complex factors, such as the uncertain train braking performance, train communication delay, and driver reaction time. In this paper, we propose a unified mathematical framework to analyze the safety-oriented reliability of metro train timetables with different corridor capacities, that is, the train traffic density, and determine the most reliable train timetable for metro lines in an uncertain environment. By employing a space-time network representation in the formulations, the reliability-based train timetabling problem is formulated as a nonlinear stochastic programming model, in which we use 0-1 variables to denote the time-dependent velocity and position of all involved trains. Several reformulation techniques are developed to obtain an equivalent mixed integer programming model with quadratic constraints (MIQCP) that can be solved to optimality by some commercial solvers. To improve the computational efficiency of the MIQCP model, we develop a dual decomposition solution framework that decomposes the primal problem into several sets of subproblems by dualizing the coupling constraints across different samples. An exact dynamic programming combined with search space reduction strategies is also developed to solve the exact optimal solutions of these subproblems. Two sets of numerical experiments, which involve a relatively small-scale case and a real-world instance based on the operation data of the Beijing subway Changping Line are implemented to verify the effectiveness of the proposed approaches.

KW - dual decomposition

KW - dynamic programming

KW - reliability-based train timetabling

KW - stochastic optimization

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

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

U2 - 10.1002/nav.21847

DO - 10.1002/nav.21847

M3 - Article

AN - SCOPUS:85065203281

VL - 66

SP - 297

EP - 320

JO - Naval Research Logistics

JF - Naval Research Logistics

SN - 0894-069X

IS - 4

ER -