Abstract The production routing problem (PRP) is a difficult optimization problem which arises in the planning of integrated supply chains. The purpose of solving the PRP is the simultaneous optimization of the production, inventory, distribution, and routing decisions, which typically appears in vendor managed inventory systems. In this study, the classical PRP is extended by considering transshipments, either from supplier to retailers or between retailers, to further reduce the total cost. A mathematical programming-based heuristic is proposed to solve the problem. The algorithm is applied to two sets of randomly generated problem instances. The computational results show that the proposed approach is effective in solving the problem. Moreover, we conduct extensive numerical experiments to analyze the impact of the transshipments on the overall system.

中文翻译：

---

一种基于数学规划的启发式中转生产路线问题

摘要 生产路径问题（PRP）是在集成供应链规划中出现的一个困难的优化问题。解决 PR​​P 的目的是同时优化生产、库存、分销和路由决策，这通常出现在供应商管理的库存系统中。在这项研究中，经典的 PRP 通过考虑从供应商到零售商或零售商之间的转运来扩展，以进一步降低总成本。提出了一种基于数学规划的启发式算法来解决该问题。该算法应用于两组随机生成的问题实例。计算结果表明，所提出的方法能够有效地解决该问题。而且，