1 results
Now showing1 - 1 of 1
- Some of the metrics are blocked by yourconsent settings
Item type:Publication, Access status: without files , A comparison of repositioning and scheduling algorithms for the ride-hailing problem(Springer, 2026-08); ; ; The Ride-Hailing Problem is an online optimization challenge that coordinates a fleet of vehicles to serve requests revealed over time. The problem is NP-hard, and many solution approaches use stochastic or machine-learning based algorithms, which perform well but are difficult to interpret. We study the trade-offs between performance and explainability. Our results show that greedy assignment consistently outperforms more complex methods, indicating that explainability need not come at the cost of efficiency. We also find that the effectiveness of repositioning strategies strongly depends on demand patterns, highlighting the value of context-aware policies.Publicationtype: Conference Paper7