New assignment algorithms for the multi-depot vehicle routing problem
From MaRDI portal
Recommendations
- New measures of proximity for the assignment algorithms in the MDVRPTW
- Multiple depot vehicle routing problems on clustering algorithms
- The Multi-Depot Routing Allocation Problem
- Solving min-max multi-depot vehicle routing problem
- Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints
Cited in
(21)- A choice function hyper-heuristic framework for the allocation of maintenance tasks in Danish railways
- Single-source capacitated multi-facility Weber problem-an iterative two phase heuristic algorithm
- A GVNS algorithm for solving the multi-depot vehicle routing problem
- Optimizing logistics routings in a network perspective of supply and demand nodes
- An efficient variable neighborhood search with tabu shaking for a class of multi-depot vehicle routing problems
- A 3/2-approximation algorithm for the multiple TSP with a fixed number of depots
- Evaluating two new heuristics for constructing customer clusters in a VRPTW with multiple service workers
- An algorithm of multi-depots and multi-type vehicles routing based on global searching clustering
- The multi-depot vehicle routing problem with heterogeneous vehicle fleet: formulation and a variable neighborhood search implementation
- The Multi-Depot Routing Allocation Problem
- Solving a Family of Multi-Depot Vehicle Routing and Location-Routing Problems
- A branch and bound algorithm for the multiple depot vehicle scheduling problem
- scientific article; zbMATH DE number 7028242 (Why is no real title available?)
- Multiple depot vehicle routing problems on clustering algorithms
- Solving min-max multi-depot vehicle routing problem
- Decision Support System for the Multi-depot Vehicle Routing Problem
- AN ASP-BASED MODEL EMPLOYING A TABU SEARCH METHOD FOR MAKING e-LOGISTICS DECISIONS
- Formulating and solving integrated order batching and routing in multi-depot AGV-assisted mixed-shelves warehouses
- Multi-Zone Multi-Trip Vehicle Routing Problem with Time Windows
- An analysis of the extended Christofides heuristic for the \(k\)-depot TSP
- Bilevel model for production-distribution planning solved by using ant colony optimization
This page was built for publication: New assignment algorithms for the multi-depot vehicle routing problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4656714)
