90C10 Integer programming
Refine
Year of publication
- 2010 (3) (remove)
Document Type
- ZIB-Report (3) (remove)
Language
- English (3)
Has Fulltext
- yes (3)
Is part of the Bibliography
- no (3)
Keywords
- combinatorial optimization (2)
- Column Generation (1)
- Flugzeugumlaufplanung (1)
- Ganzzahlige Programmierung (1)
- Kombinatorische Optimierung (1)
- Linienplanung (1)
- Robust Optimization (1)
- Spaltenerzeugung (1)
- Tail Assignment (1)
- Umsteigen (1)
Institute
Robust Tail Assignment
(2010)
We propose an efficient column generation method to minimize the probability of delay propagations along aircraft rotations. In this way, delay resistant schedules can be constructed. Computational results for large-scale real-world problems demonstrate substantial punctuality improvements. The method can be generalized to crew and integrated scheduling problems.
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.