改进作业成本法在冷链低碳物流路径规划中的应用

IF 0.9 Q4 COMPUTER SCIENCE, SOFTWARE ENGINEERING Scalable Computing-Practice and Experience Pub Date : 2023-09-10 DOI:10.12694/scpe.v24i3.2357
Xiazu Bai
{"title":"改进作业成本法在冷链低碳物流路径规划中的应用","authors":"Xiazu Bai","doi":"10.12694/scpe.v24i3.2357","DOIUrl":null,"url":null,"abstract":"The market has set higher efficiency and environmental requirements for cold chain logistics, and path planning plays an important role. This study proposes a low-carbon cold chain logistics path planning model based on an improved artificial bee colony algorithm (this paragraph refers to ”fusion algorithm”). The study first establishes the fusion algorithm. Then, in response to the shortcomings of this algorithm, the artificial fish swarm algorithm and genetic algorithm are used to improve it. The final results express that the shortest distance for solving Eil51 using this algorithm is 421.38, the longest distance is 448.58, and the average distance is 439.34; The shortest distance for solving Ulysses22 is 72.46, the longest distance is 73.63, and the average distance is 72.84. The average convergence times for Eil51 and Ulysses22 are 133.57 and 7.86, and the optimal performance ratios for relative error are 0.0076 and 0.0051. The robust performance ratios are 0.0362 and 0.0117. The optimal total cost solution and the average value for solving the relevant distribution problem are 47,894.6 yuan and 48,562.7 yuan, respectively. In summary, the model proposed in the study has good application effects in cold chain low-carbon logistics path planning, and has a certain promoting effect on the development of cold chain logistics.","PeriodicalId":43791,"journal":{"name":"Scalable Computing-Practice and Experience","volume":null,"pages":null},"PeriodicalIF":0.9000,"publicationDate":"2023-09-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Application of Improving ABC in Cold Chain Low Carbon Logistics Path Planning\",\"authors\":\"Xiazu Bai\",\"doi\":\"10.12694/scpe.v24i3.2357\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The market has set higher efficiency and environmental requirements for cold chain logistics, and path planning plays an important role. This study proposes a low-carbon cold chain logistics path planning model based on an improved artificial bee colony algorithm (this paragraph refers to ”fusion algorithm”). The study first establishes the fusion algorithm. Then, in response to the shortcomings of this algorithm, the artificial fish swarm algorithm and genetic algorithm are used to improve it. The final results express that the shortest distance for solving Eil51 using this algorithm is 421.38, the longest distance is 448.58, and the average distance is 439.34; The shortest distance for solving Ulysses22 is 72.46, the longest distance is 73.63, and the average distance is 72.84. The average convergence times for Eil51 and Ulysses22 are 133.57 and 7.86, and the optimal performance ratios for relative error are 0.0076 and 0.0051. The robust performance ratios are 0.0362 and 0.0117. The optimal total cost solution and the average value for solving the relevant distribution problem are 47,894.6 yuan and 48,562.7 yuan, respectively. In summary, the model proposed in the study has good application effects in cold chain low-carbon logistics path planning, and has a certain promoting effect on the development of cold chain logistics.\",\"PeriodicalId\":43791,\"journal\":{\"name\":\"Scalable Computing-Practice and Experience\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":0.9000,\"publicationDate\":\"2023-09-10\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Scalable Computing-Practice and Experience\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.12694/scpe.v24i3.2357\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q4\",\"JCRName\":\"COMPUTER SCIENCE, SOFTWARE ENGINEERING\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Scalable Computing-Practice and Experience","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.12694/scpe.v24i3.2357","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"COMPUTER SCIENCE, SOFTWARE ENGINEERING","Score":null,"Total":0}
引用次数: 0

摘要

市场对冷链物流提出了更高的效率和环保要求,路径规划发挥着重要作用。本研究提出了一种基于改进人工蜂群算法(本段简称“融合算法”)的低碳冷链物流路径规划模型。本研究首先建立了融合算法。然后,针对该算法的不足,采用人工鱼群算法和遗传算法对其进行改进。最终结果表明:该算法求解Eil51的最短距离为421.38,最长距离为448.58,平均距离为439.34;求解Ulysses22的最短距离为72.46,最长距离为73.63,平均距离为72.84。Eil51和Ulysses22的平均收敛时间分别为133.57和7.86,相对误差的最佳性能比分别为0.0076和0.0051。稳健性能比分别为0.0362和0.0117。最优总成本解为47894.6元,解决相关分配问题的平均值为48562.7元。综上所述,本研究提出的模型在冷链低碳物流路径规划中具有良好的应用效果,对冷链物流的发展具有一定的促进作用。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
Application of Improving ABC in Cold Chain Low Carbon Logistics Path Planning
The market has set higher efficiency and environmental requirements for cold chain logistics, and path planning plays an important role. This study proposes a low-carbon cold chain logistics path planning model based on an improved artificial bee colony algorithm (this paragraph refers to ”fusion algorithm”). The study first establishes the fusion algorithm. Then, in response to the shortcomings of this algorithm, the artificial fish swarm algorithm and genetic algorithm are used to improve it. The final results express that the shortest distance for solving Eil51 using this algorithm is 421.38, the longest distance is 448.58, and the average distance is 439.34; The shortest distance for solving Ulysses22 is 72.46, the longest distance is 73.63, and the average distance is 72.84. The average convergence times for Eil51 and Ulysses22 are 133.57 and 7.86, and the optimal performance ratios for relative error are 0.0076 and 0.0051. The robust performance ratios are 0.0362 and 0.0117. The optimal total cost solution and the average value for solving the relevant distribution problem are 47,894.6 yuan and 48,562.7 yuan, respectively. In summary, the model proposed in the study has good application effects in cold chain low-carbon logistics path planning, and has a certain promoting effect on the development of cold chain logistics.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
Scalable Computing-Practice and Experience
Scalable Computing-Practice and Experience COMPUTER SCIENCE, SOFTWARE ENGINEERING-
CiteScore
2.00
自引率
0.00%
发文量
10
期刊介绍: The area of scalable computing has matured and reached a point where new issues and trends require a professional forum. SCPE will provide this avenue by publishing original refereed papers that address the present as well as the future of parallel and distributed computing. The journal will focus on algorithm development, implementation and execution on real-world parallel architectures, and application of parallel and distributed computing to the solution of real-life problems.
期刊最新文献
A Deep LSTM-RNN Classification Method for Covid-19 Twitter Review Based on Sentiment Analysis Flexible English Learning Platform using Collaborative Cloud-Fog-Edge Networking Computer Malicious Code Signal Detection based on Big Data Technology Analyzing Spectator Emotions and Behaviors at Live Sporting Events using Computer Vision and Sentiment Analysis Techniques Spacecraft Test Data Integration Management Technology based on Big Data Platform
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1