Scaling and Rounding Periodic Event Scheduling Instances to Different Period Times
Please always quote using this URN: urn:nbn:de:0297-zib-92315
accepted for publication
- The Periodic Event Scheduling Problem (PESP) is a notoriously hard combinatorial optimization problem, essential for the design of periodic timetables in public transportation. The coefficients of the integer variables in the standard mixed integer linear programming formulations of PESP are the period time, e.g., 60 for a horizon of one hour with a resolution of one minute. In many application scenarios, lines with different frequencies have to be scheduled, leading to period times with many divisors. It then seems natural to consider derived instances, where the period time is a divisor of the original one, thereby smaller, and bounds are scaled and rounded accordingly. To this end, we identify two rounding schemes: wide and tight. We then discuss the approximation performance of both strategies, in theory and practice.
Download full text files
Additional Services
| Author: | Enrico BortolettoORCiD, Niels LindnerORCiD |
|---|---|
| Document Type: | ZIB-Report |
| Tag: | Mixed-Integer Programming; Public Transport; Timetabling |
| MSC-Classification: | 90-XX OPERATIONS RESEARCH, MATHEMATICAL PROGRAMMING |
| CCS-Classification: | J. Computer Applications |
| Date of first Publication: | 2023/09/22 |
| Series (Serial Number): | ZIB-Report (23-23) |
| ISSN: | 1438-0064 |