Non-cyclic train timetabling and comparability graphs

Authors:
Valentina Cacchiani;Alberto Caprara;Paolo Toth
Affiliations:
DEIS, Universití di Bologna, Viale Risorgimento 2, I-40136 Bologna, Italy;DEIS, Universití di Bologna, Viale Risorgimento 2, I-40136 Bologna, Italy;DEIS, Universití di Bologna, Viale Risorgimento 2, I-40136 Bologna, Italy
Venue:
Operations Research Letters
Year:
2010

Citing 3
Cited 3

Railway Timetabling Using Lagrangian Relaxation

Transportation Science
Sorting Permutations by Reversals Through Branch-and-Price

INFORMS Journal on Computing
Modeling and Solving the Train Timetabling Problem

Operations Research

A network-based approach to the multi-activity combined timetabling and crew scheduling problem: Workforce scheduling for public health policy implementation

Computers and Industrial Engineering
Mixed integer programming for minimizing the period of a cyclic railway timetable for a single track with two train types

Computers and Industrial Engineering
Exact formulations and algorithm for the train timetabling problem with dynamic demand

Computers and Operations Research

Quantified Score

Hi-index	0.00

Visualization

Abstract

We consider the customary formulation of non-cyclic train timetabling, calling for a maximum-profit collection of compatible paths in a suitable graph. The associated ILP models look for a maximum-weight clique in a (n exponentially-large) compatibility graph. By taking a close look at the structure of this graph, we analyze the existing ILP models, propose some new stronger ones, all having the essential property that both the separation and the column generation can be carried out efficiently, and report the computational results on highly-congested instances.