Increasing package delivery efficiency through the application of the prim algorithm to find the shortest route on the expedition route

A. Lestari, Dwika Ananda Agustina Pertiwi, M. A. Muslim
{"title":"Increasing package delivery efficiency through the application of the prim algorithm to find the shortest route on the expedition route","authors":"A. Lestari, Dwika Ananda Agustina Pertiwi, M. A. Muslim","doi":"10.52465/josre.v1i1.105","DOIUrl":null,"url":null,"abstract":"One of the changes is in terms of shopping. Previously, people shopped through physical stores, but since the emergence of online shopping platforms, people have started to switch to using the marketplace as a place to make buying and selling transactions. This platform utilizes expedition services to send packages in the form of ordered goods from sellers to buyers. This activity presents a new problem, which is related to the efficiency of package delivery by courier services so that goods can arrive as quickly as possible in the hands of buyers. Graph modeling to solve a problem related to the shortest path and the fastest path is adapted in this paper. The algorithm used is Prim's Algorithm, which is an algorithm to determine the minimum spanning tree of a connected weighted graph. The test results show that the algorithm is suitable for increasing packet delivery efficiency by determining the shortest path based on the minimum spanning tree concept. By taking a sample of travel routes on the island of Java, the best route was obtained with a total distance of 1,771 kilometers connecting cities from the city of Jakarta to the city of Banyuwangi.","PeriodicalId":105983,"journal":{"name":"Journal of Student Research Exploration","volume":"254 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2022-12-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Journal of Student Research Exploration","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.52465/josre.v1i1.105","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

One of the changes is in terms of shopping. Previously, people shopped through physical stores, but since the emergence of online shopping platforms, people have started to switch to using the marketplace as a place to make buying and selling transactions. This platform utilizes expedition services to send packages in the form of ordered goods from sellers to buyers. This activity presents a new problem, which is related to the efficiency of package delivery by courier services so that goods can arrive as quickly as possible in the hands of buyers. Graph modeling to solve a problem related to the shortest path and the fastest path is adapted in this paper. The algorithm used is Prim's Algorithm, which is an algorithm to determine the minimum spanning tree of a connected weighted graph. The test results show that the algorithm is suitable for increasing packet delivery efficiency by determining the shortest path based on the minimum spanning tree concept. By taking a sample of travel routes on the island of Java, the best route was obtained with a total distance of 1,771 kilometers connecting cities from the city of Jakarta to the city of Banyuwangi.
通过应用prim算法在考察路线上寻找最短路线,提高包裹投递效率
其中一个变化是在购物方面。以前,人们通过实体店购物,但自从网上购物平台出现以来,人们开始转向使用市场作为买卖交易的场所。该平台利用远征服务,以订购商品的形式将包裹从卖家发送给买家。这个活动提出了一个新的问题,这与快递服务的包裹递送效率有关,以便货物能够尽快到达买家手中。本文采用图的建模方法来解决最短路径和最快路径的问题。使用的算法是Prim算法,它是一种确定连通加权图的最小生成树的算法。测试结果表明,该算法基于最小生成树的概念,通过确定最短路径来提高数据包的传输效率。通过对爪哇岛上的旅行路线进行抽样,获得了总距离为1,771公里的最佳路线,连接从雅加达市到班纽旺吉市的城市。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
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学术文献互助群
群 号:481959085
Book学术官方微信