Implementing a multi-user framework for vehicle routing problems: a chronicle
From MaRDI portal
Cites work
- A concise guide to existing and emerging vehicle routing problem variants
- A decomposition based memetic algorithm for multi-objective vehicle routing problem with time windows
- A general heuristic for vehicle routing problems
- A hybrid algorithm for a class of vehicle routing problems
- A Hybrid Genetic Algorithm for Multidepot and Periodic Vehicle Routing Problems
- A simple and effective evolutionary algorithm for the vehicle routing problem
- An efficient variable neighborhood search heuristic for very large scale vehicle routing problems
- D-Ants: Savings Based Ants divide and conquer the vehicle routing problem.
- Edge assembly-based memetic algorithm for the capacitated vehicle routing problem
- Efficiently solving very large-scale routing problems
- Exact algorithms for the clustered vehicle routing problem
- Handbook of metaheuristics
- Hybrid metaheuristics for the clustered vehicle routing problem
- Improved branch-cut-and-price for capacitated vehicle routing
- New benchmark instances for the capacitated vehicle routing problem
- The multi-depot vehicle routing problem with inter-depot routes
- Time Dependent Vehicle Routing Problems: Formulations, Properties and Heuristic Algorithms
- Vehicle Routing
Cited in
(2)
This page was built for publication: Implementing a multi-user framework for vehicle routing problems: a chronicle
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6953385)