Generation of classes of robust periodic railway timetables

Authors:
Michiel A. Odijk;H. Edwin Romeijn;Hans van Maaren
Affiliations:
ORTEC Consultants B.V., AL Gouda, The Netherlands;Department of Industrial and Systems Engineering, University of Florida, Gainesville, FL;Faculty of Information Technology and Systems, Delft University of Technology, Delft, The Netherlands
Venue:
Computers and Operations Research
Year:
2006

Citing 6
Cited 2

Integer and combinatorial optimization

Integer and combinatorial optimization
A mathematical for periodic scheduling problems

SIAM Journal on Discrete Mathematics
Optimization by Vector Space Methods

Optimization by Vector Space Methods
Simulation and the Monte Carlo Method

Simulation and the Monte Carlo Method
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
Decision Support Systems Support the Search for Win-Win Solutions in Railway Network Design

Interfaces

The periodicity and robustness in a single-track train scheduling problem

Applied Soft Computing
Solving a periodic single-track train timetabling problem by an efficient hybrid algorithm

Engineering Applications of Artificial Intelligence

Quantified Score

Hi-index	0.01

Visualization

Abstract

In this paper we discuss the problem of randomly sampling classes of fixed-interval railway timetables from a so-called timetable structure. Using a standard model for the timetable structure, we introduce a natural partitioning of the set of feasible timetables into classes. We then define a new probability distribution where the probability of each class depends on the robustness of the timetables in that class. Due to the difficulty of sampling directly from this distribution, we propose a heuristic sampling method and illustrate using practical data that our method indeed favors classes containing robust timetables over others.