The real-time on-demand bus routing problem: the cost of dynamic requests
From MaRDI portal
Publication:2676345
Recommendations
- The online vehicle routing problem with occasional drivers
- scientific article; zbMATH DE number 2130493
- Maximizing the number of served requests in an online shared transport system by solving a dynamic DARP
- Online vehicle routing and scheduling with dynamic travel times
- A two-phase insertion technique of unexpected customers for a dynamic dial-a-ride problem
Cites work
- A simulation study of an on‐demand transportation system
- Maximizing the number of served requests in an online shared transport system by solving a dynamic DARP
- Optimization for dynamic ride-sharing: a review
- The dial-a-ride problem: Models and algorithms
- Typology and literature review for dial-a-ride problems
Cited in
(10)- Prepositioning can improve the performance of a dynamic stochastic on-demand public bus system
- The static on‐demand bus routing problem: large neighborhood search for a dial‐a‐ride problem with bus station assignment
- Real-time passenger bus routing problems with preferences and tradeoffs
- The integrated on-demand bus routing problem: combining on-demand buses with a high-frequency fixed line public transport network
- Analyzing the impact of demand management in rural shared mobility-on-demand systems
- Evaluating a simulated annealing metaheuristic for the heterogeneous on-demand bus routing problem with a novel experimental setup
- Static optimization of a semiflexible on-demand public bus line for peak hours
- Efficiently routing a fleet of autonomous vehicles in a real-time ride-sharing system
- Instance generation tool for on-demand transportation problems
- Optimizing transport operations in a hybrid mobility system for rural-urban transport
This page was built for publication: The real-time on-demand bus routing problem: the cost of dynamic requests
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2676345)