期刊文献+

基于碳排放和分类用户满意度的冷链物流路径优化 被引量:2

Cold Chain Logistics Path Optimization Based on Carbon Emission Classification and User Satisfaction
原文传递
导出
摘要 企业需要在考虑分类用户满意度的前提下降低企业配送成本。同时基于碳中和概念,面对可能的碳税和碳限政策,也需要制定合理的方案来降低企业成本。针对冷链物流路径优化问题,构建了考虑分类用户满意度和碳税碳限政策的冷链物流成本模型,融合遗传算法和蚁群算法设计出Aco-Aga和Aga-Aco算法,并分别对模型优化效果进行对比,Aco-Aga算法收敛更快,解质量更高。实证分析表明模型有效降低了企业碳排放,提高了用户满意度。 Enterprises need to reduce their distribution costs on the premise of considering classified user satisfaction.At the same time,based on the concept of carbon neutralization,in the face of possible carbon tax and carbon limit policies,they also need to formulate reasonable schemes to reduce their costs.Facing the problem of cold chain logistics path optimization,this paper constructs a cold chain logistics cost model considering classified user satisfaction and carbon tax and carbon limit policies,The fusion algorithm of genetic algorithm and ant colony algorithm,Aco-Aga and Aga-Aco algorithm are designed,and the models are optimized respectively.After comparison,it is found that Aco-Aga algorithm converges faster and the solution quality is higher in this model.After obtaining the optimal solution,it is found that the model effectively reduces enterprise carbon emission and improves user satisfaction.
作者 罗瑞 王展青 LUO Rui;WANG Zhan-qing(School of Science,Wuhan University of Technology,Wuhan 430070,China)
出处 《武汉理工大学学报》 CAS 2022年第1期100-108,共9页 Journal of Wuhan University of Technology
关键词 冷链物流 低碳 分类用户 智能优化算法 路径优化 cold chain logistics low carbon classify users intelligent optimization algorithm path optimization
  • 相关文献

参考文献2

二级参考文献21

  • 1方金城,张岐山.物流配送车辆路径问题(VRP)算法综述[J].沈阳工程学院学报(自然科学版),2006,2(4):357-360. 被引量:25
  • 2Dantzig G, Ramser J. The truck dispatching problem[ J]. Management Science, 1959, 6: 80-91.
  • 3Russell R A. Hybrid heuristic for the vehicle routing problem with time windows[J]. Transportation Science, 1995, 29: 156-166.
  • 4Landrieu A, Mati Y, Binder Z. A tabu search heuristic for the single vehicle pickup and delivery with time windows[ J]. Journal of Intelligent Manufacturing, 2001, 12: 497-508.
  • 5Pankratz G. A grouping genetic algorithm for the pickup and delivery problem with time windows[ J]. OR Spectrum, 2005, 27 : 21-41.
  • 6Min H. The multiple vehicle routing problem with simultaneous delivery and pick-up points[J]. Transportation Research A, 1989, 23: 310-328.
  • 7Halse K. Modeling and solving complex vehicle routing problems[ D]. PhD thesis. Institute of Mathematical Statistics anti Operations Research, Technical University of Denmark, Lyngby, 1992.
  • 8Nagy G, Salhi S. Heuristic algorithms for single and multiple depot vehicle routing problems with pickups and deliveries[ J]. European Journal of Operaional Research, 2005, 162 : 126-141.
  • 9Nicola B, Giovanni R. Heuristic algorithms for the vehicle problem with simultaneous pick-up and delivery[ J]. Computers & Operations Research, 2007, 34: 578-594.
  • 10唐国春.新的运输路径问题[C].中国运筹学会九届学术交流会论文集(ISBN 962-8286-38-2),香港: Global-Link Informatics Limited, 2008: 269-277.

共引文献26

同被引文献18

引证文献2

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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