Exact algorithms for the clustered vehicle routing problem
From MaRDI portal
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
Cited in
(36)- Visual attractiveness in routing problems: a review
- 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
- Gotta (efficiently) catch them all: Pokémon GO meets orienteering problems
- Minimizing customers' waiting time in a vehicle routing problem with unit demands
- Large multiple neighborhood search for the clustered vehicle-routing problem
- Vehicle routing with endogenous learning: application to offshore plug and abandonment campaign planning
- A unified exact approach for clustered and generalized vehicle routing problems
- A branch-and-cut algorithm for the soft-clustered vehicle-routing problem
- Exact solution of the soft-clustered vehicle-routing problem
- 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
- Approximation algorithms for the min-max clustered \(k\)-traveling salesmen problems
- Sustainable operations
- Hybrid metaheuristics for the clustered vehicle routing problem
- scientific article; zbMATH DE number 3989085 (Why is no real title available?)
- scientific article; zbMATH DE number 1184494 (Why is no real title available?)
- scientific article; zbMATH DE number 4195679 (Why is no real title available?)
- A decomposition-based method for solving the clustered vehicle routing problem
- Erratum—Exact Algorithms for the Clustered Vehicle Routing Problem
- Road-based goods transportation: a survey of real-world logistics applications from 2000 to 2015
- 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
- Modeling and solving the two-level generalized median tour problem
- An effective hybrid evolutionary algorithm for the clustered orienteering problem
- Waste collection routing: a survey on problems and methods
- Clustered vehicle routing problem for waste collection with smart operational management approaches
- Energy-efficient UAV routing problem based on approximate cellular decomposition for geohazards monitoring
- Implementing a multi-user framework for vehicle routing problems: a chronicle
- Designing visually and operationally attractive routes to improve driver acceptance in road cleaning vehicle routing problem
- Solving soft and hard-clustered vehicle routing problems: a bi-population collaborative memetic search approach
- An effective multi-level memetic search with neighborhood reduction for the clustered team orienteering problem
- Optimizing delivery systems within the e-retail context: a weighted self-organizing map for delivery region partitioning
- The multi-vehicle probabilistic covering tour problem
- Using clustering analysis in a capacitated location-routing problem
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)
