Overview Statistic: PDF-Downloads (blue) and Frontdoor-Views (gray)

Determining all integer vertices of the PESP polytope by flipping arcs

  • We investigate polyhedral aspects of the Periodic Event Scheduling Problem (PESP), the mathematical basis for periodic timetabling problems in public transport. Flipping the orientation of arcs, we obtain a new class of valid inequalities, the flip inequalities, comprising both the known cycle and change-cycle inequalities. For a point of the LP relaxation, a violated flip inequality can be found in pseudo-polynomial time, and even in linear time for a spanning tree solution. Our main result is that the integer vertices of the polytope described by the flip inequalities are exactly the vertices of the PESP polytope, i.e., the convex hull of all feasible periodic slacks with corresponding modulo parameters. Moreover, we show that this flip polytope equals the PESP polytope in some special cases. On the computational side, we devise several heuristic approaches concerning the separation of cutting planes from flip inequalities. We finally present better dual bounds for the smallest and largest instance of the benchmarking library PESPlib.
Metadaten
Author:Niels LindnerORCiD, Christian LiebchenORCiD
Editor:Dennis Huisman, Christos D. Zaroliagis
Document Type:In Proceedings
Parent Title (English):20th Symposium on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (ATMOS 2020)
Volume:85
First Page:5:1
Last Page:5:18
Series:OpenAccess Series in Informatics (OASIcs)
Publisher:Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik
Place of publication:Dagstuhl, Germany
Year of first publication:2020
Preprint:urn:nbn:de:0297-zib-78793
DOI:https://doi.org/10.4230/OASIcs.ATMOS.2020.5
Accept ✔
Diese Webseite verwendet technisch erforderliche Session-Cookies. Durch die weitere Nutzung der Webseite stimmen Sie diesem zu. Unsere Datenschutzerklärung finden Sie hier.