论文标题

供应链中的重中心问题的高级定量技术

Advanced Quantitative Techniques to Solve Center of Gravity Problem in Supply Chain

论文作者

Houck, Brian, Sampat, Chetan, Maiti, Srijit, S, Shivam, Vaishistha, Anurag, Banerjee, Sumit

论文摘要

涉及将原材料,各种资源和组件转换为最终产品的活动,并将其交付给最终客户,在选择仓库的位置时会产生巨大的成本,该仓库可以轻松地由供应链的各个参与者访问。为了最大程度地降低上游和下游运输成本,使用重心(COG)分析方法来找到给定需求网络的潜在仓库位置,这些仓库对整个供应链网络产生了影响。混合整数线性编程(MILP)是开发用于实现COG方法以及某些服务级别约束的开源工具,以找到成本最低的最佳潜在位置。在本文中,已经设计了一种优化工具,该工具是为远期物流网络设计的,该网络具有多种新颖的方法,例如客户位置选择(CLS),客户数据包以及其他业务启发式方法,可优化和增强现有的MILP,以获取具有低计算成本和运行时的最佳解决方案。最后,建议与现有网络相比,推荐一个替代设施网络,该网络可降低总体成本。还开发了用户界面来与模型进行用户友好的交互。我们可以得出结论,该模型可以大大帮助公司在物流网络设计期间降低成本。

Activities involving transformation of raw materials, various resources and components into final products and also delivering it to the end customer incur a significant cost during the selection of location of a warehouse that can be easily accessed by various actors of the supply chain. To minimize upstream and downstream transportation costs, the center of gravity (CoG) analysis method is used to find the potential warehouse locations for a given demand network which have an impact on the entire supply chain network. Mixed Integer Linear Programming (MILP), an open source tool is developed for implementing CoG method along with certain service level constraints to find optimal potential locations with the least cost. In this paper, an optimization tool has been designed for a forward logistics network with several novel methods like Customer Location Selection (CLS), Customer Packets along with other business heuristics that optimize and enhance the existing MILP to get the optimal solutions with low computational cost and runtime. Finally, recommending an alternative network of facilities which reduces overall costs compared to the existing network. An user interface has also been developed to make a user friendly interaction with the model. We can conclude that this model can significantly help companies reduce costs during the logistics network design.

扫码加入交流群

加入微信交流群

微信交流群二维码

扫码加入学术交流群,获取更多资源