25 research outputs found
Evaluating the Applicability of Advanced Techniques for Practical Real-time Train Scheduling
AbstractThis paper reports on the practical applicability of published techniques for real-time train scheduling. The final goal is the development of an advanced decision support system for supporting dispatchers’ work and for guiding them toward near-optimal real-time re-timing, re-ordering and re-routing decisions. The paper focuses on the optimization system AGLIBRARY that manages trains at the microscopic level of block sections and block signals and at a precision of seconds. The system outcome is a detailed conflict-free train schedule, being able to avoid deadlocks and to minimize train delays. Experiments on a British railway nearby London demonstrate that AGLIBRARY can quickly compute near-optimal solutions
Exploiting quantum parallelism of entanglement for a complete experimental quantum characterization of a single qubit device
We present the first full experimental quantum tomographic characterization
of a single-qubit device achieved with a single entangled input state. The
entangled input state plays the role of all possible input states in quantum
parallel on the tested device. The method can be trivially extended to any
n-qubits device by just replicating the whole experimental setup n times.Comment: 4 pages in revtex4 with 4 eps figure
Susceptibility of optimal train schedules to stochastic disturbances of process times
This work focuses on the stochastic evaluation of train schedules computed by a microscopic scheduler of railway operations based on deterministic information. The research question is to assess the degree of sensitivity of various rescheduling algorithms to variations in process times (running and dwell times). In fact, the objective of railway traffic management is to reduce delay propagation and to increase disturbance robustness of train schedules at a network scale. We present a quantitative study of traffic disturbances and their effects on the schedules computed by simple and advanced rescheduling algorithms. Computational results are based on a complex and densely occupied Dutch railway area; train delays are computed based on accepted statistical distributions, and dwell and running times of trains are subject to additional stochastic variations. From the results obtained on a real case study, an advanced branch and bound algorithm, on average, outperforms a First In First Out scheduling rule both in deterministic and stochastic traffic scenarios. However, the characteristic of the stochastic processes and the way a stochastic instance is handled turn out to have a serious impact on the scheduler performance
Improving real-time train dispatching performance: optimization models and algorithms for re-timing, re-ordering and local re-routing
An Advanced Real-Time Train Dispatching System for Minimizing the Propagation of Delays in a Dispatching Area Under Severe Disturbances
DSS, Delay management, Short-term train scheduling, Temporal decomposition,
Rolling Horizon Approach for Aircraft Scheduling in the Terminal Control Area of Busy Airports
On the tactical and operational train routing selection problem
In the real-time railway traffic management problem, the number of alternative routings available to each train strongly affects the size of the problem and the time required to optimally solve it. The train routing selection problem identifies a suitable subset of alternative routings to be used for each train in the real-time railway traffic management. This paper analyzes the impact of solving the train routing selection problem at different levels. The problem can be solved at tactical level right after the timetabling process, using historical traffic data and with abundant computation time. In this case the problem constitutes an integration step between the timetabling and the real-time traffic management. Alternatively, the problem can be solved at operational level right before the real-time railway traffic management problem solution, using up to date traffic perturbation and a real-time time limit of computation. Experiments are performed on two French test cases, the line around Rouen and the Lille station area, for several disturbed and disrupted scenarios. The results show that the best approach depends on the type of traffic disturbance tackled