Evaluating two new heuristics for constructing customer clusters in a VRPTW with multiple service workers

DOI10.1007/S10100-014-0373-4MaRDI QIDQ301906zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

city logisticscustomer clusteringheuristicstime windowsvehicle routing

Mathematics Subject Classification ID

Inventory, storage, reservoirs (90B05) Transportation, logistics and supply chain management (90B06) Approximation methods and heuristics in mathematical programming (90C59)

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

Cites work

• A cluster insertion heuristic for single and multiple depot vehicle routing problems with backhauling
• A GRASP with evolutionary path relinking for the truck and trailer routing problem
• A two-phase hybrid heuristic algorithm for the capacitated location-routing problem
• A two-phase hybrid metaheuristic for the vehicle routing problem with time windows
• Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints
• An adaptive large neighborhood search heuristic for two-echelon vehicle routing problems arising in city logistics
• 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
• 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
• The truck dispatching problem
• Vehicle routing problems with time windows and multiple service workers: a systematic comparison between ACO and GRASP
• Vehicle routing with multiple deliverymen: modeling and heuristic approaches for the VRPTW

Cited in

(9)

• A branch-price-and-cut algorithm for the vehicle routing problem with time windows and multiple deliverymen
• Optimizing logistics routings in a network perspective of supply and demand nodes
• Robust optimization for the vehicle 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
• An exact method for a last-mile delivery routing problem with multiple deliverymen
• A cluster-based optimization approach for the multi-depot heterogeneous fleet vehicle routing problem with time windows

Describes a project that uses

Uses Software

• NumPy
• Matplotlib

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)