A savings based method for real-life vehicle routing problems

This paper describes a Savings Based algorithm for the Extended Vehicle Routine Problem. This algorithm is compared with a sequential insertion algorithm on real-life data. Besides the traditional quality measures such as total distance travelled and total workload, we compare the routing plans of both algorithms according to non-standard quality measures that help to evaluate the ‘visual attractiveness’ of the plan. Computational results show that, in general, the savings based algorithm not only performs better with respect to these non-standard quality measures, but also with respect to the traditional measures.