An Effective Variable Neighborhood Search with Perturbation for Location-Routing Problem

Location-Routing Problem (LRP) is a challenging problem in logistics, which combines two types of decision: facility location and vehicle routing. In this paper, we focus on LRP with multiple capacitated depots and one uncapacitated vehicle per depot, which has practical applications such as mail delivery and waste collection. We propose a simple iterated variable neighborhood search with an effective perturbation strategy to solve the LRP variant. The experiments show that the algorithm is efficient and can compute better solutions than previous algorithms on tested instances.