Refine
Year of publication
- 2010 (3) (remove)
Document Type
- ZIB-Report (2)
- In Proceedings (1)
Language
- English (3) (remove)
Is part of the Bibliography
- no (3)
Keywords
- Ganzzahlige Programmierung (2)
- Bundle Method (1)
- Kombinatorische Optimierung (1)
- Linienplanung (1)
- Optimization (1)
- Proximale Bündelmethode (1)
- Railway Track Allocation (1)
- Rapid Branching (1)
- Rapid-Branching-Heuristik (1)
- Trassenallokationsproblem (1)
- Umsteigen (1)
- combinatorial optimization (1)
- integer programming (1)
- line planning (1)
- transfers (1)
Institute
- Mathematics of Transportation and Logistics (3) (remove)
We propose a novel integer programming approach to transfer minimization for line planning problems in public transit. The idea is to incorporate penalties for transfers that are induced by “connection capacities” into the construction of the passenger paths. We show that such penalties can be dealt with by a combination of shortest and constrained shortest path algorithms such that the pricing problem for passenger paths can be solved efficiently. Connection capacity penalties (under)estimate the true transfer times. This error is, however, not a problem in practice. We show in a computational comparison with two standard models on a real-world scenario that our approach can be used to minimize passenger travel and transfer times for large-scale line planning problems with accurate results.
The track allocation problem, also known as train routing problem or train timetabling problem, is to find a conflict-free set of train routes of maximum value in a railway network. Although it can be modeled as a standard path packing problem, instances of sizes relevant for real-world railway applications could not be solved up to now. We propose a rapid branching column generation approach that integrates the solution of the LP relaxation of a path coupling formulation of the problem with a special rounding heuristic. The approach is based on and exploits special properties of the bundle method for the approximate solution of convex piecewise linear functions. Computational results for difficult instances of the benchmark library TTPLIB are reported.