A multi-start heuristic approach for the split-delivery vehicle routing problem with minimum delivery amounts

Abstract

We propose a new multi-start solution approach for the split-delivery vehicle routing problem with minimum delivery amounts (SDVRP-MDA). Initial solutions are generated by both node-insertion and route-addition procedures with a single parameter to control the restart. These solutions are then improved by a variable neighborhood descent metaheuristic with a novel search operator inspired by node-ejection chains. We test the proposed approach with 32 benchmark instances for four different minimum delivery fractions. Using the proposed algorithm, out of 128 cases tested, we find 81 best known solutions and 34 new best solutions; overall, we find 43 new best solutions. (C) 2016 Elsevier Ltd. All rights reserved.