使用拯救矩阵方法来确定最佳的配送模式,以增强预订的灵活性

Winny Andalia, Devie Oktarini, Siti Humairoh
{"title":"使用拯救矩阵方法来确定最佳的配送模式,以增强预订的灵活性","authors":"Winny Andalia, Devie Oktarini, Siti Humairoh","doi":"10.36055/jiss.v7i1.11378","DOIUrl":null,"url":null,"abstract":"Received: 27 Mei 2021 Revision: 19 Oktober 2021 Accepted: 24 Oktober 2021 The purpose of this study is to obtain the most appropriate and optimal cosmetic shipping routes that can minimize transportation distribution costs, and determining the magnitude of distribution cost savings. The object of this research is the distribution of Wardah Cosmetics in Palembang, and the study uses 7 retailers in Palembang. Analysis of determining the distribution route using the Saving Matrix Method. The results of the approach through the Nearest Insert, Nearest Neighbor and Sweep get the smallest value of the route along 73.6 Km. The analyzing results by using Saving Matrix Method determine the distribution route which can be converted from D1, D2, D3, D4, D5, D6, D7 into D3, D5, D6, D7, D1, D2, D4. The original mileage of 129 kilometers can be reduced to 73.6 kilometers, which means the distance can be shortened or more efficient by 55.4 kilometers. Route changes the result in lower product distribution costs. Initial transportation costs were Rp. 1.196.850 per day and subsequently getting down to Rp. 662.115 per day. Thus, the distribution channel cost savings of Rp. 534.735 per day.","PeriodicalId":111822,"journal":{"name":"Journal Industrial Servicess","volume":"46 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2021-11-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"Penentuan pola distribusi optimal menggunakan metode saving matrix untuk meningkatkan fleksibilitas pemesanan\",\"authors\":\"Winny Andalia, Devie Oktarini, Siti Humairoh\",\"doi\":\"10.36055/jiss.v7i1.11378\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Received: 27 Mei 2021 Revision: 19 Oktober 2021 Accepted: 24 Oktober 2021 The purpose of this study is to obtain the most appropriate and optimal cosmetic shipping routes that can minimize transportation distribution costs, and determining the magnitude of distribution cost savings. The object of this research is the distribution of Wardah Cosmetics in Palembang, and the study uses 7 retailers in Palembang. Analysis of determining the distribution route using the Saving Matrix Method. The results of the approach through the Nearest Insert, Nearest Neighbor and Sweep get the smallest value of the route along 73.6 Km. The analyzing results by using Saving Matrix Method determine the distribution route which can be converted from D1, D2, D3, D4, D5, D6, D7 into D3, D5, D6, D7, D1, D2, D4. The original mileage of 129 kilometers can be reduced to 73.6 kilometers, which means the distance can be shortened or more efficient by 55.4 kilometers. Route changes the result in lower product distribution costs. Initial transportation costs were Rp. 1.196.850 per day and subsequently getting down to Rp. 662.115 per day. Thus, the distribution channel cost savings of Rp. 534.735 per day.\",\"PeriodicalId\":111822,\"journal\":{\"name\":\"Journal Industrial Servicess\",\"volume\":\"46 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2021-11-08\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Journal Industrial Servicess\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.36055/jiss.v7i1.11378\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Journal Industrial Servicess","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.36055/jiss.v7i1.11378","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

摘要

本研究的目的是获得最合适和最优的化妆品运输路线,使运输配送成本最小化,并确定配送成本节约的幅度。本研究的对象是瓦尔达化妆品在巨港的分销,研究使用巨港的7家零售商。用保存矩阵法确定配电路线的分析。通过最近插入、最近邻和扫描方法的接近结果在73.6 Km处的路径值最小。利用保存矩阵法分析结果,确定了可由D1、D2、D3、D4、D5、D6、D7转换为D3、D5、D6、D7、D1、D2、D4的分配路线。原来的129公里可以减少到73.6公里,这意味着可以缩短55.4公里的距离或提高效率。路线的改变降低了产品的分销成本。最初的运输成本为每天1.196.850卢比,随后降至每天662.115卢比。这样,每天可节省分销渠道成本534.735卢比。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Penentuan pola distribusi optimal menggunakan metode saving matrix untuk meningkatkan fleksibilitas pemesanan
Received: 27 Mei 2021 Revision: 19 Oktober 2021 Accepted: 24 Oktober 2021 The purpose of this study is to obtain the most appropriate and optimal cosmetic shipping routes that can minimize transportation distribution costs, and determining the magnitude of distribution cost savings. The object of this research is the distribution of Wardah Cosmetics in Palembang, and the study uses 7 retailers in Palembang. Analysis of determining the distribution route using the Saving Matrix Method. The results of the approach through the Nearest Insert, Nearest Neighbor and Sweep get the smallest value of the route along 73.6 Km. The analyzing results by using Saving Matrix Method determine the distribution route which can be converted from D1, D2, D3, D4, D5, D6, D7 into D3, D5, D6, D7, D1, D2, D4. The original mileage of 129 kilometers can be reduced to 73.6 kilometers, which means the distance can be shortened or more efficient by 55.4 kilometers. Route changes the result in lower product distribution costs. Initial transportation costs were Rp. 1.196.850 per day and subsequently getting down to Rp. 662.115 per day. Thus, the distribution channel cost savings of Rp. 534.735 per day.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信