Report
Sorting Criteria for Line-based Periodic Timetabling Heuristics
| العنوان: | Sorting Criteria for Line-based Periodic Timetabling Heuristics |
|---|---|
| المؤلفون: | Ebert, Patricia, Masing, Berenike, Lindner, Niels, Gleixner, Ambros |
| سنة النشر: | 2024 |
| المجموعة: | Publication Server of Zuse Institute Berlin (ZIB) |
| الوصف: | It is well-known that optimal solutions are notoriously hard to find for the Periodic Event Scheduling Problem (PESP), which is the standard mathematical formulation to optimize periodic timetables in public transport. We consider a class of incremental heuristics that have been demonstrated to be effective by Lindner and Liebchen (2023), however, for only one fixed sorting strategy of lines along which a solution is constructed. Thus, in this paper, we examine a variety of sortings based on the number, weight, weighted span, and lower bound of arcs, and test for each setting various combinations of the driving, dwelling, and transfer arcs of lines. Additionally, we assess the impact on the incremental extension of the event-activity network by minimizing resp. maximizing a connectivity measure between subsets of lines. We compare our 27 sortings on the railway instances of the benchmarking library PESPlib within the ConcurrentPESP solver framework. We are able to find five new incumbent solutions, resulting in improvements of up to 2%. |
| نوع الوثيقة: | report |
| وصف الملف: | application/pdf |
| اللغة: | English |
| الاتاحة: | https://opus4.kobv.de/opus4-zib/frontdoor/index/index/docId/9782 https://nbn-resolving.org/urn:nbn:de:0297-zib-97826 https://opus4.kobv.de/opus4-zib/files/9782/ZR-24-07.pdf |
| Rights: | info:eu-repo/semantics/openAccess |
| رقم الانضمام: | edsbas.9F3B222F |
| قاعدة البيانات: | BASE |
| الوصف غير متاح. |