The Shortest Route of Material Transportation and Optimal Capital Savings Design Based on Floyd Algorithm

Xingze Zhang, Zekun Chen, Liyan Xu, Xuetao Yan
{"title":"The Shortest Route of Material Transportation and Optimal Capital Savings Design Based on Floyd Algorithm","authors":"Xingze Zhang, Zekun Chen, Liyan Xu, Xuetao Yan","doi":"10.1109/AEMCSE55572.2022.00103","DOIUrl":null,"url":null,"abstract":"In order to solve the problem of how to choose the shortest route and the corresponding capital consumption during the transportation of goods, this paper uses mathematical modeling competition data to analyze and calculate, which has authenticity and simulates the display situation to a great extent. The shortest path is calculated by the Floyd algorithm, and the optimization model is established by the Matlab. It provides not only solutions for the capital savings, but also the choice of the shortest path in the transportation of goods. Besides this paper proposes a more practical strategy of the shortest path problem, which has significance meanings for researching.","PeriodicalId":309096,"journal":{"name":"2022 5th International Conference on Advanced Electronic Materials, Computers and Software Engineering (AEMCSE)","volume":"102 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2022-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2022 5th International Conference on Advanced Electronic Materials, Computers and Software Engineering (AEMCSE)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/AEMCSE55572.2022.00103","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

In order to solve the problem of how to choose the shortest route and the corresponding capital consumption during the transportation of goods, this paper uses mathematical modeling competition data to analyze and calculate, which has authenticity and simulates the display situation to a great extent. The shortest path is calculated by the Floyd algorithm, and the optimization model is established by the Matlab. It provides not only solutions for the capital savings, but also the choice of the shortest path in the transportation of goods. Besides this paper proposes a more practical strategy of the shortest path problem, which has significance meanings for researching.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
基于Floyd算法的物资运输最短路线及最优资金节约设计
为了解决在货物运输过程中如何选择最短的路线和相应的资金消耗问题,本文采用数学建模竞赛数据进行分析计算,具有真实性,并在很大程度上模拟了展示情况。采用Floyd算法计算最短路径,并利用Matlab建立优化模型。它不仅为节省资金提供了解决方案,而且为货物运输提供了最短路径的选择。此外,本文还提出了一种更实用的最短路径问题求解策略,具有重要的研究意义。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Division of dataset into training and validation subsets by the jackknife validations to predict the pH optimum for beta-cellobiosidase Research on the evaluation method of virtual clothing pressure comfort based on fuzzy clustering Mechanical properties of interconnection interfaces in micro tin-silver-copper solder joints Clustering-based Interference Suppression Algorithm for UWB Localization Bridge Crack Detection Based on Image Segmentation
×
引用
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