A new enhancement of the Clarke and Wright savings heuristic for the capacitated vehicle routing problem

DOI10.1057/PALGRAVE.JORS.2601916MaRDI QIDQ5313401zbMATH OpenOpenAlexFDO

Authors İ. Kuban Altınel, Temel Öncan

Publication date 1 September 2005

Published in The Journal of the Operational Research Society (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1057/palgrave.jors.2601916

Mathematics Subject Classification ID

Transportation, logistics and supply chain management (90B06) Combinatorial optimization (90C27) Approximation methods and heuristics in mathematical programming (90C59)

Recommendations

• Enhanced savings calculation and its applications for solving capacitated vehicle routing problem
• Heuristic solution approaches for the cumulative capacitated vehicle routing problem
• New heuristics for the vehicle routing problem
• Heuristic procedures for the capacitated vehicle routing problem
• A new branch-and-cut algorithm for the capacitated vehicle routing problem
• Improving the approximation ratio for capacitated vehicle routing
• Improving the approximation ratio for capacitated vehicle routing
• A generalized exchange heuristic for the capacitated vehicle routing problem
• The savings algorithm for the vehicle routing problem

Cited in

(13)

• A remark on ``Integer linear programming formulation for a vehicle routing problem by N. R. Achutan and L. Caccetta, or how to use the Clark \(\&\) Wright savings to write such integer linear programming formulations
• A parallel variable neighborhood search for the vehicle routing problem with divisible deliveries and pickups
• A hierarchical algorithm for the planar single-facility location routing problem
• A heuristic algorithm to solve the single-facility location routing problem on Riemannian surfaces
• Enhanced savings calculation and its applications for solving capacitated vehicle routing problem
• A perturbation based variable neighborhood search heuristic for solving the vehicle routing problem with simultaneous pickup and delivery with time limit
• Improving parametric Clarke and Wright algorithms by means of iterative empirically adjusted greedy heuristics
• A multi-agent based cooperative approach to scheduling and routing
• Combining probabilistic algorithms, constraint programming and Lagrangian relaxation to solve the vehicle routing problem
• 2-facility manifold location routing problem
• Ridesharing for emergency evacuation
• A critical analysis of the “improved Clarke and Wright savings algorithm”
• Solving a real case of rich vehicle routing problem with zone-dependent transportation costs

This page was built for publication: A new enhancement of the Clarke and Wright savings heuristic for the capacitated vehicle routing problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5313401)