Minimum Cost Hyperassignments with Applications to ICE/IC Rotation Planning
Vehicle rotation planning is a fundamental problem in rail transport. It decides how the railcars, locomotives, and carriages are operated in order to implement the trips of the timetable. One important planning requirement is operational regularity, i. e., using the rolling stock in the same way on every day of operation. We propose to take regularity into account by modeling the vehicle rotation planning problem as a minimum cost hyperassignment problem (HAP). Hyperassignments are generalizations of assignments from directed graphs to directed hypergraphs. Finding a minimum cost hyperassignment is NP-hard. Most instances arising from regular vehicle rotation planning, however, can be solved well in practice.We show that, in particular, clique inequalities strengthen the canonical LP relaxation substantially.
KeywordsRotation Planning Rolling Stock Rail Transport Railway Company Operational Regularity
Unable to display preview. Download preview PDF.
- 1.Gallo, G., Longo, G., Pallottino, S., Nguyen, S.: Directed hypergraphs and applications. Discrete Applied Mathematics (1993) doi: 10.1016/0166-218X(93)90045-PGoogle Scholar
- 2.Garey, M. R., Johnson, D. S.: Computers and Intractability: A Guide to the Theory of NPCompleteness (Series of Books in the Mathematical Sciences). W. H. Freeman (1979)Google Scholar
- 3.Heismann, O.: Minimum cost hyperassignments. Master’s thesis, TU Berlin (2010)Google Scholar
- 4.Maróti, G.: Operations research models for railway rolling stock planning. Eindhoven University of Technology (2006)Google Scholar