3,448 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.
ATMOS 2005 Abstracts Collection -- Selected Papers from the 5th Workshop on Algorithmic Methods and Models for Optimization of Railways
This issue contains six papers that were presented in preliminary
form at the 5th Workshop on Algorithmic Methods and Models
for Optimization of Railways (ATMOS 2005), held at Palma de Mallorca,
Spain, October 7, 2005 in conjunction with ALGO 2005. These
papers are representative of several areas of research within the scope of
ATMOS: rolling stock circulation and engine assignment, station location,
line planning, railway traffic scheduling and dispatching, transfer
optimization within network design, and fast traffic information systems
Can one detect a non-smooth null infinity?
It is shown that the precession of a gyroscope can be used to elucidate the
nature of the smoothness of the null infinity of an asymptotically flat
spacetime (describing an isolated body). A model for which the effects of
precession in the non-smooth null infinity case are of order is
proposed. By contrast, in the smooth version the effects are of order .
This difference should provide an effective criterion to decide on the nature
of the smoothness of null infinity.Comment: 6 pages, to appear in Class. Quantum Gra
On the existence and convergence of polyhomogeneous expansions of zero-rest-mass fields
The convergence of polyhomogeneous expansions of zero-rest-mass fields in
asymptotically flat spacetimes is discussed. An existence proof for the
asymptotic characteristic initial value problem for a zero-rest-mass field with
polyhomogeneous initial data is given. It is shown how this non-regular problem
can be properly recast as a set of regular initial value problems for some
auxiliary fields. The standard techniques of symmetric hyperbolic systems can
be applied to these new auxiliary problems, thus yielding a positive answer to
the question of existence in the original problem.Comment: 10 pages, 1 eps figur
Re-scheduling in railways: the rolling stock balancing problem
This paper addresses the Rolling Stock Balancing Problem (RSBP). This problem arises at a passenger railway operator when the rolling stock has to be re-scheduled due to changing circumstances. These problems arise both in the planning process and during operations. The RSBP has as input a timetable and a rolling stock schedule where the allocation of the rolling stock among the stations does not fit to the allocation before and after the planning period. The problem is then to correct these off-balances, leading to a modified schedule that can be implemented in practice.For practical usage of solution approaches for the RSBP, it is important to solve the problem quickly. Therefore, the focus is on heuristic approaches. In this paper, we describe two heuristics and compare them with each other on some (variants of) real-life instances of NS, the main Dutch passenger railway operator. Finally, to get some insight in the quality of the proposed heuristics, we also compare their outcomes with optimal solutions obtained by solving existing rolling stock circulation models.heuristics;railway planning;integer linear programming;rolling stock re-scheduling
Combinatorial optimization model for railway engine assignment problem
This paper presents an experimental study for the Hungarian State Railway Company (M\'AV). The engine assignment problem was solved at M\'AV by their experts without using any explicit operations research tool. Furthermore, the operations research model was not known at the company. The goal of our project was to introduce and solve an operations research model for the engine assignment problem on real data sets. For the engine assignment problem we are using a combinatorial optimization model. At this stage of research the single type train that is pulled by a single type engine is modeled and solved for real data. There are two regions in Hungary where the methodology described in this paper can be used and M\'AV started to use it regularly. There is a need to generalize the model for multiple type trains and multiple type engines
Rossijsko-Gollandskaya programma 'O natsionalnostjah'. [Russian-Dutch programme 'On nationalities']
Stochastic Improvement of Cyclic Railway Timetables
Real-time railway operations are subject to stochastic disturbances. However, a railway timetable is a deterministic plan. Thus a timetable should be designed in such a way that it can cope with the stochastic disturbances as well as possible. For that purpose, a timetable usually contains time supplements in several process times and buffer times between pairs of consecutive trains. This paper describes a Stochastic Optimization Model that can be used to allocate the time supplements and the buffer times in a given timetable in such a way that the timetable becomes maximally robust against stochastic disturbances. The Stochastic Optimization Model was tested on several instances of NS Reizigers, the main operator of passenger trains in the Netherlands. Moreover, a timetable that was computed by the model was operated in practice in a timetable experiment on the so-called “Zaanlijnâ€. The results show that the average delays of trains can often be reduced significantly by applying relatively small modifications to a given timetable.Railway Timetabling;Stochastic Optimization;Robustness
- …