6533b7ddfe1ef96bd1273d09

RESEARCH PRODUCT

Large multiple neighborhood search for the soft-clustered vehicle-routing problem

subject

description

Abstract The soft-clustered vehicle-routing problem (SoftCluVRP) is a variant of the classical capacitated vehicle-routing problem. Customers are partitioned into clusters and all customers of the same cluster must be served by the same vehicle. In this paper, we present a large multiple neighborhood search for the SoftCluVRP. We design and analyze multiple cluster destroy and repair operators as well as two post-optimization components, which are both based on variable neighborhood descent. The first allows inter-route exchanges of complete clusters, while the second searches for intra-route improvements by combining classical neighborhoods (2-opt, Or-opt, double-bridge) and the Balas-Simonetti neighborhood. Computational experiments show that our algorithm clearly outperforms the only existing heuristic approach from the literature. By solving benchmark instances, we provide 130 new best solutions for 220 medium-sized instances with up to 483 customers and prove 12 of them to be optimal. Furthermore, we describe a straightforward adaption of our algorithm to the clustered vehicle-routing problem, a variant of the SoftCluVRP.