A Concurrent Approach to the Periodic Event Scheduling Problem

Please always quote using this URN: urn:nbn:de:0297-zib-71907
  • We introduce a concurrent solver for the periodic event scheduling problem (PESP). It combines mixed integer programming techniques, the modulo network simplex method, satisfiability approaches, and a new heuristic based on maximum cuts. Running these components in parallel speeds up the overall solution process. This enables us to significantly improve the current upper and lower bounds for all benchmark instances of the library PESPlib.

Download full text files

Export metadata

Metadaten
Author:Ralf Borndörfer, Niels Lindner, Sarah Roth
Document Type:ZIB-Report
Tag:Mixed Integer Programming; Periodic Event Scheduling Problem; Periodic Timetabling
MSC-Classification:90-XX OPERATIONS RESEARCH, MATHEMATICAL PROGRAMMING
Date of first Publication:2019/02/04
Series (Serial Number):ZIB-Report (19-07)
ISSN:1438-0064