157 research outputs found
Railway timetabling from an operations research
In this paper we describe Operations Research (OR) models andtechniques that can be used for determining (cyclic) railwaytimetables. We discuss the two aspects of railway timetabling: ()the determination of arrival and departure times of the trains atthe stations and other relevant locations such as junctions andbridges, and () the assignment of each train to an appropriateplatform and corresponding inbound and outbound routes in everystation. Moreover, we discuss robustness aspects of bothsubproblems.
Railway timetabling from an operations research
In this paper we describe Operations Research (OR) models and
techniques that can be used for determining (cyclic) railway
timetables. We discuss the two aspects of railway timetabling: ()
the determination of arrival and departure times of the trains at
the stations and other relevant locations such as junctions and
bridges, and () the assignment of each train to an appropriate
platform and corresponding inbound and outbound routes in every
station. Moreover, we discuss robustness aspects of both
subproblems
Robust Train Routing and Online Re-scheduling
Train Routing is a problem that arises in the early phase of
the passenger railway planning process, usually several months
before operating the trains. The main goal is to assign each
train a stopping platform and the corresponding arrival/departure
paths through a railway station. It is also called Train Platforming when
referring to the platform assignment task. Railway stations often represent
bottlenecks and train delays can easily disrupt the routing schedule.
Thereby railway stations are responsible for a large part of the delay
propagation in the whole network. In this research we present
different models to compute robust routing schedules and we study
their power in an online context together with different re-scheduling
strategies. We also design a simulation framework and use it to evaluate
and compare the effectiveness of the proposed robust models and re-scheduling
algorithms using real-world data from Rete Ferroviaria Italiana, the main
Italian Railway Infrastructure Manager
A Survey of Scheduling in Time-Sensitive Networking (TSN)
TSN is an enhancement of Ethernet which provides various mechanisms for
real-time communication. Time-triggered (TT) traffic represents periodic data
streams with strict real-time requirements. Amongst others, TSN supports
scheduled transmission of TT streams, i.e., the transmission of their packets
by edge nodes is coordinated in such a way that none or very little queuing
delay occurs in intermediate nodes. TSN supports multiple priority queues per
egress port. The TAS uses so-called gates to explicitly allow and block these
queues for transmission on a short periodic timescale. The TAS is utilized to
protect scheduled traffic from other traffic to minimize its queuing delay. In
this work, we consider scheduling in TSN which comprises the computation of
periodic transmission instants at edge nodes and the periodic opening and
closing of queue gates.
In this paper, we first give a brief overview of TSN features and standards.
We state the TSN scheduling problem and explain common extensions which also
include optimization problems. We review scheduling and optimization methods
that have been used in this context. Then, the contribution of currently
available research work is surveyed. We extract and compile optimization
objectives, solved problem instances, and evaluation results. Research domains
are identified, and specific contributions are analyzed. Finally, we discuss
potential research directions and open problems.Comment: 34 pages, 19 figures, 9 tables 110 reference
Design of a Railway Scheduling Model for Dense Services
We address the problem of generating detailed conflict-free railway schedules for given sets of train lines and frequencies. To solve this problem for large railway networks, we propose a network decomposition into condensation and compensation zones. Condensation zones contain main station areas, where capacity is limited and trains are required to travel with maximum speed. They are connected by compensation zones, where traffic is less dense and time reserves can be introduced for increasing stability. In this paper, we focus on the scheduling problem in condensation zones. To gain structure in the schedule we enforce a time discretisation which reduces the problem size considerably and also the cognitive load of the dispatchers. The problem is formulated as an independent set problem in a conflict graph, which is then solved using a fixed-point iteration heuristic. Results show that even large-scale problems with dense timetables and large topologies can be solved quickl
A Set Packing Inspired Method for Real-Time Junction Train Routing
Efficiently coordinating the often large number of interdependent, timetabled train movements on a railway junction, while satisfying a number of operational requirements, is one of the most important problems faced by a railway company. The most critical variant of the problem arises on a daily basis at major railway junctions where disruptions to rail traffi c make the planned schedule/routing infeasible and rolling stock planners are forced to reschedule/re-route trains in order to recover feasibility. The dynamic nature of the problem means that good solutions must be obtained quickly. In this paper we describe a set packing inspired formulation of this problem and develop a branch-and-price based solution approach. A real life test instance arising in Germany and supplied by the major German railway company, Deutsche Bahn, indicates the efficiency of the proposed approach by confirming that practical problems can be solved to within a few percent of optimality in reasonable time
Real-Time Track Reallocation for Emergency Incidents at Large Railway Stations
After track capacity breakdowns at a railway station, train dispatchers need to generate appropriate track reallocation plans to recover the impacted train schedule and minimize the expected total train delay time under stochastic scenarios. This paper focuses on the real-time track reallocation problem when tracks break down at large railway stations. To represent these cases, virtual trains are introduced and activated to occupy the accident tracks. A mathematical programming model is developed, which aims at minimizing the total occupation time of station bottleneck sections to avoid train delays. In addition, a hybrid algorithm between the genetic algorithm and the simulated annealing algorithm is designed. The case study from the Baoji railway station in China verifies the efficiency of the proposed model and the algorithm. Numerical results indicate that, during a daily and shift transport plan from 8:00 to 8:30, if five tracks break down simultaneously, this will disturb train schedules (result in train arrival and departure delays)
- …