使用案例研究矩阵保存方法(PT. the midge commission commission)解决销售问题

R. Putrafi, A. Sahari
{"title":"使用案例研究矩阵保存方法(PT. the midge commission commission)解决销售问题","authors":"R. Putrafi, A. Sahari","doi":"10.22487/2540766x.2020.v17.i1.15164","DOIUrl":null,"url":null,"abstract":"Vehicle Routing Problem Is a Problem related to the route of product distribution to the consumers. With the existence of these problems a company is expected to seek away a way so that the distribution process can arrive on time to scattered consumers and obtain more efficient routes and costs. Therefore a method which can help the process of scheduling a good route and obtaining optimum costs and efficient delivery was used. One of the methods used was Saving Matrix, which in its operation could efficient the delivery route so that the minimum total distance was obtained. The company's actual mileage was greater than the distance travelled by the route after using the Saving Matrix method. The total difference in distance produced was 106,35 km or more saving 41,2 % from the actual distance of the company and using Saving Matrix could save the distribution costs of Rp. 5.687.640 or save 33,8 % of the cost before applying the method.","PeriodicalId":259622,"journal":{"name":"JURNAL ILMIAH MATEMATIKA DAN TERAPAN","volume":"26 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2020-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"Penyelesaian Vehicle Routing Problem Untuk Efisiensi Rute Pendistribusian Produk Minuman Teh Pucuk Harum Menggunakan metode Saving Matriks Studi Kasus (PT. Cipta Niaga Semesta Palu)\",\"authors\":\"R. Putrafi, A. Sahari\",\"doi\":\"10.22487/2540766x.2020.v17.i1.15164\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Vehicle Routing Problem Is a Problem related to the route of product distribution to the consumers. With the existence of these problems a company is expected to seek away a way so that the distribution process can arrive on time to scattered consumers and obtain more efficient routes and costs. Therefore a method which can help the process of scheduling a good route and obtaining optimum costs and efficient delivery was used. One of the methods used was Saving Matrix, which in its operation could efficient the delivery route so that the minimum total distance was obtained. The company's actual mileage was greater than the distance travelled by the route after using the Saving Matrix method. The total difference in distance produced was 106,35 km or more saving 41,2 % from the actual distance of the company and using Saving Matrix could save the distribution costs of Rp. 5.687.640 or save 33,8 % of the cost before applying the method.\",\"PeriodicalId\":259622,\"journal\":{\"name\":\"JURNAL ILMIAH MATEMATIKA DAN TERAPAN\",\"volume\":\"26 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2020-06-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"JURNAL ILMIAH MATEMATIKA DAN TERAPAN\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.22487/2540766x.2020.v17.i1.15164\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"JURNAL ILMIAH MATEMATIKA DAN TERAPAN","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.22487/2540766x.2020.v17.i1.15164","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

摘要

车辆路线问题是一个涉及产品配送到消费者手中路线的问题。由于这些问题的存在,公司应该寻求一种方法,使配送过程能够按时到达分散的消费者手中,并获得更有效的路线和成本。因此,采用了一种既能调度好路线,又能获得最优成本和高效交货的方法。其中一种方法是节省矩阵法,该方法可以有效地优化配送路线,使总距离最小。使用节省矩阵方法后,公司的实际里程大于路线行驶的距离。产生的总距离差为106,35 km或更多,比公司的实际距离节省41.2%,使用节省矩阵可以节省配送成本Rp. 5.687.640或节省成本33.8%。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Penyelesaian Vehicle Routing Problem Untuk Efisiensi Rute Pendistribusian Produk Minuman Teh Pucuk Harum Menggunakan metode Saving Matriks Studi Kasus (PT. Cipta Niaga Semesta Palu)
Vehicle Routing Problem Is a Problem related to the route of product distribution to the consumers. With the existence of these problems a company is expected to seek away a way so that the distribution process can arrive on time to scattered consumers and obtain more efficient routes and costs. Therefore a method which can help the process of scheduling a good route and obtaining optimum costs and efficient delivery was used. One of the methods used was Saving Matrix, which in its operation could efficient the delivery route so that the minimum total distance was obtained. The company's actual mileage was greater than the distance travelled by the route after using the Saving Matrix method. The total difference in distance produced was 106,35 km or more saving 41,2 % from the actual distance of the company and using Saving Matrix could save the distribution costs of Rp. 5.687.640 or save 33,8 % of the cost before applying the method.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信