Evaluating two new heuristics for constructing customer clusters in a VRPTW with multiple service workers
DOI10.1007/S10100-014-0373-4zbMATH Open1339.90065OpenAlexW1976970037MaRDI QIDQ301906FDOQ301906
Authors: Gerald Senarclens de Grancy, Marc Reinmann 
Publication date: 4 July 2016
Published in: CEJOR. Central European Journal of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10100-014-0373-4
Recommendations
- A fast two-level variable neighborhood search for the clustered vehicle routing problem
- A cluster-based optimization approach for the multi-depot heterogeneous fleet vehicle routing problem with time windows
- A unified exact approach for clustered and generalized vehicle routing problems
- Hybrid metaheuristics for the clustered vehicle routing problem
- New assignment algorithms for the multi-depot vehicle routing problem
Approximation methods and heuristics in mathematical programming (90C59) Inventory, storage, reservoirs (90B05) Transportation, logistics and supply chain management (90B06)
Cites Work
- D-Ants: Savings Based Ants divide and conquer the vehicle routing problem.
- The truck dispatching problem
- Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints
- A GRASP with evolutionary path relinking for the truck and trailer routing problem
- Solving the truck and trailer routing problem based on a simulated annealing heuristic
- Greedy randomized adaptive search procedures
- Lower and upper bounds for location-arc routing problems with vehicle capacity constraints
- A two-phase hybrid heuristic algorithm for the capacitated location-routing problem
- An adaptive large neighborhood search heuristic for two-echelon vehicle routing problems arising in city logistics
- Vehicle routing problems with time windows and multiple service workers: a systematic comparison between ACO and GRASP
- A cluster insertion heuristic for single and multiple depot vehicle routing problems with backhauling
- Vehicle routing with multiple deliverymen: modeling and heuristic approaches for the VRPTW
- A two-phase hybrid metaheuristic for the vehicle routing problem with time windows
- Scatter search for the fleet size and mix vehicle routing problem with time windows
Cited In (9)
- An exact method for a last-mile delivery routing problem with multiple deliverymen
- Heuristic approach for balanced allocation problem in logistics: a comparative study
- Collaborative decision systems in economics and in complex societal and environmental applications
- Verification of correctness of parallel algorithms in practice
- Small and large neighborhood search for the park-and-loop routing problem with parking selection
- Optimizing logistics routings in a network perspective of supply and demand nodes
- A cluster-based optimization approach for the multi-depot heterogeneous fleet vehicle routing problem with time windows
- A branch-price-and-cut algorithm for the vehicle routing problem with time windows and multiple deliverymen
- Robust optimization for the vehicle routing problem with multiple deliverymen
Uses Software
This page was built for publication: Evaluating two new heuristics for constructing customer clusters in a VRPTW with multiple service workers
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q301906)
