Multiple plan approach for a dynamic dial-a-ride problem
From MaRDI portal
Cites work
- A hybrid tabu search and constraint programming algorithm for the dynamic dial-a-ride problem
- A tabu search heuristic for the dynamic transportation of patients between care units
- A two-phase insertion technique of unexpected customers for a dynamic dial-a-ride problem
- Bi-objective optimization model for the heterogeneous dynamic dial-a-ride problem with no rejects
- Comparison of anticipatory algorithms for a dial-a-ride problem
- 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
- Metaheuristics for the dynamic stochastic dial-a-ride problem with expected return transports
- Models and algorithms for the heterogeneous dial-a-ride problem with driver-related constraints
- New optimization guidance for dynamic dial-a-ride problems
- Scenario-Based Planning for Partially Dynamic Vehicle Routing with Stochastic Customers
- Solving the dynamic Dial-a-Ride problem using a rolling-horizon event-based graph
- Stochastic dynamic vehicle routing in the light of prescriptive analytics: a review
- The dial-a-ride problem: Models and algorithms
- Typology and literature review for dial-a-ride problems
- Variable neighborhood search for the dial-a-ride problem
This page was built for publication: Multiple plan approach for a dynamic dial-a-ride problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6899859)
