1 citations · 1 across the 2 of their papers we have counts for
2 papers
cs.AI2023★ 1 cited
Rolling Horizon based Temporal Decomposition for the Offline Pickup and Delivery Problem with Time Windows
Youngseo Kim, Danushka Edirimanna, Michael Wilbur +4
The offline pickup and delivery problem with time windows (PDPTW) is a classical combinatorial optimization problem in the transportation community, which has proven to be very cha…
cs.AI2022
An Online Approach to Solve the Dynamic Vehicle Routing Problem with Stochastic Trip Requests for Paratransit Services
Michael Wilbur, Salah Uddin Kadir, Youngseo Kim +6
Many transit agencies operating paratransit and microtransit services have to respond to trip requests that arrive in real-time, which entails solving hard combinatorial and sequen…