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

交通运输系统工程与信息 ›› 2020, Vol. 20 ›› Issue (5): 212-217.

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

辛禹辰，施胜男，杨华龙^*

大连海事大学交通运输工程学院，辽宁大连 116026

收稿日期:2020-05-25 修回日期:2020-07-13 出版日期:2020-10-25 发布日期:2020-10-26
作者简介:辛禹辰(1988-)，男，山东烟台人，博士生.
基金资助:
国家自然科学基金/National Natural Science Foundation of China(72071024，71871036).

An Optimization Model for O2O Chain Stores Distribution Based on Order Splitting

XIN Yu-chen, SHI Sheng-nan, YANG Hua-long

School of Transportation Engineering, Dalian Maritime University, Dalian 116026, Liaoning, China

Received:2020-05-25 Revised:2020-07-13 Online:2020-10-25 Published:2020-10-26

摘要/Abstract

摘要：

针对零售企业线上到线下(Online To Offline, O2O)转型下连锁门店订单分配和配送问题，考虑门店商品种类、库存容量及客户退货等因素，提出只按商品种类而非数量进行拆分的订单拆分策略.以配送总费用最小为目标，构建基于订单拆分的O2O门店配送优化模型；设计包含线上订单就近分配和改进禁忌搜索的两阶段启发式求解算法，采用标准算例库中数据验证模型和方法的适用性和有效性.结果表明：与不拆分订单方法相比，订单拆分能够提高客户订单履约率，各门店商品总库存量不小于客户订单总需求量时，客户订单履约率达到100%.

关键词: 物流工程, O2O, 订单拆分, 连锁门店, 配送优化模型

Abstract:

This paper studied the problems of order allocation and logistics distribution in chain stores of retail enterprises under the O2O 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 O2O 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.

Key words: logistics engineering, O2O, order splitting, chain stores, distribution optimization model

中图分类号:

F721.7
F274

辛禹辰，施胜男，杨华龙. 基于订单拆分的线上到线下连锁门店配送优化模型[J]. 交通运输系统工程与信息, 2020, 20(5): 212-217.

XIN Yu-chen, SHI Sheng-nan, YANG Hua-long. An Optimization Model for O2O Chain Stores Distribution Based on Order Splitting[J]. Journal of Transportation Systems Engineering and Information Technology, 2020, 20(5): 212-217.

导出引用管理器 EndNote|Ris|BibTeX

链接本文: http://www.tseit.org.cn/CN/abstract/abstract20137.shtml

http://www.tseit.org.cn/CN/Y2020/V20/I5/212

参考文献

[1] 赵泉午, 赵军平, 林娅. O2O融合下的服装鞋类连锁经营企业城市配送问题[J]. 管理学报, 2017, 14(4): 617- 624. [ZHAO Q W, ZHAO J P, LIN Y. Urban distribution model for large chain clothing and footwear retailers under online- offline channel integration[J]. Journal of Management, 2017, 14(4): 617-624.]

[2] WANG Y, LEI L F, ZHANG D X, et al. Towards delivery- as- a- service: Effective neighborhood search strategies for integrated delivery optimization of Ecommerce and static O2O parcels[J]. Transportation Research Part B: Methodological, 2020, 139: 38-63.

[3] 钟金宏, 于晓飞, 刘敬霞. 连锁快餐企业的网上订单分配模型 [J]. 中国管理科学, 2016, 24(S1): 164- 169. [ZHONG J H, YU X F, LIU J X. Online order distribution model of fast food chain enterprises[J]. Chinese Journal of Management Science, 2016, 24(S1): 164-169.]

[4] ZHANG J, LIU F, TANG J F, et al. The online integrated order picking and delivery considering pickers' learning effects for an O2O community supermarket[J]. Transportation Research Part E: Logistics and Transportation Review, 2019, 123: 180-199.

[5] 陈萍, 李航. 基于时间满意度的O2O外卖配送路径优化问题研究[J]. 中国管理科学, 2016, 24(S1): 170- 176. [CHEN P, LI H. Optimization model and algorithm based on time satisfaction for O2O food delivery[J]. Chinese Journal of Management Science, 2016, 24(S1): 170-176.]

[6] 张源凯, 黄敏芳, 胡祥培. 网上超市订单分配与物流配送联合优化方法[J]. 系统工程学报, 2015, 30(2): 251- 258. [ZHANG Y K, HUANG M F, HU X P. Online order distribution model of fast food chain enterprises[J]. Journal of Systems Engineering, 2015, 30(2): 251-258.]

[7] 韩曙光, 章园园. 基于最小集合覆盖的电商订单拆分及配送方式[J]. 浙江理工大学学报(社会科学版), 2019, 42(6): 627- 636. [HAN S G, ZHANG Y Y. Ecommerce order splitting and distribution method based on minimal set covering problem[J]. Journal of Zhejiang University of Technology (Social Science Edition), 2019, 42(6): 627-636.]

[8] 于滨, 靳鹏欢, 杨忠振. 两阶段启发式算法求解带时间窗的多中心车辆路径问题[J]. 系统工程理论与实践, 2012, 32(8): 1793-1800. [YU B, JIN P H, YANG Z Z. Two- stage heuristic algorithm for multi- depot vehicle routing problem with time windows[J]. System Engineering: Theory & Practice, 2012, 32(8): 1793- 1800.]

[9] 赵亮, 梁晓萍, 杨华龙, 等. 客户配送要求变动下的 VRPSDP 干扰管理优化[J]. 交通运输系统工程与信息, 2018, 18(3): 218- 224. [ZHAO L, LIANG X P, YANG H L, et al. Disruption management model for VRPSDP with changes of customer request and time window[J]. Journal of Transportation Systems Engineering and Information Technology, 2018, 18(3): 218-224.]

[1]	张英贵, 姚璎华, 高全, 雷定猷. 铁路集装箱混合货物平衡装载布局优化模型与算法[J]. 交通运输系统工程与信息, 2022, 22(2): 214-222.
[2]	姜晓红, 陈莎, 张毅. 物流企业碳排放总量与效率测算方法[J]. 交通运输系统工程与信息, 2022, 22(2): 313-321.
[3]	周小祥, 黄承锋. 农村物流末端共配联盟演化博弈及稳定性研究[J]. 交通运输系统工程与信息, 2022, 22(1): 265-272.
[4]	王清斌, 于江宁, 郑建风. 甩挂运输模式下新增运输任务的干扰管理模型[J]. 交通运输系统工程与信息, 2021, 21(6): 160-166.
[5]	柳伍生, 李旺, 周清, 迭纤. “无人机-车辆”配送路径优化模型与算法[J]. 交通运输系统工程与信息, 2021, 21(6): 176-186.
[6]	珠兰, 马潇, 刘卓凡. 时间依赖型绿色车辆路径问题研究[J]. 交通运输系统工程与信息, 2021, 21(6): 187-194.
[7]	奇格奇, 张子贤, 卫振林, 李宝文. 基于语义挖掘的快递运输货品风险评价研究[J]. 交通运输系统工程与信息, 2021, 21(4): 248-255.
[8]	杨森炎，宁连举，商攀. 基于时空状态网络的电动物流车辆路径优化方法[J]. 交通运输系统工程与信息, 2021, 21(2): 196-204.
[9]	杨华龙，辛禹辰，高浩然. 随机扰动项呈离散分布的库存路径和定价问题的模型与算法[J]. 交通运输系统工程与信息, 2021, 21(2): 211-216.
[10]	于江霞，杜红亚，罗太波. 基于客户分类的即时配送路径优化研究[J]. 交通运输系统工程与信息, 2020, 20(4): 202-208.
[11]	刘杰，黎浩东，张萌. 基于点线能力约束的多层级节点协同布局优化模型及算法研究[J]. 交通运输系统工程与信息, 2020, 20(2): 107-113.
[12]	尹小庆，莫宇迪，董陈晨，林云. 考虑行程时间可靠性的城市冷链末端配送站选址研究[J]. 交通运输系统工程与信息, 2019, 19(6): 176-183.
[13]	曾庆成，马佳慧，张晓琳. 混合下单模式下在线餐饮订单配送优化模型[J]. 交通运输系统工程与信息, 2019, 19(6): 184-190.
[14]	燕晨屹，王喜富，员丽芬. 跨境供应链网络海外仓的鲁棒性选址模型及算法[J]. 交通运输系统工程与信息, 2019, 19(6): 191-198.
[15]	马冰山，胡大伟，陈希琼，胡卉. 半开放式的多配送中心纯电动车辆路径优化问题[J]. 交通运输系统工程与信息, 2019, 19(6): 199-205.