Chinese Journal of Management Science ›› 2022, Vol. 30 ›› Issue (9): 195-205.doi: 10.16381/j.cnki.issn1003-207x.2020.0840
• Articles • Previous Articles Next Articles
LI Wen-li1, LI Kun-peng2, TIAN Qian-nan3, LI Xue-song4
Received:
2020-05-10
Revised:
2020-10-15
Online:
2022-09-20
Published:
2022-09-01
Contact:
田倩南
E-mail:1056686923@qq.com
CLC Number:
LI Wen-li, LI Kun-peng, TIAN Qian-nan, LI Xue-song. The Research on Retail Logistics Distribution Routing Optimization Considering Order Release Dates in Epidemic Outbreak Environment[J]. Chinese Journal of Management Science, 2022, 30(9): 195-205.
[1] 喜崇彬. 疫情后零售企业的物流变革思考[J].物流技术与应用, 2020, 25(3): 94-96.Xi Chongbin. Reflection on the retail logistics reform after the NCP epidemic[J].Logistics & Material Handling, 2020, 25(3): 94-96. [2] Shelbourne B, Battarra M, Potts C. The vehicle routing problem with release and due dates[J]. INFORMS Journal of Computing, 2017, 29 (4): 705-723. [3] Reyes D, Erera A L, Savelsbergh M W. Complexity of routing problems with release dates and deadlines[J]. European Journal of Operational Research, 2018, 266 (1): 29-34. [4] Archetti C, Feillet D, Speranza M G. Complexity of routing problems with release dates[J]. European Journal of Operational Research,2015,247(3): 797-803. [5] 方文婷,艾时钟,王晴,等. 基于混合蚁群算法的冷链物流配送路径优化研究[J].中国管理科学, 2019, 27(11): 107-115.Fang Wenting, Ai Shizhong, Wang Qing, et al. Research on cold chain logistics distribution path optimization based on hybrid ant colony algorithm[J]. ChineseJournal of Management Science,2019, 27(11): 107-115. [6] 刘明,李颖祖,曹杰,等. 突发疫情环境下基于服务水平的应急物流网络优化设计[J].中国管理科学, 2020, 28(3): 11-20.Liu Ming, Li Yingzu, Cai Jie, et al. An optimal design of emergency logistics network for epidemic controlling based on service level[J]. ChineseJournal of Management Science, 2020, 28(3): 11-20. [7] 徐小峰,孙玉萍.多枢纽轴辐式协同物流网络任务-路径优化匹配研究[J].中国管理科学, 2019, 27(9): 175-182.Liu Xiaofeng, Sun Yuping. Optimization of task-route matching based on multi-hub and spoke collaborative logistics network[J]. Chinese Journal of Management Science, 2019, 27(9): 175-182. [8] Arda Y, Crama Y, Kronus D, et al. Multi-period vehicle loading with stochastic release dates[J]. EURO Journal on Transportation and Logistics, 2014, 3(2):93-119. [9] Cattaruzza D, Absi N, Feillet D. The multi-trip vehicle routing problem with time windows and release dates[J]. Transportation Science, 2016, 50(2):676-693. [10] Archetti C, Feillet D, Mor A, et al. An iterated local search for the Traveling Salesman Problem with release dates and completion time minimization[J]. Computers and Operations Research, 2018, 98: 24-37. [11] Liu Ling, Li Kunpeng, Liu Zhixue. A capacitated vehicle routing problem with order available time in e-commerce industry[J]. Engineering Optimization, 2017, 49(3):449-465. [12] Li Wenli, Wu Yong, Ram-Kumar P N, et al. Multi-trip vehicle routing problem with order release dates[J]. Engineering Optimization, 2020, 52(8): 1279-1294. [13] Archetti C, Feillet D, Mor A, et al. Dynamic travelling salesman problem with stochastic release dates[J]. European Journal of Operations Research, 2020, 3: 832-844. [14] Zhen Lu, Ma ChengLe, Wang Kai, et al. Multi-depot multi-trip vehicle routing problem with time windows and release dates[J]. Transportation Research Part E, 2020, 135: 1-21. [15] Loureno H R, Martin O C, Stüzle T. Iterated local search: framework and applications[M]. 2nd ed. New York: International series in operations research and management science, 2010. [16] 徐东洋,李昆鹏, 崔利刚,等.供需未匹配的多车场多车型多货品可拆分取送货车辆路径问题[J]. 中国管理科学,2021, 29(1): 127-137.Xu Dongyang, Li Kunpeng, Cui Ligang, et al. Multi-commodity unpaired supply-demand and split pickup and delivery vehicle routing problem with multi-depot and multi-type trucks[J].Chinese Journal of Management Science,2021, 29(1): 127-137. [17] Prins C. A simple and effective evolutionary algorithm for the vehicle routing problem[J]. Computers & Operations Research, 2004, 31:1985-2002. [18] Li Kunpeng, Chen Bin, Sivakumar A I, et al. An inventory-routing problem with the objective of travel time minimization[J]. European Journal of Operational Research, 2014, 236(3): 936-945. [19] Guignard M, Kim S. Lagrangean decomposition: A model yielding stronger Lagrangian bounds[J]. Mathematical Programming, 1987, 39(2): 215-228. [20] Kohl N, Madsen O B G. An optimization algorithm for the vehicle routing problem with time windows based on lagrangian relaxation[J]. Operations Research, 1997, 45(3): 395-406. [21] Desrosiers J, Dumas Y, Solomon M M, et al. Time constrained routing and scheduling[J]. Handbooks in Operations Research and Management Science, 1995, 8:35-139. |
Viewed | ||||||
Full text |
|
|||||
Abstract |
|
|||||
|