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

Forward Cycle Bases and Periodic Timetabling

  • Periodic timetable optimization problems in public transport can be modeled as mixed-integer linear programs by means of the Periodic Event Scheduling Problem (PESP). In order to keep the branch-and-bound tree small, minimum integral cycle bases have been proven successful. We examine forward cycle bases, where no cycle is allowed to contain a backward arc. After reviewing the theory of these bases, we describe the construction of an integral forward cycle basis on a line-based event-activity network. Adding turnarounds to the instance R1L1 of the benchmark library PESPlib, we computationally evaluate three types of forward cycle bases in the Pareto sense, and come up with significant improvements concerning dual bounds.
Author:Niels LindnerORCiD, Christian LiebchenORCiD, Berenike MasingORCiD
Document Type:In Proceedings
Parent Title (English):21st Symposium on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (ATMOS 2021)
First Page:2:1
Last Page:2:14
Series:Open Access Series in Informatics (OASIcs)
Year of first publication:2021
Accept ✔
Diese Webseite verwendet technisch erforderliche Session-Cookies. Durch die weitere Nutzung der Webseite stimmen Sie diesem zu. Unsere Datenschutzerklärung finden Sie hier.