收稿日期: 2022-07-07
网络出版日期: 2022-09-26
基金资助
国家自然科学基金 (61472340, 61303017); 国家文化和旅游科技创新工程项目 (2020年度); 河北省重点研发项目 (21340301D); 河北省自然科学基金 (F2021210005); 河北省省级科技计划资助项目 (21550803D, 21310101D); 河北省教育厅青年拔尖项目 (BJ2021085); 河北省科技厅大中学生科技创新能力培育专项 (22E50118D); 中国国家铁路集团科研计划项目 (2020F026)
Capacitated route planning for supermarket distribution based on order splitting
Received date: 2022-07-07
Online published: 2022-09-26
潘晓 , 鹿冬娜 , 王书海 . 基于订单拆分的容量限制商超配送路径规划[J]. 华东师范大学学报(自然科学版), 2022 , 2022(5) : 147 -164 . DOI: 10.3969/j.issn.1000-5641.2022.05.013
Vehicle stowage and route planning are common problems for various delivery methods related to supermarket distribution. In order to resolve these problems, we propose capacitated route planning for supermarket order distribution based on order splitting. We construct the problem model with the goal of minimizing the total cost of delivery. Combined with real cases, an improved gray wolf optimization algorithm adding a genetic mutation operation is proposed. The effectiveness of the model and algorithm is verified by comparing performance with the genetic algorithm. The results show that when the total demand of supermarkets is close to an integer multiple of the vehicle capacity, our proposed planning approach is better. This is mainly reflected in the fact that the order splitting plan can make full use of vehicle capacity, reduce the empty driving rate for vehicles, and reduce the total distribution cost.
1 | 刘菲. 大型连锁商超纳税筹划浅议. 中国市场, 2019, (29): 158- 159. |
2 | 郑其明, 窦亚芹, 郑明轩. “新零售”背景下智慧物流治理策略探讨. 铁道运输与经济, 2020, 42 (4): 12- 17. |
3 | ARCHETTI C, BIANCHESSI N, SPERANZA M G. Branch-and-cut algorithms for the split delivery vehicle routing problem. European Journal of Operational Research, 2014, 238 (3): 685- 698. |
4 | DANTZIG G B, RAMSER J H. The truck dispatching problem. Management Science, 1959, 6 (1): 80- 91. |
5 | THANGIAH S R, POTVIN J Y, TONG S. Heuristic approaches to vehicle routing with backhauls and time windows. Computers and Operations Research, 1996, 23 (11): 1043- 1057. |
6 | 范厚明, 杨翔, 李荡, 等. 基于生鲜品多中心联合配送的半开放式车辆路径问题. 计算机集成制造系统, 2019, 25 (1): 256- 266. |
7 | 曾正洋, 许维胜, 徐志宇, 等. 应急物流中的累计时间式多车场车辆路径问题. 控制与决策, 2014, 29 (12): 2183- 2188. |
8 | 周鲜成, 刘长石, 周开军, 等. 时间依赖型绿色车辆路径模型及改进蚁群算法. 管理科学学报, 2019, 22 (5): 57- 68. |
9 | CHEN P, GOLDEN B, WANG X Y, et al. A novel approach to solve the split delivery vehicle routing problem [J]. International Transactions in Operational Research, 2017, 24(1/2): 27-41. |
10 | YANG F, DAI Y, MA Z J. A cooperative rich vehicle routing problem in the last-mile logistics industry in rural areas. Transportation Research Part E: Logistics and Transportation Review, 2020, 141, 102024. |
11 | 揭婉晨, 侍颖, 杨珺, 等. 需求可拆分电动汽车车辆路径问题及其改进分支定价算法研究. 管理学报, 2020, 17 (12): 1873- 1880. |
12 | 张亚明, 李艳明, 刘海鸥. 满意度约束多车型冷链物流VRP优化研究. 统计与决策, 2019, 35 (4): 176- 181. |
13 | XU H T, PU P, DUAN F. A hybrid ant colony optimization for dynamic multidepot vehicle routing problem. Discrete Dynamics in Nature and Society, 2018, 2018, 3624728. |
14 | 符卓, 刘文, 邱萌. 带软时间窗的需求依订单拆分车辆路径问题及其禁忌搜索算法. 中国管理科学, 2017, 25 (5): 78- 86. |
15 | SITEK P, WIKAREK J. Capacitated vehicle routing problem with pick-up and alternative delivery (CVRPPAD): Model and implementation using hybrid approach. Annals of Operations Research, 2019, 273, 257- 277. |
16 | 李阳, 范厚明. 求解带容量约束车辆路径问题的混合变邻域生物共栖搜索算法. 控制与决策, 2018, 33 (7): 1190- 1198. |
17 | G?KALP O, UGUR A. A multi-start ILS–RVND algorithm with adaptive solution acceptance for the CVRP. Soft Computing, 2020, 24 (4): 2941- 2953. |
18 | MIRJALILI S, MIRJALILI S M, LEWIS A. Grey wolf optimizer. Advances in Engineering Software, 2014, 69 (7): 46- 61. |
19 | 田青文. 空间测角网三维平差. 地球科学与环境学报, 1988, (3): 106- 114. |
/
〈 |
|
〉 |