-
摘要: 为进一步降低日益复杂的物流配送成本, 通过对物流配送网络系统分析, 提出更为接近实际的三层次物流配送网络结构。针对第二层次车辆路线问题(VRP)网络模型, 运用四叉树原理进行客户分区, 使用两阶段启发式算法优化车辆行驶路线, 采用C语言编程实现了算法设计。运用模拟数据通过LINGO程序仿真测试, 显示该算法计算结果与LINGO计算结果相同, 而计算时间大幅度降低, 说明了该算法快速、有效。Abstract: In order to reduce the complex network distribution system was presented network distribution systems. In view of th costs of logistics distribution, three steps oglstics after analyzing the properties of present logistics e second step VRP network model, customers were divided into different regions by quadtree principle, VRP was optimized by the saving and 2-opt methods of heuristics algorithms. The design of algorithms was realized by C program. The computation results of C program and LINGO program are same by simulative test, and the running time of the algorithms is less than the one by LINGO program, which proves that the algorithms are high-efficiency and feasible. 3 tabs, 9 figs, 8 refs.
-
表 1 各城市需求点与需求量
Table 1. Demand of city customers
需求点(城市配送中心) 1 2 3 4 5 6 7 8 需求量 110 80 110 66 66 66 66 66 
下载: 导出CSV
表 2 各配送中心的距离
Table 2. Distances of distribution centers
0 1 2 3 4 5 6 7 8 0 0 625 860 1 160 415 360 400 280 620 1 0 280 500 985 800 1 020 865 1 165 2 0 230 1 170 1 070 1 255 1 120 1 425 3 0 1 325 1 290 1 455 1 310 1 650 4 0 655 340 390 690 5 0 420 270 365 6 0 170 355 7 0 260 8 0
下载: 导出CSV
表 3 配送分区结果与优化解
Table 3. Division result and optimum solution
车辆载质量为250，总需求量为630，分3个区 各分区巡回线路的优化解 分区号 分区总需求量 分区内的需求点(城市配送中心) 巡回路径 1 190 2.3 0-2-3-0 2 242 1，4，6 0-1-4-6-0 3 198 7，8，5 0-7-8-5-0
下载: 导出CSV
-
[1] Paolo T, Daniele V. Models relaxations and exact approaches for the capacitated vehicle routing problem[J]. Discrete Applied Mathematics, 2002, 123(1-3): 487-512. doi: 10.1016/S0166-218X(01)00351-1 [2] 赵建有, 闫旺, 胡大伟. 配送网络规划蚁群算法[J]. 交通运输工程学报, 2004, 4(3): 79-81. http://transport.chd.edu.cn/article/id/200403018Zhao Jian-you, Yan Wang, Hu Da-wei. Ant colony algorithm of dist"bution network planning[J]. Journal of Traffic and Transportation Engineering, 2004, 4(3): 79-81. (in Chinese) http://transport.chd.edu.cn/article/id/200403018 [3] 张潜, 高立群, 胡祥培. 集成化物流中的定位配给问题的启发式算法[J]. 东北大学学报: 自然科学版, 2004, 25(7): 637-640. doi: 10.3321/j.issn:1005-3026.2004.07.007Zhang Qian, Gao Li-qun, Hu Xiang-pei. Heuristic algorithm for location-allocation problem in integrated distribution[J]. JournaI of Northeastern University: Natural Science, 2004, 25(7): 637-640. (in Chinese) doi: 10.3321/j.issn:1005-3026.2004.07.007 [4] 丁浩, 李电生. 城市物流配送中心选址方法的研究[J]. 华中科技大学学报: 城市科学版, 2004, 21(1): 50-54. https://www.cnki.com.cn/Article/CJFDTOTAL-WHCJ200401013.htmDing Hao, Li Dian-sheng. Study of the site selection method of city distribution center[J]. Journal of HUST University: Urban Science Edition, 2004, 21(1): 50-54. (in Chinese) https://www.cnki.com.cn/Article/CJFDTOTAL-WHCJ200401013.htm [5] Wu Tai-his, Low C, Bai Jiunn-wei. Heu ristic solutions to multi-depot location-routing problems[j]. Computers and Operation Research, 2002, 29: 1 393-1 415. doi: 10.1016/S0305-0548(01)00038-7 [6] 张波, 叶家玮, 胡郁葱. 模拟退火算法在路径优化问题中的应用[J]. 中国公路学报, 2004, 17(1): 79-81. https://www.cnki.com.cn/Article/CJFDTOTAL-ZGGL200401019.htmZhang Bo, Ye Jia-wei, Hu Yu-cong. Application of optimizing the path by simulated annealing[J]. China Journal of Highway and Transport, 2004, 17(1): 79-81. (in Chinese) https://www.cnki.com.cn/Article/CJFDTOTAL-ZGGL200401019.htm [7] Min H, Jayaraman V, Srivastava R. Combined location-routing problem: a systhesis and future research directions[J]. European Journal of Operation Research, 1998, 108: 1-15. doi: 10.1016/S0377-2217(97)00172-0 [8] 胡大伟, 宣登殿. 公路快速客运网络系统规划方法[J]. 长安大学学报: 自然科学版, 2004, 24(2): 83-86. https://www.cnki.com.cn/Article/CJFDTOTAL-XAGL200402020.htmHu Da-wei, Xuan Deng-dian. Plannling method of highway express traveler network system[J]. Journal of Chang'an University: Natural Science Edition, 2004, 24(2): 83-86. (in Chinese) https://www.cnki.com.cn/Article/CJFDTOTAL-XAGL200402020.htm -
点击查看大图
图(9) / 表(3)
计量
- 文章访问数: 417
- HTML全文浏览量: 159
- PDF下载量: 1227
- 被引次数: 0
