A robust enhancement to the Clarke-Wright savings algorithm

Doyuran, Tamer and Çatay, Bülent (2009) A robust enhancement to the Clarke-Wright savings algorithm. (Accepted/In Press)

WarningThere is a more recent version of this item available.

[img]PDF (This is a RoMEO yellow publisher -- author can archive pre-print (ie pre-refereeing)) - Registered users only - Requires a PDF viewer such as GSview, Xpdf or Adobe Acrobat Reader


We address the Clarke and Wright (CW) savings algorithm proposed for the Capacitated Vehicle Routing Problem (CVRP). We first consider a recent enhancement which uses the put first larger items idea originally proposed for the bin packing problem and show that the conflicting idea of putting smaller items first has a comparable performance. Next, we propose a robust enhancement to the CW savings formulation. The proposed formulation is normalized to efficiently solve different problems, independent from the measurement units and parameter intervals. To test the performance of the proposed savings function, we conduct an extensive computational study on a large set of well-known instances from the literature. Our results show that the proposed savings function provides shorter distances in the majority of the instances and the average performance is significantly better than previously presented enhancements.

Item Type:Article
Uncontrolled Keywords:Vehicle routeing, Clarke-Wright savings algorithm, heuristics
ID Code:12597
Deposited By:Bülent Çatay
Deposited On:10 Nov 2009 11:22
Last Modified:23 Jul 2019 15:26

Available Versions of this Item

Repository Staff Only: item control page