A hybrid adaptive large neighbourhood search algorithm for the capacitated location routing problem

Abstract

This paper proposes a new hybrid metaheuristic algorithm that is composed of the adaptive large neighbourhood search (ALNS) and the variable neighbourhood search (VNS) algorithms to tackle the location routing problem (LRP) with capacity constraints. The rationale of the proposed hybrid metaheuristic algorithm is to enhance the performance of the ALNS algorithm by incorporating the VNS algorithm as an elitist local search. Therefore, the diversification and intensification strategies of the proposed hybrid metaheuristic algorithm are realized via the ALNS and VNS algorithms, respectively. The performance evaluation tests of the proposed hybrid metaheuristic algorithm are performed on the three classical LRP benchmark sets taken from the related literature, and the obtained results are compared against some of the formerly proposed and published methods in terms of solution quality. Computational results indicate that the proposed hybrid metaheuristic algorithm has a satisfactory performance in solving the LRP instances and is a competitive algorithm.