Prepositioning can improve the performance of a dynamic stochastic on-demand public bus system
From MaRDI portal
Publication:6069239
Cites work
- A Branch-and-Cut Algorithm for the Dial-a-Ride Problem
- A hybrid tabu search and constraint programming algorithm for the dynamic dial-a-ride problem
- A review of dynamic vehicle routing problems
- A sample average approximation approach for the stochastic dial-a-ride problem on a multigraph with user satisfaction
- A stochastic model for a vehicle in a dial-a-ride system
- A two-phase insertion technique of unexpected customers for a dynamic dial-a-ride problem
- An integer \(L\)-shaped algorithm for the dial-a-ride problem with stochastic customer delays
- Dynamic transportation of patients in hospitals
- Event-based MILP models for ridepooling applications
- Integrating stochastic time-dependent travel speed in solution methods for the dynamic dial-a-ride problem
- Interrelated trips in the rural dial-a-ride problem with autonomous vehicles
- Local search heuristics for the probabilistic dial-a-ride problem
- Metaheuristics for the dynamic stochastic dial-a-ride problem with expected return transports
- Online spatio-temporal matching in stochastic and dynamic domains
- Passenger demand forecasting in scheduled transportation
- Recovery management for a dial-a-ride system with real-time disruptions
- The dial-a-ride problem: Models and algorithms
- The real-time on-demand bus routing problem: the cost of dynamic requests
- The study of a dynamic dial-a-ride problem under time-dependent and stochastic environments
- Typology and literature review for dial-a-ride problems
- Variable neighborhood search for the dial-a-ride problem
This page was built for publication: Prepositioning can improve the performance of a dynamic stochastic on-demand public bus system
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6069239)
