1 citations · 1 across the 4 of their papers we have counts for
4 papers · 1 filter
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…
Offline Vehicle Routing Problem with Online Bookings: A Novel Problem Formulation with Applications to Paratransit
Amutheezan Sivagnanam, Salah Uddin Kadir, Ayan Mukhopadhyay +4
Vehicle routing problems (VRPs) can be divided into two major categories: offline VRPs, which consider a given set of trip requests to be served, and online VRPs, which consider re…
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…
Minimizing Energy Use of Mixed-Fleet Public Transit for Fixed-Route Service
Amutheezan Sivagnanam, Afiya Ayman, Michael Wilbur +3
Affordable public transit services are crucial for communities since they enable residents to access employment, education, and other services. Unfortunately, transit services that…