Pages that link to "Item:Q4656714"
From MaRDI portal
The following pages link to New assignment algorithms for the multi-depot vehicle routing problem (Q4656714):
Displaying 16 items.
- Evaluating two new heuristics for constructing customer clusters in a VRPTW with multiple service workers (Q301906) (← links)
- The multi-depot vehicle routing problem with heterogeneous vehicle fleet: formulation and a variable neighborhood search implementation (Q337237) (← links)
- An analysis of the extended Christofides heuristic for the \(k\)-depot TSP (Q635520) (← links)
- Bilevel model for production-distribution planning solved by using ant colony optimization (Q709146) (← links)
- A choice function hyper-heuristic framework for the allocation of maintenance tasks in Danish railways (Q1652574) (← links)
- Single-source capacitated multi-facility Weber problem-an iterative two phase heuristic algorithm (Q1762137) (← links)
- A GVNS algorithm for solving the multi-depot vehicle routing problem (Q1791946) (← links)
- Optimizing logistics routings in a network perspective of supply and demand nodes (Q2033331) (← links)
- An efficient variable neighborhood search with tabu shaking for a class of multi-depot vehicle routing problems (Q2668773) (← links)
- A 3/2-approximation algorithm for the multiple TSP with a fixed number of depots (Q2802244) (← links)
- Solving a Family of Multi-Depot Vehicle Routing and Location-Routing Problems (Q3813590) (← links)
- A branch and bound algorithm for the multiple depot vehicle scheduling problem (Q3826353) (← links)
- (Q4623948) (← links)
- Decision Support System for the Multi-depot Vehicle Routing Problem (Q5356968) (← links)
- AN ASP-BASED MODEL EMPLOYING A TABU SEARCH METHOD FOR MAKING e-LOGISTICS DECISIONS (Q5405793) (← links)
- Formulating and solving integrated order batching and routing in multi-depot AGV-assisted mixed-shelves warehouses (Q6109817) (← links)
