Approximate Dynamic Programming for Real-time Assignment of Extraboard Transit Operators
Jilin Song, Amer Shalaby, Merve Bodur

TL;DR
This paper develops an approximate dynamic programming approach to optimize real-time assignment of extraboard transit operators, improving service reliability amid unexpected absenteeism.
Contribution
It introduces a novel integer programming-based policy and correction method for value overestimation, tailored for large-scale stochastic transit assignment problems.
Findings
The approximate policy outperforms real-world benchmark strategies.
Including overtime drivers improves coverage and flexibility.
Adjusting reward weights influences passenger wait time and operational efficiency.
Abstract
This study investigates real-time assignment decisions for extraboard transit operators, who are responsible for covering open work due to unexpected events such as driver absenteeism. Efficient usage of extraboard operators is critical as open work negatively affects service reliability. The problem is formulated as a Markov decision process, designed to capture its stochastic and sequential nature. Due to the problem's very large state space, an approximate policy is proposed in the form of an integer program, which maps a system state to assignment decisions such that the sum of immediate and expected future rewards is maximized. As part of off-line training, future value functions for individual operators are computed using a backward dynamic program. Then, the overestimation in the aggregate value obtained by summing individual values is corrected to account for the interaction…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
