Penentuan Rute Terpendek Di Kantor Pos Kabupaten Blitar Dalam Pendistribusian Paket Menggunakan Algoritma Clarke And Wright Savings

Wildan Faried Anshoriy Puji Wianto, Juhari Juhari, Achmad Nasichuddin
{"title":"Penentuan Rute Terpendek Di Kantor Pos Kabupaten Blitar Dalam Pendistribusian Paket Menggunakan Algoritma Clarke And Wright Savings","authors":"Wildan Faried Anshoriy Puji Wianto, Juhari Juhari, Achmad Nasichuddin","doi":"10.18860/jrmm.v2i6.22413","DOIUrl":null,"url":null,"abstract":"Marketing strategy is a very important part in the execution of the overall corporate strategy, especially in a very tight competitor state. Route is a very important aspect considered by goods distribution companies. An effective and efficient distribution process is one of the factors whose conditions begin to align with other indicators in an effort to achieve customer satisfaction. The strategy that can be done is to involve calculating algorithms in contributing systematic and measurable solutions. The  Clarke and  Wright Savings algorithm is an effective method in determining the shortest route of distributing goods, because the Clarke and Wright Savings method  has its own heuristics which make savings in   the form of mileage or distribution time. This study aims to determine the shortest route at the Blitar checkpoint post office (KPRK) in distributing express service type bags to each branch post office point (KPC) using the Clarke and Wright Savings Algorithm.  The results of the discussion on the application of  the Clarke and Wright Savings  method to determine the shortest route for the service bag distribution fleet from the KPRK Blitar post office to KPC can be concluded that, there are two initial routes owned by the company with a total delivery distance of 189.7 km. After calculation, two routes with the shortest distance will be traveled with a total delivery distance of 171 km. Route group 1 is Blitar Post Office à KPC Garum à KPC Nglegokà KPC  Gandusarià KPC Talun KPC Wlingi à KPC Doko à KPC Kesamben à KPC Selopuroà KPC  Binangun à KPC  Kanigoro à KPC Lodoyo à  KPC Kademangan à Post Office with a distance of 116.7 km. As for route 2, namely the blitar  post office à KPC Sanan Kulon à KPC Ponggok à KPC Srengat à KPC Kademangan à KPC Udanawu à Blitar post office with a distance of 54.3 km. With the establishment of routes with the closest distance, the company can save mileage by 9.85%.","PeriodicalId":270235,"journal":{"name":"Jurnal Riset Mahasiswa Matematika","volume":"37 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2023-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Jurnal Riset Mahasiswa Matematika","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.18860/jrmm.v2i6.22413","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

Marketing strategy is a very important part in the execution of the overall corporate strategy, especially in a very tight competitor state. Route is a very important aspect considered by goods distribution companies. An effective and efficient distribution process is one of the factors whose conditions begin to align with other indicators in an effort to achieve customer satisfaction. The strategy that can be done is to involve calculating algorithms in contributing systematic and measurable solutions. The  Clarke and  Wright Savings algorithm is an effective method in determining the shortest route of distributing goods, because the Clarke and Wright Savings method  has its own heuristics which make savings in   the form of mileage or distribution time. This study aims to determine the shortest route at the Blitar checkpoint post office (KPRK) in distributing express service type bags to each branch post office point (KPC) using the Clarke and Wright Savings Algorithm.  The results of the discussion on the application of  the Clarke and Wright Savings  method to determine the shortest route for the service bag distribution fleet from the KPRK Blitar post office to KPC can be concluded that, there are two initial routes owned by the company with a total delivery distance of 189.7 km. After calculation, two routes with the shortest distance will be traveled with a total delivery distance of 171 km. Route group 1 is Blitar Post Office à KPC Garum à KPC Nglegokà KPC  Gandusarià KPC Talun KPC Wlingi à KPC Doko à KPC Kesamben à KPC Selopuroà KPC  Binangun à KPC  Kanigoro à KPC Lodoyo à  KPC Kademangan à Post Office with a distance of 116.7 km. As for route 2, namely the blitar  post office à KPC Sanan Kulon à KPC Ponggok à KPC Srengat à KPC Kademangan à KPC Udanawu à Blitar post office with a distance of 54.3 km. With the establishment of routes with the closest distance, the company can save mileage by 9.85%.
使用克拉克和赖特储蓄算法在包分配中选择最短的路线
市场营销战略是企业整体战略执行中非常重要的一部分,特别是在竞争非常激烈的情况下。路线是物流公司考虑的一个非常重要的方面。有效和高效的分销过程是其条件开始与其他指标一致的因素之一,以努力实现客户满意度。可以采用的策略是在提供系统和可测量的解决方案时使用计算算法。Clarke and Wright Savings算法是一种确定最短配送路线的有效方法,因为Clarke and Wright Savings方法有自己的启发式方法,可以以里程或配送时间的形式进行节省。本研究旨在利用Clarke and Wright节省算法,确定在Blitar检查站邮局(KPRK)向各分支邮局点(KPC)分发快递服务类袋的最短路线。应用Clarke and Wright Savings法确定服务袋配送车队从KPRK Blitar邮局到KPC的最短路线的讨论结果可以得出,该公司拥有两条初始路线,总投递距离为189.7 km。经计算,将走两条距离最短的路线,总投递距离为171公里。路线组1是布里塔邮局,孔KPC,加鲁姆,孔KPC,恩格莱戈,孔KPC,甘杜萨里,孔KPC,塔伦,孔KPC, Wlingi,孔KPC,多科,科桑本,孔KPC,塞洛普罗,孔KPC,比安贡,孔KPC,科尼戈罗,孔KPC,洛多约,孔KPC,卡德曼干,距离116.7公里。至于2号路线,即布里塔邮局 KPC, Sanan Kulon, KPC, Ponggok, KPC, Srengat, KPC, kademanan, KPC, Udanawu,布里塔邮局,距离54.3公里。随着距离最近的航线的建立,公司可以节省9.85%的里程。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术官方微信