In this paper, we model and solve a multi-depot inventory-routing problem with split-deliveries (MDIRPSD). The problem emerges under the vendor-managed inventory paradigm when deliveries are made from multiple depots, and the customers can be served several times in the same period. The MDIRPSD integrates supply and distribution decisions and has recently been proposed in the literature. We present a new mathematical formulation, taking into account inventory holding costs, and we also introduce a new inventory policy. We have designed and implemented a new branch-and-cut that overcome a similar approach from the literature. Finally, we report comparative results between the two inventory policies considered.

中文翻译：

---

解决分批交货的多仓库库存路由问题的分支切割算法


在本文中，我们建模并解决了分批交货的多仓库库存路由问题 (MDIRPSD)。当从多个仓库进行交货并且可以在同一时期内多次为客户提供服务时，在供应商管理的库存范例下就会出现问题。 MDIRPSD 整合了供应和分配决策，最近在文献中被提出。我们提出了一种新的数学公式，考虑了库存持有成本，并且还引入了新的库存政策。我们设计并实现了一种新的分支剪切法，克服了文献中的类似方法。最后，我们报告了所考虑的两种库存政策之间的比较结果。