{"title":"PENENTUAN JALUR DISTRIBUSI DENGAN METODE SAVING MATRIKS","authors":"Fandi Ahmad, Hafidz Fadel Muharram","doi":"10.36618/competitive.v13i1.346","DOIUrl":null,"url":null,"abstract":"Dalam persaingan bisnis yang makin ketat dibutuhkan strategi dalam menetukan optimalisasi dan efesiensi, mengefektifkan jalur distribusi barang akan berakibat pada profit yang diperoleh perusahaan dan harga barang yang makin kompetitif, kesalahan penentuan jalur distribusi ke customer akan mengakibatkan jalur pengiriman yang ditempuh terlalu panjang dan rumit sehingga mengakibatkan biaya transportasi yang mahal. Dengan adanya permasalahan tersebut, maka perlu dilakukan penentuan rute yang akan dilalui sehingga dapat meminimalkan biaya transportasi pada Metode Saving Matrix dipilih dalam penelitian ini untuk menentukan rute distribusi produk t agar diperoleh rute dan memperoleh biaya transportasi yang optimal. \nDari hasil penelitian rute pada penelitian ini diketahui berjumlah 18 rute dari sebelumnya berjumlah 25 rute, sehingga diperoleh pernghematan 7 rute, total jarak melalui metode perhitungan saving matrix, nearest insert dan nearest neighbour adalah sebesar 1700,69 km. Sedangkan total jarak pengiriman rute aktual pada perusahaan adalah sebesar 2046,97 km. Penghematan antara rute penelitian ini dengan rute aktual perusahaan adalah sebesar 346,28 km.sedangkan daris sisi total biaya pengiriman/transportasi yang dihasilkan melalui metode perhitungan saving matrix, nearest insert dan nearest neighbour adalah sebesar Rp. 483.927.812. Dari sisi biaya pengiriman/transportasi rute aktual pada perusahaan adalah sebesar Rp. 629.281.041. Penghematan dengan metode penelitian saving matrix adalah sebesar Rp. 145.353.229 atau 23,09 % \n \nIn the increasingly fierce business competition strategies are needed to determine optimization and efficiency, streamlining the distribution channels of goods will result in profits obtained by the company and increasingly competitive goods prices, errors in determining the distribution path to the customer will lead to too long and complicated shipping lines resulting expensive transportation costs. With these problems, it is necessary to determine the route to be passed so as to minimize transportation costs in the Saving Matrix Method selected in this study to determine the product distribution route to obtain the route and obtain optimal transportation costs. \nFrom the results of the route research in this study it is known that there are 18 routes from the previous number of 25 routes, so obtained savings of 7 routes, the total distance through the calculation method of saving matrix, nearest insert and nearest neighbor is equal to 1700.69 km. While the total distance of shipping the actual route to the company is 2046.97 km. Savings between the route of this research with the actual route of the company is 346.28 km. While from the total side of the shipping / transportation costs generated through the calculation method of saving matrix, nearest insert and nearest neighbor is Rp. 483,927,812. In terms of shipping / transportation costs the actual route of the company is Rp. 629,281,041. Savings with the saving matrix research method is Rp. 145,353,229 or 23.09%","PeriodicalId":100295,"journal":{"name":"Competitive Intelligence Review","volume":"1 1","pages":""},"PeriodicalIF":0.0000,"publicationDate":"2018-12-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"12","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Competitive Intelligence Review","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.36618/competitive.v13i1.346","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 12
Abstract
Dalam persaingan bisnis yang makin ketat dibutuhkan strategi dalam menetukan optimalisasi dan efesiensi, mengefektifkan jalur distribusi barang akan berakibat pada profit yang diperoleh perusahaan dan harga barang yang makin kompetitif, kesalahan penentuan jalur distribusi ke customer akan mengakibatkan jalur pengiriman yang ditempuh terlalu panjang dan rumit sehingga mengakibatkan biaya transportasi yang mahal. Dengan adanya permasalahan tersebut, maka perlu dilakukan penentuan rute yang akan dilalui sehingga dapat meminimalkan biaya transportasi pada Metode Saving Matrix dipilih dalam penelitian ini untuk menentukan rute distribusi produk t agar diperoleh rute dan memperoleh biaya transportasi yang optimal.
Dari hasil penelitian rute pada penelitian ini diketahui berjumlah 18 rute dari sebelumnya berjumlah 25 rute, sehingga diperoleh pernghematan 7 rute, total jarak melalui metode perhitungan saving matrix, nearest insert dan nearest neighbour adalah sebesar 1700,69 km. Sedangkan total jarak pengiriman rute aktual pada perusahaan adalah sebesar 2046,97 km. Penghematan antara rute penelitian ini dengan rute aktual perusahaan adalah sebesar 346,28 km.sedangkan daris sisi total biaya pengiriman/transportasi yang dihasilkan melalui metode perhitungan saving matrix, nearest insert dan nearest neighbour adalah sebesar Rp. 483.927.812. Dari sisi biaya pengiriman/transportasi rute aktual pada perusahaan adalah sebesar Rp. 629.281.041. Penghematan dengan metode penelitian saving matrix adalah sebesar Rp. 145.353.229 atau 23,09 %
In the increasingly fierce business competition strategies are needed to determine optimization and efficiency, streamlining the distribution channels of goods will result in profits obtained by the company and increasingly competitive goods prices, errors in determining the distribution path to the customer will lead to too long and complicated shipping lines resulting expensive transportation costs. With these problems, it is necessary to determine the route to be passed so as to minimize transportation costs in the Saving Matrix Method selected in this study to determine the product distribution route to obtain the route and obtain optimal transportation costs.
From the results of the route research in this study it is known that there are 18 routes from the previous number of 25 routes, so obtained savings of 7 routes, the total distance through the calculation method of saving matrix, nearest insert and nearest neighbor is equal to 1700.69 km. While the total distance of shipping the actual route to the company is 2046.97 km. Savings between the route of this research with the actual route of the company is 346.28 km. While from the total side of the shipping / transportation costs generated through the calculation method of saving matrix, nearest insert and nearest neighbor is Rp. 483,927,812. In terms of shipping / transportation costs the actual route of the company is Rp. 629,281,041. Savings with the saving matrix research method is Rp. 145,353,229 or 23.09%
需要更严格的商业竞争策略中选择优化首屈一指,地分销渠道公司获得的利润将导致货物的成本和价格越来越有竞争力的产品,分销渠道去测定客户错误会导致轨道运输的路程太长而复杂导致昂贵的运输费用。有了这些问题,就有必要确定所走的路线,以便在本研究中选择更低的运输成本,以便确定产品t的分配路线,以便获得最佳的运输成本。据了解,该研究的路线研究比前25条路线增加了18条,因此通过计算方法拯救矩阵实现了7条路线的进程,近距离是1700.69公里(1700.69公里)。而公司实际航线的总运输距离是2046.97公里。本研究路线与本公司实际路线之间的节省是346.28公里。至于从拯救矩阵的计算方法中生产的总运输成本,近端的交付成本为483927.812卢比。根据公司实际的邮购/运输成本为629.281041卢比。在不断增长的激烈的商业竞争策略中客户指定的分配路径中的errors将导致太长,并执行可重复的高流量运输公司。有了这些问题,我们有必要确定这条路线,以便在这项研究中确定生产的分布路径,以确定最理想的运输方式。results》从公路research in this study)是知道那个有18 routes routes previous号码》从25,所以获得储蓄routes》7、《calculation方法》距离通过储蓄总额矩阵,最近插入和最近邻居1700 is equal to 69公里。往公司的总航程为2046.97公里在这条研究路线和实际公司路线之间的储蓄是346.28公里。同时,从船运/运输的整个方面,通过拯救矩阵的计算方法,最近的邻居是4483,9277,812卢比。根据船运/运输公司的规定,公司的实际路线是629.281,041卢比。储蓄与储蓄矩阵研究方法研究方法为Rp. 145.353.229或23.09%