A Train Dispatching Model Under a Stochastic Environment

Stable Train Routing Constraints and Reformulation

Lingyun Meng, Xiaojie Luan, Xuesong Zhou

Research output: Contribution to journalArticle

8 Citations (Scopus)

Abstract

After major capacity breakdown(s) on a railway network, train dispatchers need to generate appropriate dispatching plans to recover the impacted train schedule from perturbations and minimize the expected total train delay time under stochastic scenarios. In this paper, we propose a cumulative flow variables-based integer programming model for dispatching trains under a stochastic environment on a general railway network. Stable Train Routing (STR) constraints are introduced to ensure that trains traverse on the same route across different capacity breakdown scenarios, which are further reformulated to equivalent linear inequality constraints. Track occupancy and safety headways are modelled as side constraints which are dualized through a proposed Lagrangian relaxation solution framework. The original complex train dispatching problem is then decomposed to a set of single-train and single-scenario optimization subproblems. For each subproblem, a standard label correcting algorithm is embedded for finding the time dependent least cost path on a space-time network. The resulting dual solutions can be transformed to feasible solutions through priority rules. Numerical experiments are conducted to demonstrate the efficiency and effectiveness of the proposed solution approach.

Original languageEnglish (US)
JournalNetworks and Spatial Economics
DOIs
StateAccepted/In press - Aug 2 2015

Fingerprint

Integer programming
Labels
Time delay
Costs
Experiments

Keywords

  • Lagrangian relaxation
  • Robust solution
  • Stable Train Routing (STR)
  • Train dispatching

ASJC Scopus subject areas

  • Computer Networks and Communications
  • Artificial Intelligence
  • Software

Cite this

@article{2b16b2e76c474995ab780cd210f4f347,
title = "A Train Dispatching Model Under a Stochastic Environment: Stable Train Routing Constraints and Reformulation",
abstract = "After major capacity breakdown(s) on a railway network, train dispatchers need to generate appropriate dispatching plans to recover the impacted train schedule from perturbations and minimize the expected total train delay time under stochastic scenarios. In this paper, we propose a cumulative flow variables-based integer programming model for dispatching trains under a stochastic environment on a general railway network. Stable Train Routing (STR) constraints are introduced to ensure that trains traverse on the same route across different capacity breakdown scenarios, which are further reformulated to equivalent linear inequality constraints. Track occupancy and safety headways are modelled as side constraints which are dualized through a proposed Lagrangian relaxation solution framework. The original complex train dispatching problem is then decomposed to a set of single-train and single-scenario optimization subproblems. For each subproblem, a standard label correcting algorithm is embedded for finding the time dependent least cost path on a space-time network. The resulting dual solutions can be transformed to feasible solutions through priority rules. Numerical experiments are conducted to demonstrate the efficiency and effectiveness of the proposed solution approach.",
keywords = "Lagrangian relaxation, Robust solution, Stable Train Routing (STR), Train dispatching",
author = "Lingyun Meng and Xiaojie Luan and Xuesong Zhou",
year = "2015",
month = "8",
day = "2",
doi = "10.1007/s11067-015-9299-1",
language = "English (US)",
journal = "Networks and Spatial Economics",
issn = "1566-113X",
publisher = "Kluwer Academic Publishers",

}

TY - JOUR

T1 - A Train Dispatching Model Under a Stochastic Environment

T2 - Stable Train Routing Constraints and Reformulation

AU - Meng, Lingyun

AU - Luan, Xiaojie

AU - Zhou, Xuesong

PY - 2015/8/2

Y1 - 2015/8/2

N2 - After major capacity breakdown(s) on a railway network, train dispatchers need to generate appropriate dispatching plans to recover the impacted train schedule from perturbations and minimize the expected total train delay time under stochastic scenarios. In this paper, we propose a cumulative flow variables-based integer programming model for dispatching trains under a stochastic environment on a general railway network. Stable Train Routing (STR) constraints are introduced to ensure that trains traverse on the same route across different capacity breakdown scenarios, which are further reformulated to equivalent linear inequality constraints. Track occupancy and safety headways are modelled as side constraints which are dualized through a proposed Lagrangian relaxation solution framework. The original complex train dispatching problem is then decomposed to a set of single-train and single-scenario optimization subproblems. For each subproblem, a standard label correcting algorithm is embedded for finding the time dependent least cost path on a space-time network. The resulting dual solutions can be transformed to feasible solutions through priority rules. Numerical experiments are conducted to demonstrate the efficiency and effectiveness of the proposed solution approach.

AB - After major capacity breakdown(s) on a railway network, train dispatchers need to generate appropriate dispatching plans to recover the impacted train schedule from perturbations and minimize the expected total train delay time under stochastic scenarios. In this paper, we propose a cumulative flow variables-based integer programming model for dispatching trains under a stochastic environment on a general railway network. Stable Train Routing (STR) constraints are introduced to ensure that trains traverse on the same route across different capacity breakdown scenarios, which are further reformulated to equivalent linear inequality constraints. Track occupancy and safety headways are modelled as side constraints which are dualized through a proposed Lagrangian relaxation solution framework. The original complex train dispatching problem is then decomposed to a set of single-train and single-scenario optimization subproblems. For each subproblem, a standard label correcting algorithm is embedded for finding the time dependent least cost path on a space-time network. The resulting dual solutions can be transformed to feasible solutions through priority rules. Numerical experiments are conducted to demonstrate the efficiency and effectiveness of the proposed solution approach.

KW - Lagrangian relaxation

KW - Robust solution

KW - Stable Train Routing (STR)

KW - Train dispatching

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

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

U2 - 10.1007/s11067-015-9299-1

DO - 10.1007/s11067-015-9299-1

M3 - Article

JO - Networks and Spatial Economics

JF - Networks and Spatial Economics

SN - 1566-113X

ER -