Multiple depot vehicle routing problems on clustering algorithms
From MaRDI portal
Recommendations
- New assignment algorithms for the multi-depot vehicle routing problem
- An algorithm of multi-depots and multi-type vehicles routing based on global searching clustering
- Solving min-max multi-depot vehicle routing problem
- FSTTCS 2005: Foundations of Software Technology and Theoretical Computer Science
- A GVNS algorithm for solving the multi-depot vehicle routing problem
Cites work
- A unified exact method for solving different classes of vehicle routing problems
- Clustering search algorithm for the capacitated centered clustering problem
- Clustering to minimize the maximum intercluster distance
- Exact algorithms for the vehicle routing problem, based on spanning tree and shortest path relaxations
- Rearrangement clustering: pitfalls, remedies, and applications
- Solving a Family of Multi-Depot Vehicle Routing and Location-Routing Problems
- Some Simple Applications of the Travelling Salesman Problem
- The capacitated centred clustering problem
- The min-max split delivery multi-depot vehicle routing problem with minimum service time requirement
- The multi-depot vehicle routing problem with inter-depot routes
Cited in
(4)- An algorithm of multi-depots and multi-type vehicles routing based on global searching clustering
- Probabilistic analysis for a multiple depot vehicle routing problem
- scientific article; zbMATH DE number 7028242 (Why is no real title available?)
- New assignment algorithms for the multi-depot vehicle routing problem
This page was built for publication: Multiple depot vehicle routing problems on clustering algorithms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5120561)
