The rich heterogeneous dial-a-ride problem with trip time prediction
From MaRDI portal
(Redirected from The rich heterogeneous dial-a-ride problem with trip time prediction)
Cites work
- A Branch-and-Cut Algorithm for the Dial-a-Ride Problem
- A road timetable\(^{\text{TM}}\) to aid vehicle routing and scheduling
- Integrating stochastic time-dependent travel speed in solution methods for the dynamic dial-a-ride problem
- Models and algorithms for the heterogeneous dial-a-ride problem with driver-related constraints
- Scikit-learn: machine learning in Python
- The dial-a-ride problem: Models and algorithms
- Trends in passenger transport optimisation
This page was built for publication: The rich heterogeneous dial-a-ride problem with trip time prediction
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6659104)