Exact Algorithms for the Clustered Vehicle Routing Problem
From MaRDI portal
Publication:5166298
DOI10.1287/opre.2013.1227zbMath1291.90030OpenAlexW2093795574MaRDI QIDQ5166298
Maria Battarra, Güneş Erdoğan, Daniele Vigo
Publication date: 26 June 2014
Published in: Operations Research (Search for Journal in Brave)
Full work available at URL: https://eprints.soton.ac.uk/361819/1/cluvrp_paper_submitted_to_OR.pdf
Integer programming (90C10) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Transportation, logistics and supply chain management (90B06)
Related Items (21)
Road-based goods transportation: a survey of real-world logistics applications from 2000 to 2015 ⋮ Visual attractiveness in routing problems: a review ⋮ Sustainable operations ⋮ Hybrid metaheuristics for the clustered vehicle routing problem ⋮ A fast two-level variable neighborhood search for the clustered vehicle routing problem ⋮ The bi-objective insular traveling salesman problem with maritime and ground transportation costs ⋮ Large multiple neighborhood search for the soft-clustered vehicle-routing problem ⋮ The joint order batching and picker routing problem: modelled and solved as a clustered vehicle routing problem ⋮ Gotta (efficiently) catch them all: Pokémon GO meets orienteering problems ⋮ Approximation algorithms for the min-max clustered \(k\)-traveling salesmen problems ⋮ Dynamic community partitioning for e-commerce last mile delivery with time window constraints ⋮ The multi‐depot family traveling salesman problem and clustered variants: Mathematical formulations and branch‐&‐cut based methods ⋮ Community logistics and dynamic community partitioning: a new approach for solving e-commerce last mile delivery ⋮ A branch-and-cut algorithm for the soft-clustered vehicle-routing problem ⋮ Minimizing customers' waiting time in a vehicle routing problem with unit demands ⋮ Large multiple neighborhood search for the clustered vehicle-routing problem ⋮ Erratum—Exact Algorithms for the Clustered Vehicle Routing Problem ⋮ Exact solution of the soft-clustered vehicle-routing problem ⋮ Vehicle routing with endogenous learning: application to offshore plug and abandonment campaign planning ⋮ The multi-vehicle probabilistic covering tour problem ⋮ A unified exact approach for clustered and generalized vehicle routing problems
Uses Software
This page was built for publication: Exact Algorithms for the Clustered Vehicle Routing Problem
