8400
2021
eng
2:1
2:14
96
conferenceobject
0
--
--
--
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.
21st Symposium on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (ATMOS 2021)
10.4230/OASIcs.ATMOS.2021.2
Open Access Series in Informatics (OASIcs)
yes
publish
urn:nbn:de:0297-zib-82756
Niels Lindner
Niels Lindner
Christian Liebchen
Berenike Masing
MODAL-Gesamt
Lindner, Niels
Network Optimization
Masing, Berenike
MODAL-MobilityLab