A new enhancement of the Clarke and Wright savings heuristic for the capacitated vehicle routing problem
From MaRDI portal
Publication:5313401
DOI10.1057/palgrave.jors.2601916zbMath1274.90290OpenAlexW1966842536MaRDI QIDQ5313401
Publication date: 1 September 2005
Published in: Journal of the Operational Research Society (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1057/palgrave.jors.2601916
Transportation, logistics and supply chain management (90B06) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)
Related Items (10)
Ridesharing for emergency evacuation ⋮ A perturbation based variable neighborhood search heuristic for solving the vehicle routing problem with simultaneous pickup and delivery with time limit ⋮ A multi-agent based cooperative approach to scheduling and routing ⋮ A parallel variable neighborhood search for the vehicle routing problem with divisible deliveries and pickups ⋮ A critical analysis of the “improved Clarke and Wright savings algorithm” ⋮ Combining probabilistic algorithms, constraint programming and Lagrangian relaxation to solve the vehicle routing problem ⋮ 2-facility manifold location routing problem ⋮ A hierarchical algorithm for the planar single-facility location routing problem ⋮ Enhanced savings calculation and its applications for solving capacitated vehicle routing problem ⋮ A heuristic algorithm to solve the single-facility location routing problem on Riemannian surfaces
This page was built for publication: A new enhancement of the Clarke and Wright savings heuristic for the capacitated vehicle routing problem
