Exact algorithms for the clustered vehicle routing problem
DOI10.1287/OPRE.2013.1227zbMATH Open1291.90030OpenAlexW2093795574MaRDI QIDQ5166298FDOQ5166298
Authors: Maria Battarra, Güneş Erdogăn, 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
Recommendations
- A unified exact approach for clustered and generalized vehicle routing problems
- Exact solution of the soft-clustered vehicle-routing problem
- A fast two-level variable neighborhood search for the clustered vehicle routing problem
- A branch-and-cut algorithm for the soft-clustered vehicle-routing problem
- Hybrid metaheuristics for the clustered vehicle routing problem
Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Integer programming (90C10) Transportation, logistics and supply chain management (90B06)
Cited In (29)
- An effective hybrid evolutionary algorithm for the clustered orienteering problem
- Waste collection routing: a survey on problems and methods
- A branch-and-cut algorithm for the soft-clustered vehicle-routing problem
- The joint order batching and picker routing problem: modelled and solved as a clustered vehicle routing problem
- Exact solution of the soft-clustered vehicle-routing problem
- Using clustering analysis in a capacitated location-routing problem
- A decomposition-based method for solving the clustered vehicle routing problem
- Minimizing customers' waiting time in a vehicle routing problem with unit demands
- Approximation algorithms for the min-max clustered \(k\)-traveling salesmen problems
- The multi-vehicle probabilistic covering tour problem
- Visual attractiveness in routing problems: a review
- Vehicle routing with endogenous learning: application to offshore plug and abandonment campaign planning
- Title not available (Why is that?)
- Title not available (Why is that?)
- Dynamic community partitioning for e-commerce last mile delivery with time window constraints
- 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
- Community logistics and dynamic community partitioning: a new approach for solving e-commerce last mile delivery
- Large multiple neighborhood search for the clustered vehicle-routing problem
- Erratum—Exact Algorithms for the Clustered Vehicle Routing Problem
- Sustainable operations
- Hybrid metaheuristics for the clustered vehicle routing problem
- Road-based goods transportation: a survey of real-world logistics applications from 2000 to 2015
- Large multiple neighborhood search for the soft-clustered vehicle-routing problem
- The multi‐depot family traveling salesman problem and clustered variants: Mathematical formulations and branch‐&‐cut based methods
- Gotta (efficiently) catch them all: Pokémon GO meets orienteering problems
- Clustered vehicle routing problem for waste collection with smart operational management approaches
- A unified exact approach for clustered and generalized vehicle routing problems
- Modeling and solving the two-level generalized median tour problem
Uses Software
This page was built for publication: Exact algorithms for the clustered vehicle routing problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5166298)
