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.

中文翻译：

---

一种有效的带扰动变量邻域搜索的位置路由问题

位置路由问题（LRP）是物流中的一个具有挑战性的问题，它结合了两种类型的决策：设施位置和车辆路线。在本文中，我们专注于具有多个载人仓库和每个仓库一辆不载人车辆的 LRP，其具有实际应用，例如邮件递送和废物收集。我们提出了一种简单的迭代变量邻域搜索，该搜索具有有效的扰动策略来解决 LRP 变体。实验表明，该算法是有效的，并且可以在测试实例上计算比以前的算法更好的解决方案。