用户名: 密码: 验证码:
考虑碳排放的生鲜农产品冷链物流配送路径优化研究
详细信息    查看全文 | 推荐本文 |
  • 英文篇名:Optimization Research of Cold Chain Distribution Routes Based on Carbon Emissions for Fresh Agricultural Products
  • 作者:邹建城 ; 路正南
  • 英文作者:ZOU Jiancheng;LU Zhengnan;Shool of Management, Jiangsu University;
  • 关键词:车辆路径问题 ; 碳排放 ; 冷链物流 ; 生鲜农产品 ; 多目标优化 ; 蚁群算法
  • 英文关键词:vehicle routing problem;;carbon emission;;cold chain logistics;;fresh agricultural products;;multi-objective optimization;;ant colony algorithm
  • 中文刊名:物流科技
  • 英文刊名:Logistics Sci-Tech
  • 机构:江苏大学管理学院;
  • 出版日期:2019-08-10
  • 出版单位:物流科技
  • 年:2019
  • 期:08
  • 基金:国家自然科学基金资助项目(71673120);; 教育部人文社会科学研究项目(16YJA630035)
  • 语种:中文;
  • 页:52-58
  • 页数:7
  • CN:10-1373/F
  • ISSN:1002-3100
  • 分类号:F326.6;F252;X322
摘要
针对当前日益严峻的环境问题,提出在冷链物流配送中考虑节能减排因素来降低碳排放量的策略,并以包括考虑碳排放成本在内的综合总成本最小和平均顾客满意度最大为目标函数,构建带有时间窗的生鲜农产品配送路径问题的多目标优化模型。采用改进蚁群算法对模型进行求解,通过算例验证了模型的有效性。通过算例将文章中的模型与传统VRP模型中以总里程最短为目标函数的路径优化结果进行比较,从而为生鲜农产品车辆配送路径优化决策提供参考。
        In view of the increasingly serious environmental problems, the research proposes a strategy to reduce carbon emissions by considering energy-saving and emission reduction factors in cold chain logistics distribution. And establishing a multi-objective optimization model for the distribution path of fresh agricultural products with time windows was constructed with the objective of minimizing the total total cost and the average customer satisfaction, including the consideration of carbon emission costs. The improved ant colony algorithm is used to solve the model. The validity of the model is verified by an example. The example of this paper is compared with the path optimization result of the traditional VRP model with the shortest total mileage as the objective function, which provides a reference for the optimization decision of fresh agricultural vehicle distribution route.
引文
[1] Dantzig G B, Ramser J H. The truck dispatching problem[J]. Management Science, 1959,6(1):80-91.
    [2]李锋,魏莹.易腐货物配送中时变车辆路径问题的优化算法[J].系统工程学报,2010,25(4):492-498.
    [3] Leung S C H, Zhang Z, Zhang D, et al. A meta-heuristic algorithm for heterogeneous fleet vehicle routing problems with two-dimensional loading constraints[J]. European Journal of Operational Research, 2013,225(2):199-210.
    [4] Tarantilis C D, Kiranoudis C T. Distribution of fresh meat[J]. Journal of Food Engineering, 2002,51(1):85-91.
    [5]王淑云,孙虹.随机需求下冷链品多温共配路径优化研究[J].工业工程与管理,2016,21(2):49-58.
    [6] Solomon M M, Desrosiers J. Time Window constraint routing and scheduling problems[J]. Transportation Science, 1988,22(1):1-13.
    [7]曹倩,邵举平,孙延安.基于改进遗传算法的生鲜农产品多目标配送路径优化[J].工业工程,2015,18(1):71-76.
    [8] Jabali O, Leus R, Van Woensel T, et al. Self-imposed time windows in vehicle routing problems[J]. OR Spectrum, 2015,37(2):331-352.
    [9]吴瑶,马祖军.时变路网下带时间窗的易腐食品生产—配送问题[J].系统工程理论与实践,2017,37(1):172-181.
    [10]邵举平,曹倩,沈敏燕,等.生鲜农产品配送中带时窗的VRP模型与算法[J].工业工程与管理,2015,20(1):122-127,134.
    [11] Kuo Y. Using simulated annealing to minimize fuel consumption for the time-dependent vehicle routing problem[J]. Computers and Industrial Engineering, 2010,59(1):157-165.
    [12] Suzuki Y. A new truck-routing approach for reducing fuel consumption and pollutants emission[J]. Transportation Research Part D:Transport and Environment, 2011,16(1):73-77.
    [13]康凯,韩杰,马艳芳,等.基于碳排放的模糊约定时间车辆路径问题研究[J].工业工程与管理,2017,22(4):17-22.
    [14]张如云,刘清.考虑低碳的城市配送车辆路径优化模型研究[J].工业工程与管理,2015,20(4):29-34.
    [15]葛显龙,许茂增,王伟鑫.基于联合配送的城市物流配送路径优化[J].控制与决策,2016,31(3):503-512.
    [16]葛显龙,谭柏川,吴宁谦.基于碳交易机制的带时间窗车辆路径问题与算法研究[J].管理工程学报,2018,32(4):141-148.
    [17] Xiao Y, Zhao Q, Kaku I, et al. Development of a fuel consumption optimization model for the capacitated vehicle routing problem[J]. Computers&Operations Research, 2012,39(7):1419-1431.
    [18] Duro, Antonio J. International mobility in carbon dioxide emissions[J]. Energy Policy, 2013,55:208-216.
    [19]肖建华,熊欢.基于时效性和响应性的生鲜农产品配送中心选址模型研究[J].物流技术,2011,30(1):32-34,89.
    [20]康凯,韩杰,普玮,等.生鲜农产品冷链物流低碳配送路径优化研究[J].计算机工程与应用,2019,55(2):259-265.

© 2004-2018 中国地质图书馆版权所有 京ICP备05064691号 京公网安备11010802017129号

地址:北京市海淀区学院路29号 邮编:100083

电话:办公室:(+86 10)66554848;文献借阅、咨询服务、科技查新:66554700