ZIB

Treffer pro Seite

Treffer 1 - 1 | 1 Treffer

Alles auswählen Exportieren

Unbekannt

Minimum Cost Hyperassignments with Applications to ICE/IC Rotation Planning (2012)

Borndörfer, Ralf ; Heismann, Olga

zur Merkliste hinzufügen auf der Merkliste

Details

Publikationsdatum: 2020-08-05

Beschreibung: 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.

Sprache: Englisch

Materialart: reportzib , doc-type:preprint

Format: application/pdf

Bibliothek	Standort	Signatur	Band/Heft/Jahr	Verfügbarkeit

Andere fanden auch interessant ...

OPUS

PDF

Überblick

Treffer 1 - 1 | 1 Treffer