scispace - formally typeset
Journal ArticleDOI

Railway track allocation: models and methods

TLDR
This paper surveys work on the train timetabling, train dispatching, train platforming, and train routing problems, group them by railway network type, and discusses track allocation from a strategic, tactical, and operational level.
Abstract
Efficiently coordinating the movement of trains on a railway network is a central part of the planning process for a railway company. This paper reviews models and methods that have been proposed in the literature to assist planners in finding train routes. Since the problem of routing trains on a railway network entails allocating the track capacity of the network (or part thereof) over time in a conflict-free manner, all studies that model railway track allocation in some capacity are considered relevant. We hence survey work on the train timetabling, train dispatching, train platforming, and train routing problems, group them by railway network type, and discuss track allocation from a strategic, tactical, and operational level.

read more

Citations
More filters
Journal ArticleDOI

An overview of recovery models and algorithms for real-time railway rescheduling

TL;DR: In this article, an overview of recovery models and algorithms for real-time railway disturbance and disruption management is presented, which are tested mainly in an experimental setting, thereby showing promising results.
Journal ArticleDOI

Nominal and robust train timetabling problems

TL;DR: An overview of the main works on train timetabling is presented, underlining the differences between models and methods that have been developed to tackle the nominal and the robust versions of the problem.
Journal ArticleDOI

A Railway Timetable Rescheduling Approach for Handling Large-Scale Disruptions

TL;DR: In this paper, an integer linear programming model is formulated for solving the timetable rescheduling problem, which minimizes the number of cancelled and delayed train services while adhering to infrastructure and rolling stock capacity constraints.
Journal ArticleDOI

Collaborative optimization for train scheduling and train stop planning on high-speed railways

TL;DR: Experimental results show that, even for the large-scale Beijing–Shanghai high-speed railway, the CPLEX solver can efficiently produce the approximate optimal collaborative operation strategies within the given gaps in acceptable computational times, demonstrating the effectiveness and efficiency of the proposed approaches.
Journal ArticleDOI

Adjusting a railway timetable in case of partial or complete blockades

TL;DR: In this article, the authors focus on adjusting the timetable of a passenger railway operator in case of major disruptions, such as partial and complete blockade of a railway line, and present integer programming formulations and test their models using instances from Netherlands Railways.
References
More filters
Journal ArticleDOI

A Survey of Optimization Models for Train Routing and Scheduling

TL;DR: A survey of recent optimization models for the most commonly studied rail transportation problems is presented and a classification of models is proposed and their important characteristics are described by focusing on model structure and algorithmic aspects.
Journal ArticleDOI

A branch and bound algorithm for scheduling trains in a railway network

TL;DR: A branch and bound algorithm which includes implication rules enabling to speed up the computation of a train scheduling problem faced by railway infrastructure managers during real-time traffic control is developed.
Journal ArticleDOI

A mathematical for periodic scheduling problems

TL;DR: A mathematical model is proposed for scheduling activities of periodic type and an algorithm for it of implicit enumeration type is designed based on network flow results, and its average complexity is discussed.
Journal ArticleDOI

Modeling and Solving the Train Timetabling Problem

TL;DR: A graph theoretic formulation for the train timetabling problem using a directed multigraph in which nodes correspond to departures/arrivals at a certain station at a given time instant is proposed, used to derive an integer linear programming model that is relaxed in a Lagrangian way.
Journal ArticleDOI

Job-shop scheduling with blocking and no-wait constraints

TL;DR: It is shown that several key properties, used to design heuristic procedures, do not hold in the blocking and no-wait cases, while some of the most effective ideas used to develop branch and bound algorithms can be easily extended.
Related Papers (5)