Instance generation tool for on-demand transportation problems
From MaRDI portal
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
- Analysis of a random cut test instance generator for the TSP
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 1361564 (Why is no real title available?)
- scientific article; zbMATH DE number 1893558 (Why is no real title available?)
- Human mobility: models and applications
- Integrating stochastic time-dependent travel speed in solution methods for the dynamic dial-a-ride problem
- Limits of Predictability in Human Mobility
- Maximizing the number of served requests in an online shared transport system by solving a dynamic DARP
- Measures of dynamism and urgency in logistics
- Partially dynamic vehicle routing—models and algorithms
- The dial-a-ride problem: Models and algorithms
- The real-time on-demand bus routing problem: the cost of dynamic requests
Cited in
(2)
This page was built for publication: Instance generation tool for on-demand transportation problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6982898)