A Concurrent Approach to the Periodic Event Scheduling Problem
- 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.
Additional Services
| Author: | Ralf BorndörferORCiD, Niels LindnerORCiD, Sarah Roth |
|---|---|
| Document Type: | Article |
| Parent Title (English): | Journal of Rail Transport Planning & Management |
| Issue: | 15 |
| First Page: | 100175 |
| Year of first publication: | 2020 |
| ISSN: | 2210-9706 |
| Preprint: | urn:nbn:de:0297-zib-71907 |
| DOI: | https://doi.org/10.1016/j.jrtpm.2019.100175 |
