-
摘要: 为了确定最佳的配送时间点, 利用p-中位模型, 研究单配送目标物流配送的时间点决策问题, 建立了最少配送次数、最短配送时间和运费有折扣情况下最低运输成本的数学模型, 并以航空货物配送为例, 利用ILOG优化软件分别计算了3种模型的配送时间点。计算结果表明: 实现最少配送次数需要的平均配送时间是最短平均配送时间的1.6倍, 在运费有折扣情况下实现最低运输成本所需配送时间比没有折扣情况下的略长; 货主或者物流服务商可以根据客户要求选择相应的模型, 确定配送时间点, 实现最优决策。Abstract: In order to decide the best delivery time points, three cases of single delivery target were studied by using p-median model, the mathematical models of least delivery times, minimum delivery time and minimum transportation cost under the condition of freight discount were build, and taking air cargo transportation as a case, their delivery time points were calculated by using ILOG optimization software.Analysis result shows that the average delivery time of least delivery times is 1.6 times higher than the average minimum delivery time, and the delivery time of realizing minimum transportation cost under the condition of freight discount is longer than that without freight discount.So consignors or logistics service providers can choose the models to decide the best delivery time points according to customer requirements.
-
Key words:
- logistics delivery /
- p-median model /
- time points decision /
- cost optimization
-
表 1 运费与质量关系
Table 1. Relationship between freight and weight
运费 质量区间 c1 0≤w < W1 ck Wk-1≤w < Wk (2≤k≤q-1) cq w≥Wq-1 
下载: 导出CSV
表 2 航班到达时间
Table 2. Arriving times of flights
航班序号 1 2 3 4 5 6 7 8 9 到达时间 8:00 9:00 10:00 11:00 13:00 15:00 16:00 17:00 19:00
下载: 导出CSV
表 3 卡车运费
Table 3. Freights of truck
质量/kg 运费/ (元·kg-1) 质量/kg 运费/ (元·kg-1) 550 < w≤1 000 0.60 2 500 < w≤3 500 0.45 1 000 < w≤1 500 0.55 3 500 < w≤4 500 0.40 1 500 < w≤2 500 0.50 w > 4 500 0.35
下载: 导出CSV
表 4 最小配送次数
Table 4. Least delivery times
序号 最小配送次数 平均配送时间/min 配送时间点 1 4 350.0 12:45、15:45、18:45、21:15 2 4 344.0 12:30、15:30、18:30、21:15 3 4 359.0 12:30、14:45、17:30、21:00 4 4 329.0 12:15、15:15、18:15、21:15 平均 4 345.5
下载: 导出CSV
表 5 最短配送时间
Table 5. Minimum delivery times
序号 配送次数 平均配送时间/min 等待时间/min 1 7 220.00 25.00 2 8 210.00 15.00 3 8 212.00 17.00 4 9 205.00 10.00 平均 8 211.75 16.75
下载: 导出CSV
表 6 最低运输成本
Table 6. Minimum transportation cost
序号 最低成本/元 平均配送时间/min 配送时间点 1 2 557 355.0 12:45、15:45、18:45、21:30 2 2 867 350.0 12:30、15:45、18:30、21:15 3 2 543 359.0 12:45、14:30、17:30、21:00 4 2 921 331.0 12:15、15:15、18:15、21:15 平均 2 722 348.5
下载: 导出CSV
-
[1] CHEUNG R K M, POWELL W B. Models and algorithms for distribution problems with uncertain demands[J]. Trans-portation Science, 1996, 30 (1): 43-59. doi: 10.1287/trsc.30.1.43 [2] VROBLEFSKI M, RAMESHR, ZIONTS S. Efficient lot-sizing under a differential transportation cost structure for serially distributed warehouses[J]. European Journal of Operational Research, 2000, 127 (3): 574-593. doi: 10.1016/S0377-2217(99)00342-2 [3] 李昆鹏, 马士华. 基于JIT配送的3PL运输协调调度问题建模与分析[J]. 中国管理科学, 2008, 16 (1): 73-79. doi: 10.3321/j.issn:1003-207X.2008.01.012LI Kun-peng, MA Shi-hua. Modeling and analysis of synchronized 3PL transportation scheduling problemincontext of JIT delivery[J]. Chinese Journa1of Management Science, 2008, 16 (1): 73-79. (in Chinese) doi: 10.3321/j.issn:1003-207X.2008.01.012 [4] 赵秋红, 高洋, 郗蒙浩. 准时配送与分销中心的设置决策[J]. 管理评论, 2007, 19 (5): 47-50, 39. doi: 10.3969/j.issn.1008-3448.2007.05.007ZHAO Qiu-hong, GAO Yang, XI Meng-hao. Analysis on the relation of JITdelivery and DC s setting[J]. Management Review, 2007, 19 (5): 47-50, 39. (in Chinese) doi: 10.3969/j.issn.1008-3448.2007.05.007 [5] 韩庆兰, 梅运先. 基于BP人工神经网络的物流配送中心选址决策[J]. 中国软科学, 2004 (6): 140-143. doi: 10.3969/j.issn.1002-9753.2004.06.028HAN Qing-lan, MEI Yun-xian. Distribution center: BP artificial neural network based site selection[J]. China Soft Science, 2004 (6): 140-143. (in Chinese) doi: 10.3969/j.issn.1002-9753.2004.06.028 [6] LEUNG S C H, WU Y, LAI K K. A robust optimization model for a cross-border logistics problem with fleet composition in an uncertain environment[J]. Mathematical and Computer Modelling, 2002, 36 (11/12/13): 1221-1234. [7] GEN M, SYARIF A. Hybrid genetic algorithm for multi-time period production/distribution planning[J]. Computers and Industrial Engineering, 2005, 48 (4): 799-809. doi: 10.1016/j.cie.2004.12.012 [8] HAUGHTON M A, STENGER AJ. Comparing strategies for addressing delivery shortages in stochastic demand settings[J]. Transportation Research Part E: Logistics and Transporta-tion Review, 1999, 35 (1): 25-41. doi: 10.1016/S1366-5545(98)00021-0 [9] GEUNES J, ZENG A Z. Impacts of inventory shortage policies on transportation requirements in two-stage distribution systems[J]. European Journal of Operational Research, 2001, 129 (2): 299-310. doi: 10.1016/S0377-2217(00)00227-7 [10] 王平, 唐喜平, 李云. 一类多源点物流配送优化模型的探讨[J]. 系统工程理论与实践, 2003, 23 (3): 87-91. doi: 10.3321/j.issn:1000-6788.2003.03.016WANG Ping, TANG Xi-ping, LI Yun. Approach for a multi-source logistics delivery optimum model[J]. Systems Engineering-theory and Practice, 2003, 23 (3): 87-91. (in Chinese) doi: 10.3321/j.issn:1000-6788.2003.03.016 [11] GEUNES J, SHEN Z J M, EMIR A. Planning and approximation models for delivery route based services with price-sensitive demands[J]. European Journal of Operational Research, 2007, 183 (1): 460-471. doi: 10.1016/j.ejor.2006.07.010 [12] THANGI AH S R, FERGANY A, AWAN S. Real-time split-delivery pickup and delivery time windowproblems with transfers[J]. Central European Journal of Operations Research, 2007, 15 (4): 329-349. doi: 10.1007/s10100-007-0035-x [13] MAZDEH M M, SARHADI M, HINDI K S. A branch-and-bound algorithm for single-machine scheduling with batch delivery minimizingflowtimes and delivery costs[J]. European Journal of Operational Research, 2007, 183 (1): 74-86. [14] 郎茂祥, 胡思继. 用混合遗传算法求解物流配送路径优化问题的研究[J]. 中国管理科学, 2002, 10 (5): 51-56. doi: 10.3321/j.issn:1003-207X.2002.05.011LANG Mao-xiang, HU Si-ji. Study on the optimization of physical distribution routing problem by using hybrid genetic algorithm[J]. Chinese Journal of Management Science, 2002, 10 (5): 51-56. (in Chinese) doi: 10.3321/j.issn:1003-207X.2002.05.011 [15] 张潜, 高立群, 胡祥培, 等. 物流配送路径多目标优化的聚类-改进遗传算法[J]. 控制与决策, 2003, 18 (4): 418-422. doi: 10.3321/j.issn:1001-0920.2003.04.007ZHANG Qian, GAO Li-qun, HU Xiang-pei, et al. Research on multi-objective vehicle routing problem of optimization based on clustering analysis and improved genetic algorithm[J]. Control and Decision, 2003, 18 (4): 418-422. (in Chinese) doi: 10.3321/j.issn:1001-0920.2003.04.007 [16] 戴树贵, 潘荫荣, 胡幼华. 基于最小费用的物流配送模型及其混合单亲遗传算法[J]. 计算机应用, 2005, 25 (11): 2681-2684. https://www.cnki.com.cn/Article/CJFDTOTAL-JSJY200511071.htmDAI Shu-gui, PAN Yin-rong, HU You-hua. A logistics delivery model based ontheleast cost andits hybrid partheno-genetic algorithm[J]. Computer Applications, 2005, 25 (11): 2681-2684. (in Chinese) https://www.cnki.com.cn/Article/CJFDTOTAL-JSJY200511071.htm [17] PATEL M H, DESSOUKY Y, SOLANKI S, et al. Air cargo pickup schedule for single delivery location[J]. Computers and Industrial Engineering, 2006, 51 (3): 553-565. -
点击查看大图
表(6)
计量
- 文章访问数: 444
- HTML全文浏览量: 109
- PDF下载量: 274
- 被引次数: 0
