Non-cyclic train timetabling and comparability graphs

DOI10.1016/J.ORL.2010.01.007MaRDI QIDQ974988zbMATH OpenOpenAlexFDO

Authors 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 settrain timetablingcomputational resultscomparability graphclique inequalitiesILP formulations

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 1683926
• Modeling and Solving the Train Timetabling Problem
• The train frequency compatibility problem
• A column generation approach to train timetabling on a corridor
• A Model, Algorithms and Strategy for Train Pathing

Cites work

• A Branch-and-Price Algorithm for the Generalized Assignment Problem
• A column generation approach to train timetabling on a corridor
• Geometric algorithms and combinatorial optimization
• Modeling and Solving the Train Timetabling Problem
• Non-cyclic train timetabling and comparability graphs
• Railway timetabling using Lagrangian relaxation
• Sorting permutations by reversals through branch-and-price

Cited in

(17)

• The train frequency compatibility problem
• The non-stop disjoint trajectories problem
• Distance-hereditary comparability graphs
• Conflict resolving -- a local search algorithm for solving large scale conflict graphs in freight railway timetabling
• scientific article; zbMATH DE number 1683926 (Why is no real title available?)
• 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
• A simulated annealing algorithm for first train transfer problem in urban railway networks
• Branch-and-bound-based local search heuristics for train timetabling on single-track railway network
• Non-cyclic train timetabling and comparability graphs
• Delay resistant line planning with a view towards passenger transfers
• Finding cliques of maximum weight on a generalization of permutation graphs
• Minimizing the waiting time for a one-way shuttle service
• A short-turning policy for the management of demand disruptions in rapid transit systems
• Exact formulations and algorithm for the train timetabling problem with dynamic demand
• Distance-hereditary comparability graphs
• A column-generation-based matheuristic for periodic and symmetric train timetabling with integrated passenger routing

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q974988)