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)

Warning
There is a more recent version of this item available.
[thumbnail of This is a RoMEO yellow publisher -- author can archive pre-print (ie pre-refereeing)] PDF (This is a RoMEO yellow publisher -- author can archive pre-print (ie pre-refereeing))
Robust_Enhancement_to_CW_Algorithm.pdf
Restricted to Registered users only

Download (310kB) | Request a copy

Abstract

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
Divisions: Faculty of Engineering and Natural Sciences
Depositing User: Bülent Çatay
Date Deposited: 10 Nov 2009 11:22
Last Modified: 26 Apr 2022 08:31
URI: https://research.sabanciuniv.edu/id/eprint/12597

Available Versions of this Item

Actions (login required)

View Item
View Item