Evaluating two new heuristics for constructing customer clusters in a VRPTW with multiple service workers
From MaRDI portal
Publication:301906
DOI10.1007/s10100-014-0373-4zbMath1339.90065OpenAlexW1976970037MaRDI QIDQ301906
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
Transportation, logistics and supply chain management (90B06) Approximation methods and heuristics in mathematical programming (90C59) Inventory, storage, reservoirs (90B05)
Related Items (6)
A branch-price-and-cut algorithm for the vehicle routing problem with time windows and multiple deliverymen ⋮ Collaborative decision systems in economics and in complex societal and environmental applications ⋮ Small and large neighborhood search for the park-and-loop routing problem with parking selection ⋮ Verification of Correctness of Parallel Algorithms in Practice ⋮ Optimizing logistics routings in a network perspective of supply and demand nodes ⋮ Robust optimization for the vehicle routing problem with multiple deliverymen
Uses Software
Cites Work
- 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 with multiple deliverymen: modeling and heuristic approaches for the VRPTW
- A GRASP with evolutionary path relinking for the truck and trailer routing problem
- 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
- Solving the truck and trailer routing problem based on a simulated annealing heuristic
- D-Ants: Savings Based Ants divide and conquer the vehicle routing problem.
- Greedy randomized adaptive search procedures
- Lower and upper bounds for location-arc routing problems with vehicle capacity constraints
- Vehicle routing problems with time windows and multiple service workers: a systematic comparison between ACO and GRASP
- The Truck Dispatching Problem
- Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints
- A cluster insertion heuristic for single and multiple depot vehicle routing problems with backhauling
This page was built for publication: Evaluating two new heuristics for constructing customer clusters in a VRPTW with multiple service workers
