为保证产品质量和生产稳定性, 供应链中的核心制造企业同时为自有生产车间和外部代加工企业提供原材料, 并需要及时准确地将其所需原材料送至相应的线边超市, 这增加了制造企业的运营压力和物流成本. 为降低制造企业生产物流成本并提高需求响应速度, 本文对制造企业多个仓库的物料品类选择策略进行了研究. 文中考虑仓库存储条件、仓库容量等条件限制, 建立了以最小化运输成本为目标的混合整数规划模型, 设计了基于最小增量成本的贪婪算法, 实现仓库在物料品类和数量两个层次的选品决策. 与随机选品算法和环形算法相比, 该算法可以更有效地将物料分配到合适的仓库中, 降低运输成本和拆单率. 此外, 通过与实际案例中企业仓库选品现状比较, 由该算法得到的选品策略可节约53. 03%的运输成本, 并减少21. 47%的拆单率. 理论分析和实例分析均表明本文方法能够有效降低运输成本和拆单率, 从而提高企业利润和运营效率.
Abstract
To ensure product quality and production stability, the core manufacturing enterprises in the supply chain provide raw materials to both their own production workshops and external processing enterprises at the same time. Manufacturing enterprises need to deliver the raw materials required to the corresponding line-sidematerial warehouses in a timely and accurate manner, which increases their operational pressure and logistics costs. In order to reduce the production logistics cost and improve demand response speed, this paper studies the material allocation strategy among multiple warehouses in manufacturing. Considering the constraints such as the warehouse facility condition and capacity limit, we establish a mixed-integer programming model with the objective of minimizing the transportation cost and design a corresponding heuristic algorithm called greedy algorithm based on minimum incremental cost, which determines the category and quantity of materials to be stored in the warehouses. compared with the random allocation algorithm and loop algorithm, the algorithm we proposed can allocate materials to the appropriate warehouses more efficiently and reduce the transportation cost and order splitting rate. In addition, compared with the current situation of enterprise warehouse selection in real cases, the material allocation strategy obtained by the algorithm in this paper can save 53.03% of the transportation cost and reduce the order splitting rate by 21.47%. Both theoretical analysis and case analysis show that the method proposed in this paper can effectively reduce the transportation cost and order splitting rate, thereby improving the net profit and operation efficiency of the company.
关键词
生产物流 /
选品优化 /
贪婪算法 /
拆单率
{{custom_keyword}} /
Key words
production logistics /
assortment optimization /
greedy algorithm /
order splitting rate
{{custom_keyword}} /
{{custom_sec.title}}
{{custom_sec.title}}
{{custom_sec.content}}
参考文献
[1] 董宏达, 任玲, 王科. 生产企业物流[M]. 3版. 北京:清华大学出版社, 2021.Dong H D, Ren L, Wang K. Manufacturing enterprise logistics[M]. 3nd ed. Beijing:Tsinghua University Press, 2021.
[2] 孙林辉, 吕莹, 张伟, 等. 汽车零部件生产物流中物料上线方式选择研究[J]. 包装工程, 2019, 40(9):127-134.Sun L H, Lü Y, Zhang W, et al. Research on the selection of material online mode in automobile parts production logistics[J]. Packing Engineering, 2019, 40(9):127-134.
[3] Sridharan R. The capacitated plant location problem[J]. European Journal of Operational Research, 1995, 87(2):203-213.
[4] 熊浩, 鄢慧丽. 考虑多种安全库存策略的选址-库存问题研究[J]. 中国管理科学, 2021, 29(1):72-81.Xiong H, Yan H L. Six Location-inventory models with risk pooling in two-echelon logistics system[J]. Chinese Journal of Management Science, 2021, 29(1):72-81.
[5] Xu P J, Allgor R, Graves S C. Benefits of reevaluating real-time order fulfillment decisions[J]. Manufacturing & Service Operations Management, 2009, 11(2):340-355.
[6] Difrancesco R M, Van Schilt I M, Winkenbach M. Optimal in-store fulfillment policies for online orders in an omni-channel retail environment[J]. European Journal of Operational Research, 2021, 293(3):1058-1076.
[7] Chen N, Kang W, Kang N, et al. Order processing task allocation and scheduling for e-order fulfilment[J]. International Journal of Production Research, 2022, 60(13):4253-4267.
[8] 孙丽君, 周雅娴, 滕玥, 等. 多车舱车辆路径问题的研究现状与发展[J]. 系统工程理论与实践, 2021, 41(6):1535-1546.Sun L J, Zhou Y X, Teng Y, et al. Muti-compartment vehicle routing problem:Status and perspectives[J]. Systems Engineering—Theory & Practice, 2021, 41(6):1535-1546.
[9] 周鲜成, 周开军, 王莉, 等. 物流配送中的绿色车辆路径模型与求解算法研究综述[J]. 系统工程理论与实践, 2021, 41(1):213-230.Zhou X C, Zhou K J, Wang L, et al. Review of green vehicle routing model and its algorithm in logistics distribution[J]. Systems Engineering—Theory & Practice, 2021, 41(1):213-230.
[10] 张源凯, 黄敏芳, 胡祥培. 网上超市订单分配与物流配送联合优化方法[J]. 系统工程学报, 2015, 30(2):251-258.Zhang Y K, Huang M F, Hu X P. Integrated optimization approach to order allocation and delivery problem of online supermarket[J]. Journal of Systems Engineering, 2015, 30(2):251-258.
[11] 李娅, 王旭坪, 林娜, 等. 村镇农产品多类型预冷设施选址-路径优化模型及算法[J]. 系统工程理论与实践, 2022, 42(11):3016-3029.Li Y, Wang X P, Lin N, et al. The location-routing optimization model and algorithm of multi-type precooling facilities for agricultural products[J]. Systems Engineering—Theory & Practice, 2022, 42(11):3016-3029.
[12] Zhu S, Hu X P, Huang K, et al. Optimization of product category allocation in multiple warehouses minimize splitting of online supermarket customer orders[J]. European Journal of Operational Research, 2021, 290(2):556-571.
[13] Chen A I, Graves S C. Item aggregation and column generation for online-retail inventory placement[J]. Manufacturing & Service Operations Management, 2020, 23(5):1005-1331.
[14] Wang Z, Xu W, Hu X P, et al. Inventory allocation to robotic mobile-rack and picker-to-part warehouses at minimum order-splitting and replenishment costs[J]. Annals of Operations Research, 2022, 316(1):467-491.
[15] 李建斌, 李乐乐, 黄日环. 最小化拆单率的在线零售商多仓商品摆放优化策略研究[J]. 管理工程学报, 2017, 31(3):167-173.Li J B, Li L L, Huang R H. Inventory allocation policy to distribution centers with minimum split orders in online retailing[J]. Journal of Industrial Engineering and Engineering Management, 2017, 31(3):167-173.
[16] Catalán A, Fisher M L. Assortment allocation to distribution centers to minimize split customer orders[D]. Philadelphia:Wharton School of University of Pennsylvania, 2012.
[17] 张源凯, 胡祥培, 黄敏芳,等. 网上超市拆分订单合并打包策略经济决策模型[J]. 管理科学学报, 2019, 22(10):24-36.Zhang Y K, Hu X P, Huang M F, et al. Economic decision model for package consolidation in fulfilling split orders of online supermarkets[J]. Journal of Management Sciences in China, 2019, 22(10):24-36.
[18] Zhang Y K, Huang M F, Hu X P, et al. Package consolidation approach to the split-order fulfillment problem of online supermarkets[J]. Journal of the Operational Research Society, 2018, 69(1):127-141.
[19] 黄敏芳, 李鲁迪, 胡祥培. 大型网上超市拆分订单基于分拨中心的合并配送时空网络优化方法[J]. 管理工程学报, 2021(35):1-10.Huang M F, Li L D, Hu X P. Time-space network optimization method for split order consolidation on sorting center of large-scale online supermarket[J]. Journal of Industrial Engineering and Engineering Management, 2021(35):1-10.
[20] Zhang Y K, Sun L J, Hu X P, et al. Order consolidation for the last-mile split delivery in online retailing[J]. Transportation Research Part E:Logistics and Transportation Review, 2019, 122:309-327.
[21] Zhang Y K, Lin W H, Huang M F, et al. Multi-warehouse package consolidation for split orders in online retailing[J]. European Journal of Operational Research, 2021, 289(3):1040-1055.
{{custom_fnGroup.title_cn}}
脚注
{{custom_fn.content}}
基金
国家自然科学基金(71831007,72101192);华中科技大学人文社科培育项目(数智化决策优化创新团队,2021WKFZZX008);湖北省教育厅人文社科一般项目(20Q066)
{{custom_fund}}