New measures of proximity for the assignment algorithms in the MDVRPTW

DOI10.1057/palgrave.jors.2601979zbMath1089.90046OpenAlexW2009857387MaRDI QIDQ5469660

Omar Viera, Libertad Tansini

Publication date: 26 May 2006

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.2601979

zbMATH Keywords

clusteringtime windowsassignmentmulti-depot vehicle routing problem

Mathematics Subject Classification ID

Transportation, logistics and supply chain management (90B06) Combinatorial optimization (90C27)

Related Items (5)

An efficient variable neighborhood search with tabu shaking for a class of multi-depot vehicle routing problems ⋮ Bilevel model for production-distribution planning solved by using ant colony optimization ⋮ Multi-depot vehicle routing problem with time windows under shared depot resources ⋮ MDVRPTW ⋮ A variable neighborhood search-based algorithm with adaptive local search for the vehicle routing problem with time windows and multi-depots aiming for vehicle fleet reduction

This page was built for publication: New measures of proximity for the assignment algorithms in the MDVRPTW