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

Timetable merging for the Periodic Event Scheduling Problem

  • We propose a new mixed integer programming based heuristic for computing new benchmark primal solutions for instances of the PESPlib. The PESPlib is a collection of instances for the Periodic Event Scheduling Problem (PESP), comprising periodic timetabling problems inspired by real-world railway timetabling settings, and attracting several international research teams during the last years. We describe two strategies to merge a set of good periodic timetables. These make use of the instance structure and minimum weight cycle bases, finally leading to restricted mixed integer programming formulations with tighter variable bounds. Implementing this timetable merging approach in a concurrent solver, we improve the objective values of the best known solutions for the smallest and largest PESPlib instances by 1.7 and 4.3 percent, respectively.
Metadaten
Author:Niels LindnerORCiD, Christian LiebchenORCiD
Document Type:Article
Parent Title (English):EURO Journal on Transportation and Logistics
Volume:11
First Page:100081
Year of first publication:2022
Preprint:urn:nbn:de:0297-zib-81587
DOI:https://doi.org/10.1016/j.ejtl.2022.100081
Accept ✔
Diese Webseite verwendet technisch erforderliche Session-Cookies. Durch die weitere Nutzung der Webseite stimmen Sie diesem zu. Unsere Datenschutzerklärung finden Sie hier.