New assignment algorithms for the multi-depot vehicle routing problem

DOI10.1057/palgrave.jors.2601426zbMath1079.90030OpenAlexW2040244622MaRDI QIDQ4656714

I. L. Tansini, I. O. Viera, I. D. Giosa

Publication date: 14 March 2005

Published in: Journal of the Operational Research Society (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1057/palgrave.jors.2601426

zbMATH Keywords

clusteringassignmentmulti-depot vehicle routing problem

Mathematics Subject Classification ID

Traffic problems in operations research (90B20) Discrete location and assignment (90B80)

Related Items (10)

The multi-depot vehicle routing problem with heterogeneous vehicle fleet: formulation and a variable neighborhood search implementation ⋮ A choice function hyper-heuristic framework for the allocation of maintenance tasks in Danish railways ⋮ An efficient variable neighborhood search with tabu shaking for a class of multi-depot vehicle routing problems ⋮ Formulating and solving integrated order batching and routing in multi-depot AGV-assisted mixed-shelves warehouses ⋮ An analysis of the extended Christofides heuristic for the \(k\)-depot TSP ⋮ AN ASP-BASED MODEL EMPLOYING A TABU SEARCH METHOD FOR MAKING e-LOGISTICS DECISIONS ⋮ Single-source capacitated multi-facility Weber problem-an iterative two phase heuristic algorithm ⋮ Bilevel model for production-distribution planning solved by using ant colony optimization ⋮ Optimizing logistics routings in a network perspective of supply and demand nodes ⋮ A 3/2-Approximation Algorithm for the Multiple TSP with a Fixed Number of Depots

This page was built for publication: New assignment algorithms for the multi-depot vehicle routing problem