Enhanced savings calculation and its applications for solving capacitated vehicle routing problem

DOI10.1016/j.amc.2013.04.002zbMath1293.90005OpenAlexW1964975243MaRDI QIDQ2511703

Bogdana Stanojević, Mirko Vujošević, Milan Stanojević

Publication date: 6 August 2014

Published in: Applied Mathematics and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.amc.2013.04.002

zbMATH Keywords

vehicle routing problemgreedy heuristicset-covering-based algorithm

Mathematics Subject Classification ID

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

Related Items

A new efficient approach for solving the capacitated vehicle routing problem using the gravitational emulation local search algorithm

Uses Software

• VRP

Cites Work

• Unnamed Item
• Unnamed Item
• Generalized network design problems. Modeling and optimization.
• Semi-greedy heuristics: An empirical study
• New mathematical models of the generalized vehicle routing problem and extensions
• The Truck Dispatching Problem
• Fine-tuning a parametric Clarke and Wright heuristic by means of EAGH (empirically adjusted greedy heuristics)
• A new enhancement of the Clarke and Wright savings heuristic for the capacitated vehicle routing problem
• A new efficient transformation of the generalized vehicle routing problem into the classical vehicle routing problem
• The noising methods: A generalization of some metaheuristics