On the Approximability of Train Routing and the Min-Max Disjoint Paths Problem
Preprint
Abstract
In train routing, the headway is the minimum distance that must be maintained between successive trains for safety and robustness. We introduce a model for train routing that requires a fixed headway to be maintained between trains, and study the problem of minimizing the makespan, i.e., the arrival time of the last train, in a single-source single-sink network. For this problem, we first show that there exists an optimal solution where trains move in convoys, that is, the optimal paths for any two trains are either the same or are arc-disjoint. Via this insight, we are able to reduce the approximability of our train routing problem to that of the min-max disjoint paths problem, which asks for a collection of disjoint paths where the maximum length of any path in the collection is as small as possible. While min-max disjoint paths inherits a strong inapproximability result on directed acyclic graphs from the multi-level bottleneck assignment problem, we show that a natural greedy composition approach yields a logarithmic approximation in the number of disjoint paths for series-parallel graphs. We also present an alternative analysis of this approach that yields a guarantee depending on how often the decomposition tree of the series-parallel graph alternates between series and parallel compositions on any root-leaf path.Keywords
All Related Versions
This publication has 21 references indexed in Scilit:
- Formulation of train routing selection problem for different real-time traffic management objectivesJournal of Rail Transport Planning & Management, 2024
- Multi-level bottleneck assignment problems: Complexity and sparsity-exploiting formulationsComputers & Operations Research, 2023
- Models for railway timetable optimization: Applicability and applications in practiceJournal of Rail Transport Planning & Management, 2017
- Cancel-and-tighten algorithm for quickest flow problemsNetworks, 2016
- Scheduling extra freight trains on railway networksTransportation Research Part B: Methodological, 2010
- Railway track allocation: models and methodsOR Spectrum, 2009
- An Introduction to Network Flows over Time2008
- Efficient Algorithms for k-Disjoint Paths Problems on DAGs2007
- Parallel algorithms for series parallel graphs1996
- The complexity of finding two disjoint paths with min-max objective functionDiscrete Applied Mathematics, 1990