期刊文献+

基于订单拆分的线上到线下连锁门店配送优化模型 被引量:5

An Optimization Model for O2O Chain Stores Distribution Based on Order Splitting
下载PDF
导出
摘要 针对零售企业线上到线下(Online To Offline, O2O)转型下连锁门店订单分配和配送问题,考虑门店商品种类、库存容量及客户退货等因素,提出只按商品种类而非数量进行拆分的订单拆分策略.以配送总费用最小为目标,构建基于订单拆分的O2O门店配送优化模型;设计包含线上订单就近分配和改进禁忌搜索的两阶段启发式求解算法,采用标准算例库中数据验证模型和方法的适用性和有效性.结果表明:与不拆分订单方法相比,订单拆分能够提高客户订单履约率,各门店商品总库存量不小于客户订单总需求量时,客户订单履约率达到100%. This paper studied the problems of order allocation and logistics distribution in chain stores of retail enterprises under the O2 O transformation background. Considering the factors such as the possession of various types of commodities of chain store and its inventory capacity, customer returns, an order splitting strategy that only allows the segmentation of commodity types and does not split the quantity was put forward. Based on the order splitting strategy, an O2 O chain store distribution optimization model was established with the goal of minimizing the total distribution cost. A two-stage heuristic algorithm was designed based on the nearest order assignment and improved tabu search. The applicability and effectiveness of the proposed model and algorithm are tested on benchmark instances. Experimental results show that the fulfillment rate of customer orders could be increased significantly by splitting customer orders. Moreover, as long as the total inventory of goods in each store is not less than the total demand of customer orders, a customer order fulfillment rate of 100% can be achieved.
作者 辛禹辰 施胜男 杨华龙 XIN Yu-chen;SHI Sheng-nan;YANG Hua-long(School of Transportation Engineering,Dalian Maritime University,Dalian 116026,Liaoning,China)
出处 《交通运输系统工程与信息》 EI CSCD 北大核心 2020年第5期212-217,共6页 Journal of Transportation Systems Engineering and Information Technology
基金 国家自然科学基金(72071024,71871036)。
关键词 物流工程 O2O 订单拆分 连锁门店 配送优化模型 logistics engineering O2O order splitting chain stores distribution optimization model
  • 相关文献

参考文献7

二级参考文献63

  • 1郎茂祥.多配送中心车辆调度问题的模型与算法研究[J].交通运输系统工程与信息,2006,6(5):65-69. 被引量:35
  • 2刘致良.我国快餐连锁企业配送中心建设思路[J].特区经济,2006(10):226-227. 被引量:3
  • 3李敏,郭强,刘红丽.多车场多配送中心的物流配送问题研究[J].计算机工程与应用,2007,43(8):202-204. 被引量:15
  • 4Polacek M R, Hartl R F, Doerner K, et al. A variable neighborhood search for the multi depot vehicle routing problem with time windows[J]. Journal of Heuristics, 2004, 10(6): 613-627.
  • 5Cordeau J F, Laporte G, Mercier A. A unified tabu search heuristic for vehicle routing problems with time windows[J]. Journal of the Operational Research Society, 2001, 52(8): 928-936.
  • 6Cordeau J F, Laporte G, Mercier A. An improved tabu search algorithm for the handling of route duration constraints in vehicle routing problems with time windows[J]. Journal of the Operational Research Society, 2004, 55(5): 542 -546.
  • 7Renaud J, Laporte G, Boctor F F. A tabu search heuristic for the multi-depot vehicle routing problem[J]. Computers and Operations Research, 1996, 23(3): 229-235.
  • 8Cordeau J F, Gendreau M, Laporte G. A tabu search heuristic for periodic and multi-depot vehicle routing problems[J]. Networks, 1997, 30: 105-119.
  • 9Chao M I, Golden B L, Wasil E A. A new heuristic for the multi-depot vehicle routing problem that improves upon best-known solutions[J]. Am J Math Mgmt Sci, 1993, 13:371 -406.
  • 10Christofides N, Eilon S. An algorithm for one vehicle-dispatching problem[J]. Opl Res Q, 1969, 20:309- 318.

共引文献123

同被引文献34

引证文献5

二级引证文献4

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部