Non-cyclic train timetabling and comparability graphs

DOI10.1016/j.orl.2010.01.007zbMath1187.90092OpenAlexW2083672643MaRDI QIDQ974988

Valentina Cacchiani, Alberto Caprara, Paolo Toth

Publication date: 8 June 2010

Published in: Operations Research Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.orl.2010.01.007

zbMATH Keywords

stable setcomparability graphcomputational resultstrain timetablingclique inequalitiesILP formulations

Mathematics Subject Classification ID

Deterministic network models in operations research (90B10) Traffic problems in operations research (90B20)

Related Items (14)

Branch-and-bound-based local search heuristics for train timetabling on single-track railway network ⋮ An experimental comparison of periodic timetabling models ⋮ A branch and bound algorithm and iterative reordering strategies for inserting additional trains in real time: a case study in Germany ⋮ Delay resistant line planning with a view towards passenger transfers ⋮ Finding cliques of maximum weight on a generalization of permutation graphs ⋮ A column-generation-based matheuristic for periodic and symmetric train timetabling with integrated passenger routing ⋮ A short-turning policy for the management of demand disruptions in rapid transit systems ⋮ Distance-hereditary comparability graphs ⋮ Exact formulations and algorithm for the train timetabling problem with dynamic demand ⋮ Non-cyclic train timetabling and comparability graphs ⋮ Conflict resolving -- a local search algorithm for solving large scale conflict graphs in freight railway timetabling ⋮ A simulated annealing algorithm for first train transfer problem in urban railway networks ⋮ Minimizing the waiting time for a one-way shuttle service ⋮ Distance-Hereditary Comparability Graphs

Cites Work

• A column generation approach to train timetabling on a corridor
• Non-cyclic train timetabling and comparability graphs
• Geometric algorithms and combinatorial optimization
• Railway Timetabling Using Lagrangian Relaxation
• Sorting Permutations by Reversals Through Branch-and-Price
• Modeling and Solving the Train Timetabling Problem
• A Branch-and-Price Algorithm for the Generalized Assignment Problem

This page was built for publication: Non-cyclic train timetabling and comparability graphs