Abstract Multi-depot routing problems mainly arise in distribution logistics where a fleet of vehicles are used to serve clients from a number of (potential) depots. The problem concerns deciding on the routes of each vehicle and the depots from which the vehicles depart, so as to minimize the total cost of travel. This paper reviews a number of existing compact formulations, and proposes new ones, for two types of multi-depot routing problems, one that includes the depot selection decisions, and the other where depots are pre-selected. The formulations are compared theoretically in terms of the strength of their linear programming relaxation, and computationally in terms of the running time needed to solve the instances to optimality.

中文翻译：

---

多站点路由问题的紧凑公式：理论和计算比较

摘要 多仓库路由问题主要出现在配送物流中，其中车队用于为来自多个（潜在）仓库的客户提供服务。问题涉及决定每辆车的路线和车辆出发的站点，以最小化旅行的总成本。本文回顾了一些现有的紧凑公式，并针对两种类型的多站点路由问题提出了新的公式，一种包括站点选择决策，另一种是预先选择站点。从理论上比较这些公式的线性规划松弛强度，并根据将实例求解到最优所需的运行时间进行计算。