基于Dijkstra和扫描算法协同的最优配送路径规划

L. Zulfiqar, R. Isnanto, O. Nurhayati
{"title":"基于Dijkstra和扫描算法协同的最优配送路径规划","authors":"L. Zulfiqar, R. Isnanto, O. Nurhayati","doi":"10.1109/ICITEED.2018.8534753","DOIUrl":null,"url":null,"abstract":"More than half of company’s logistic budget is spent for the transportation matter. Hence, applying the efficient way to distribute things is exactly needed for the transportation system in order to gain better profit. The combination of Dijkstra algorithm and Sweep Algorithm is a novel method that able to resolve optimal distribution route planning. As we gain from our research that by utilizing this method we achieve the reduction of both distance travel and trip’s time. We are gaining better solution for 9.3% in distance travel and successful cutting time travel for 50% from the original trip’s time.","PeriodicalId":142523,"journal":{"name":"2018 10th International Conference on Information Technology and Electrical Engineering (ICITEE)","volume":"31 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2018-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"5","resultStr":"{\"title\":\"Optimal Distribution Route Planning based on Collaboration of Dijkstra and Sweep Algorithm\",\"authors\":\"L. Zulfiqar, R. Isnanto, O. Nurhayati\",\"doi\":\"10.1109/ICITEED.2018.8534753\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"More than half of company’s logistic budget is spent for the transportation matter. Hence, applying the efficient way to distribute things is exactly needed for the transportation system in order to gain better profit. The combination of Dijkstra algorithm and Sweep Algorithm is a novel method that able to resolve optimal distribution route planning. As we gain from our research that by utilizing this method we achieve the reduction of both distance travel and trip’s time. We are gaining better solution for 9.3% in distance travel and successful cutting time travel for 50% from the original trip’s time.\",\"PeriodicalId\":142523,\"journal\":{\"name\":\"2018 10th International Conference on Information Technology and Electrical Engineering (ICITEE)\",\"volume\":\"31 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2018-07-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"5\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2018 10th International Conference on Information Technology and Electrical Engineering (ICITEE)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICITEED.2018.8534753\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2018 10th International Conference on Information Technology and Electrical Engineering (ICITEE)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICITEED.2018.8534753","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 5

摘要

公司物流预算的一半以上用于运输。因此,为了获得更好的利润,运输系统正是需要采用有效的方式来分配物品。Dijkstra算法与扫描算法相结合是一种求解配电网最优路线规划的新方法。正如我们从研究中得到的那样,通过使用这种方法,我们既减少了旅行的距离,也减少了旅行的时间。我们为9.3%的长途旅行提供了更好的解决方案,并成功地将时间旅行从原来的旅行时间减少了50%。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Optimal Distribution Route Planning based on Collaboration of Dijkstra and Sweep Algorithm
More than half of company’s logistic budget is spent for the transportation matter. Hence, applying the efficient way to distribute things is exactly needed for the transportation system in order to gain better profit. The combination of Dijkstra algorithm and Sweep Algorithm is a novel method that able to resolve optimal distribution route planning. As we gain from our research that by utilizing this method we achieve the reduction of both distance travel and trip’s time. We are gaining better solution for 9.3% in distance travel and successful cutting time travel for 50% from the original trip’s time.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信