This paper studies a multi-customer joint replenishment problem with districting consideration (MJRPDC) which is of particular importance to a company that outsources its transportation and delivery operations to a third-party logistics (3PL) service provider. To solve the problem, we first propose an innovative search algorithm for solving the traditional multi-customer joint replenishment problem in a given zone. Then we design a GA-based framework to handle the corresponding districting problem based on the performance of each district evaluated by using the proposed search algorithm. The proposed methodologies are demonstrated by using an example of solving MJRPDC for a bank.

本文研究了一个具有区域考虑因素的多客户联合补货问题（MJRPDC），这对于将运输和交付业务外包给第三方物流（3PL）服务提供商的公司尤为重要。为了解决该问题，我们首先提出一种创新的搜索算法，用于解决给定区域中传统的多客户联合补货问题。然后，基于使用建议的搜索算法评估的每个地区的性能，我们设计了一个基于GA的框架来处理相应的地区问题。通过为银行解决MJRPDC的示例演示了所提出的方法。