Overview Statistic: PDF-Downloads (blue) and Frontdoor-Views (gray)
  • search hit 6 of 10
Back to Result List

A Multi-Swap Heuristic for Rolling Stock Rotation Planning with Predictive Maintenance

  • We present a heuristic solution approach for the rolling stock rotation problem with predictive maintenance (RSRP-PdM). The task of this problem is to assign a sequence of trips to each of the vehicles and to schedule their maintenance such that all trips can be operated. Here, the health states of the vehicles are considered to be random variables distributed by a family of probability distribution functions, and the maintenance services should be scheduled based on the failure probability of the vehicles. The proposed algorithm first generates a solution by solving an integer linear program and then heuristically improves this solution by applying a local search procedure. For this purpose, the trips assigned to the vehicles are split up and recombined, whereby additional deadhead trips can be inserted between the partial assignments. Subsequently, the maintenance is scheduled by solving a shortest path problem in a state-expanded version of a space-time graph restricted to the trips of the individual vehicles. The solution approach is tested and evaluated on a set of test instances based on real-world timetables.

Export metadata

Additional Services

Share in Twitter Search Google Scholar Statistics - number of accesses to the document
Metadaten
Author:Felix PrauseORCiD
Document Type:In Proceedings
Parent Title (English):Proceedings of the 11th International Network Optimization Conference (INOC), Dublin, Ireland, March 11-23, 2024
First Page:58
Last Page:63
Year of first publication:2024
Preprint:urn:nbn:de:0297-zib-93133
DOI:https://doi.org/10.48786/inoc.2024.11
Accept ✔
Diese Webseite verwendet technisch erforderliche Session-Cookies. Durch die weitere Nutzung der Webseite stimmen Sie diesem zu. Unsere Datenschutzerklärung finden Sie hier.