This paper introduces a mixed integer programming model for the two-echelon production routing problem with cross-docking satellites. This problem is important in e-commerce, home delivery services, and city logistics. To solve this problem, we propose a branch-and-cut algorithm with proved valid inequalities and a matheuristic that can provide feasible initial solutions. Extensive computational results are reported, which are obtained on instances derived from benchmarks for the production routing problems and two echelon vehicle routing problems. Management insights on dynamic balance among handling costs, inventory costs, and routing costs are also drawn from the sensitivity analysis.

本文介绍了一种带有交叉对接卫星的两级生产路径问题的混合整数规划模型。这个问题在电子商务，送货上门服务和城市物流中很重要。为了解决这个问题，我们提出了一种具有证明的有效不等式和能够提供可行的初始解的数学方法的分支割算法。报告了广泛的计算结果，这些计算结果是从针对生产路线问题和两个梯队车辆路线问题的基准得出的实例中获得的。管理层还从敏感性分析中获得了有关处理成本，库存成本和路由成本之间动态平衡的见解。