期刊文献+

基于地铁的地上地下闭环物流配送路径优化 被引量:7

Distribution Routing Optimization of Ground-Underground Closed-Loop Logistics Based on Metro Network
下载PDF
导出
摘要 面对闭环物流需求增长与道路资源紧缺的不平衡问题,设计了基于地铁的地上地下配送模式,以运输成本,时间窗惩罚成本,碳排放成本,转运成本,固定成本和地铁货运运营成本的总成本最小为目标函数,构建基于地铁的地上地下闭环物流配送路径优化模型。基于半初始化子路径扰动策略改进了自适应遗传算法,并以南京市秦淮区为例进行分析。结果表明:相比于常规自适应遗传算法,改进的算法可以缩短49.14%的运算时间,且求解更高效、稳定;选取多编组的开行方式,并设置物流车厢容量和发车间隔分布为3 000件和5 min,可以降低4.6%的平均服务时间和3.8%的总成本,具有较好的送达时效性和经济性;相比传统物流模式,合理利用现有地铁线网的地上地下闭环物流配送方案可以降低57.5%的碳排放量、减少8.1%的平均配送时间,其配送模式可为未来城市物流与地铁的发展提供参考依据。 In order to alleviate the imbalance between the closed-loop logistics demand growth and the road resources limit, a ground-underground model based on metro network was designed, and a ground-underground closed-loop logistics distribution optimization model was constructed to minimize transportation time cost, time window penalty cost, carbon tax, transshipment cost, vehicle fixed cost and subway station freight operation cost.Based on the semi-initialized and sub-path disturbance strategy, the adaptive genetic algorithm was improved.The implementation effect was evaluated based on the Qinhuai District, Nanjing. The results show that firstly, the improved adaptive genetic algorithm can shorten the calculation time of 49.14%, and the solution is more efficient and stable. Secondly, setting multi-group metro operations, 3 000-piece carriage capacity and 5 min departure interval can effectively reduce the average service time by 4.6% and the total costs by 3.8%, yielding better delivery timeliness and economy. Finally, compared with the traditional logistics mode, the ground-underground closed-loop logistics distribution plan based on the existing metro network can reduce carbon emissions by 57.5%, average delivery time by 8.1% and the distribution model can provide reference for the future development of urban logistics and metro network.
作者 郑长江 陈宜恒 沈金星 Zheng Changjiang;Chen Yiheng;Shen Jinxing(College of Civil and Transportation Engineering,Hohai University,Nanjing 210098,China)
出处 《华东交通大学学报》 2022年第1期89-98,共10页 Journal of East China Jiaotong University
基金 国家自然科学基金项目(51808187) 中央高校基本科研业务费专项资金项目(B210202035)。
关键词 交通运输规划与管理 路径优化 改进自适应遗传算法 闭环物流 地上地下配送模式 transportation planning and management routing optimization improved adaptive genetic algorithm closed-loop logistics ground-underground intermodal distribution model
  • 相关文献

参考文献11

二级参考文献81

  • 1黄欧龙,陈志龙,郭东军.城市地下物流系统网络规划初探[J].物流技术与应用,2005,10(6):91-93. 被引量:8
  • 2蒋忠中,汪定伟.B2C电子商务中配送中心选址优化的模型与算法[J].控制与决策,2005,20(10):1125-1128. 被引量:43
  • 3胡大伟,陈诚.遗传算法(GA)和禁忌搜索算法(TS)在配送中心选址和路线问题中的应用[J].系统工程理论与实践,2007,27(9):171-176. 被引量:49
  • 4何波,杨超,张华.废弃物回收的多层逆向物流网络优化设计问题研究[J].中国管理科学,2007,15(3):61-67. 被引量:37
  • 5Gulczynski D, Golden B, Wasil E. The multi-depot split delivery vehicle routing problem: an integer programming- based heuristic, new test problems, and computational re- suits[ J]. Computers & Industrial Engineering, 2011, 61 (3) : 794 - 804.
  • 6Rahimi-Vahed A, Crainic T G, Gendreau M, et al. A path relinking algorithm for a multi-depot periodic vehicle routing problem[J]. Journal of Heuristics, 2013, 19(3): 497 - 524.
  • 7Ho W, Ho G T S, Ji P, et al. A hybrid genetic algorithm for the multi-depot vehicle routing problem[ J]. Engineer- ing Applications of Artificial Intelligence, 2008, 21 (4) : 548 - 557.
  • 8Tu W, Fang Z, Li Q, et al. A hi-level Voronoi diagram- based metaheuristic for a large-scale multi-depot vehicle routing problem[ J]. Transportation Research Part E: Lo- gistics and Transportation Review, 2014, 61:84 -97.
  • 9Yu B, Ma N, Cai W J, et al. Improved ant colony op- timisation for the dynamic multi-depot vehicle routing problem[ J]. International Journal of Logistics Research and Applications, 2013, 16(2) : 144 - 157.
  • 10Geetha S, Poonthalir G, Vanathi P T. Nested particle swarm optimisation for multi-depot vehicle routing prob- lem[ J]. International Journal of Operational Research, 2013, 16(3): 329-348.

共引文献208

同被引文献76

引证文献7

二级引证文献3

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部