scholarly journals ANALISA RUTE DISTRIBUSI DAN BIAYA TRANSPORTASI SEBAGAI PENDUKUNG BISNIS PT POS INDONESIA KP BANJARNEGARA

2020 ◽  
Vol 5 (2) ◽  
pp. 56-66
Author(s):  
Aditia Sovia Pramudita
Keyword(s):  
Competitive Advantage ◽  
Matrix Method ◽  
Nearest Neighbor ◽  
Product Distribution ◽  
Transportation Costs ◽  
Total Distance ◽  
State Owned Enterprise ◽  
Distribution Process ◽  
Courier Service

PT Pos Indonesia is a state-owned enterprise engaged in courier service inIndonesia. To achieve the competitive advantage, PT Pos Indonesia certainly cannot beseparated from its effectiveness and its efficiency in distributing letters and packages tothe customers. This research is the background of the product distribution process atPT Pos Indonesia Regional VI Semarang which based on Pos Indonesia way, where theneed for savings in needed. Therefore, the PROSAN section needs to make savings interms of distribution routes and distance. The purpose of this study is to determine thedistribution route of Pos Banjarnegara in order to minimize transportation costs. Thisresearch uses the VRP method. In this thesis, the VRP model is needed for theBanjarnegara Pos office distribution route, the solving for this method is to use savingmatrix, nearest insertion, nearest neighbor and finding out the most effective VRPsolving among those methods. Based on the calculation to complete the VRP using thesaving matrix method, the total distance is 204,3 km, the nearest insertion is 203,9, andthe nearest neighbor produces a distance of 180,6 km while the current average for thedistance in this company is 244,8 km. This shows that the nearest neighbor method ismore efficient in determining distribution routes, and this route can be done by usingjust one vehicle.Keywords: saving matrix, nearest insertion, nearest neighbor, distribution, routes

scholarly journals PENENTUAN JALUR DISTRIBUSI DENGAN METODE SAVING MATRIKS

Competitive ◽  
2018 ◽  
Vol 13 (1) ◽  
pp. 45
Author(s):  
Fandi Ahmad ◽  
Hafidz Fadel Muharram
Keyword(s):  
Calculation Method ◽  
Matrix Method ◽  
Research Method ◽  
Nearest Neighbor ◽  
Distribution Channels ◽  
Product Distribution ◽  
Optimal Transportation ◽  
Transportation Costs ◽  
Nearest Neighbour ◽  
Total Distance

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%

scholarly journals PENENTUAN RUTE DISTRIBUSI PALLET MESH MENGGUNAKAN METODE SAVING MATRIX (STUDI KASUS : PT. MMM)

2021 ◽  
Vol 5 (1) ◽  
pp. 01-09
Author(s):  
Fery Darus Nasution (Universitas Singaperbangsa) ◽  
Ade Momon S (Universitas Singaperbangsa) ◽  
Risma Fitriani (Universitas Singaperbangsa)
Keyword(s):  
Matrix Method ◽  
Nearest Neighbor ◽  
Cost Savings ◽  
Transportation Cost ◽  
Product Distribution ◽  
Initial Distribution ◽  
Transportation Costs ◽  
Initial Cost ◽  
Efficient Route ◽  
Cost Of Transportation

AbstractDistribution of products from the company's warehouse PT. MMM to consumers so far the company only uses estimates of consumers which will be passed in one shipment only by looking at the number of requests without considering the shipping routes and distance from the warehouse to the location of the consumer. This study aims to determine an effective shipping route using the saving matrix and nearest neighbor methods then find out distance savings and transportation cost savings. Comparison of the product distribution routes of PT. MMM after using the saving matrix method and the nearest neighbor method results in an effective and efficient route where the initial distribution route is 40 routes into 7 routes for 7 days of product distribution to consumers. The saving matrix method is applied. shows a reduction in the distance of the original shipment of 1,673.6 Km to 810.7 Km, thus obtained a savings of a distance of 862.9 Km. As well as a significant reduction in transportation costs where the initial cost of transportation of Rp. 4,478,448.- dropped to Rp. 3,675,951.-, so the company can save on transportation costs by Rp. 802,497.-.AbstrakRute pendistribusian produk dari gudang perusahaan PT. MMM  ke para konsumen  selama ini perusahaan hanya menggunakan perkiraan konsumen mana yang akan dilalui dalam satu kali pengiriman, yaitu hanya dengan melihat jumlah permintaan tanpa mempertimbangkan rute pengiriman dan jarak tempuh dari gudang ke lokasi konsumen. Penelitian ini bertujuan untuk menentukan rute pengiriman yang efektif menggunakan metode saving matrix dan nearest neighbor, kemudian mengetahui penghematan jarak serta penghematan biaya transportasi. Perbandingan rute distribusi produk PT. MMM dengan menggunakan metode saving matrix dan metode nearest neighbor menghasilkan rute yang efektif dan efisien dimana rute awal distribusi sebanyak 40 rute menjadi 7 rute untuk 7 hari pendistribusian produk ke konsumen. Dengan diterapkannya metode saving matrix menunjukan penurunan jarak tempuh pengiriman yang semula 1.673,6 Km menjadi 810,7 Km, dengan demikian didapatkan penghematan jarak sebesar 862,9 Km. Serta menurunkan biaya transportasi yang signifikan dimana biaya awal transportasi sebesar Rp. 4.478.448.- turun menjadi Rp. 3.675.951.-, sehingga perusahaan dapat menghemat biaya transportasi sebesar Rp. 802.497

scholarly journals Completion Vehicle Routing Problem (VRP) In Determining Route And Determining The Number Of Vehicles In Minimizing Transportation Costs In PT. XYZ With Using Genetic Algorithm

2018 ◽  
Vol 2 (01) ◽  
Author(s):  
Ahmad Fauzan Abdurrahman
Keyword(s):  
Genetic Algorithm ◽  
Nearest Neighbor ◽  
Time Window ◽  
Initial Conditions ◽  
Empty Space ◽  
Transportation Costs ◽  
Routing Problem ◽  
Optimal Distance ◽  
Distribution Process ◽  
The Cost

In the transportation process is closely related to the route, the route is the path through which a mode / vehicle to arrive at a destination. The route is related to the number of vehicles and the location where it goes. PT XYZ is a company engaged in fast moving consumer goods (FMCG), with the field makes the flow of goods speed will be high until the goods distribution process becomes fast and often. In the process of distribution is done by using 1 fleet in each customer. Currently in the process of distributing goods, the company still ignores the utility of the vehicles used, so the availability of empty space in capacity is still occurring and this makes the cost of transportation is high. Consolidation of multiple customers becomes possible, keeping in mind the time window, capacity and multiple products. This study designs a route by considering the limits to get the route, the number of vehicles, the utility increase of each vehicle and the optimal distance so that it can minimize transportation costs. The use of a genetic algorithm preceded by the nearest neighbor algorithm is used to solve this problem. Later the route will be formed and get the number of vehicles, the increase in vehicle utility and the optimal distance. This resulted in average vehicle utility improvement of 35,317%, vehicle repairs amounted to 34.05%, and distance of 10.075% so as to reduce transportation costs by 26.56% from initial conditions.

scholarly journals Penentuan Rute Distribusi Produk Menggunakan Metode Saving Matrix Dan Nearest Neighbor Pada PT. XYZ

2019 ◽  
Vol 2 (4) ◽  
Author(s):  
Haniza ◽  
Khawarita Sirega ◽  
Muhammad Fachrowi Siregar
Keyword(s):  
Heuristic Algorithm ◽  
Nearest Neighbor ◽  
Cost Savings ◽  
Product Distribution ◽  
Food Ingredients ◽  
Starting Point ◽  
Distribution Process ◽  
Planning Processes ◽  
Transport Vehicle ◽  
Tapioca Flour

Permasalahan penentuan suatu rute distribusi erat kaitannya dengan penentuan perjalanan dari suatu titik atau cabang ke suatu titik atau cabang lainnya dalam suatu rute distribusi. Rute distribusi produk merupakan urutan pemberhentian berturut-turut terhadap cabang dan proses perencanaan dari titik awal (Perusahaan) ke titik konsumsi untuk memenuhi kebutuhan konsumen. PT. XYZ adalah perusahaan yang bergerak di bidang pembuatan bahan makanan, yaitu pembuatan tepung tapioka. PT. XYZ melakukan distribusi ke distributor tanpa memperhitungkan jarak tempuh dan utilitas kendaraan angkut. Proses pendistribusian produk dalam satu kali rute perjalanan hanya dilakukan kepada dua distributor. Pendistribusian produk yang tidak tepat dalam menentukan rute distribusi ke distributor dan tanpa melihat terdahulu kapasitas dari alat angkut mengakibatkan jalur yang ditempuh tidak efisien. Maka dilakukanlah penentuan rute distribusi dengan algoritma heuristik. Pembentukan sub rute pada rute usulan dengan menggunakan algoritma heuristik menghasilkan sub rute yang lebih sedikit dari rute distribusi yang diterapkan perusahaan, dimana sub rute usulan adalah 2 sub rute, sedangkan sub rute yang selama ini diterapkan perusahaan adalah 4 sub rute, menghasilkan jarak yang lebih minimum dengan penghematan jarak sebesar 299500 m, penghematan biaya sebesar Rp.262.650 dan pengurangan penggunaan kendaraan dimana pada rute awal sebanyak 4 armada, setelah menentukan rute distribusi menjadi 2 kendaraan.   The problem of determining a distribution route is closely related to the determination of a trip from a point or branch to a point or other branch in a distribution route. Product distribution routes are sequential sequences of stops for branches and planning processes from the starting point (Company) to the point of consumption to meet consumer needs. PT. XYZ is a company engaged in the manufacture of food ingredients, namely the manufacture of tapioca flour. PT. XYZ distributes to distributors without taking into account the distance and utility of the transport vehicle. The product distribution process in one trip route is only done to two distributors. Inaccurate product distribution in determining distribution routes to distributors and without seeing in advance the capacity of the transport equipment resulted in an inefficient route. Then the distribution route is determined by a heuristic algorithm. Sub route formation on the proposed route using the heuristic algorithm produces fewer sub routes than the distribution route applied by the company, where the proposed sub routes are 2 sub routes, while the sub routes that have been applied by the company are 4 sub routes, resulting in a minimum distance with a distance savings of 299500 m, a cost savings of Rp.262,650 and a reduction in vehicle usage where the initial route was 4 vehicle, after determining the distribution route into 2 vehicle.

scholarly journals Penentuan Rute Distribusi Suku Cadang Kendaraan Bermotor dalam Meminimalkan Biaya Transportasi (Studi Kasus: PT. Inti Polymetal Karawang)

2018 ◽  
Vol 11 (1) ◽  
Author(s):  
Ade Momon ◽  
Damara Widi Ardiatma
Keyword(s):  
Distribution System ◽  
Matrix Method ◽  
Cost Savings ◽  
Minimum Cost ◽  
Transportation Cost ◽  
Nearest Neighbors ◽  
Product Distribution ◽  
Planning And Scheduling ◽  
Distribution Process ◽  
A Company

The goal of the distribution system is to deliver the product promptly, quickly and generate the minimum cost. Therefore, the development of distribution system is very important because it can support the growth and development of the company. This study aims to get the route of delivery of the most appropriate and optimal products and get transportation cost savings. PT. IPM is a company engaged in the production of automotive. The problems faced by PT. IPM is the absence of good product distribution planning and scheduling distribution process is considered not maximal. This is due to the number of routes are too many, the distance is too far delivery, the limited means of conveyance and utilization of transport space less than the maximum and the high cost of transportation. To solve the problem of PT. IPM then needed the best method, that is Saving Matrix method which is used to determine product distribution route to the customer based on the capacity of conveyance used and Nearest Neighbors method for route ordering. From the result of mathematical calculation with Saving Matrix method and algorithm with Nearest Neighbors method obtained 49 best routes for PT. IPM. The distance to be taken is as far as 6,010 kilometers with transportation cost of Rp. 46,630,527. The resulting distance saving is 22% (1,690.9 km), while the transportation cost savings that occur is 38% or Rp. 28,494,021.

scholarly journals Penerapan Metode Saving Matrix Dan Algoritma Nearest Neighbor Dalam Menentukan Rute Distribusi Untuk Meminimalkan Biaya Transportasi Pada PT. XYZ

2021 ◽  
Vol 4 (2) ◽  
pp. 91
Author(s):  
Viva Arfana Perdana ◽  
Zenny Fatimah Hunusalela ◽  
Aliffia Teja Prasasty
Keyword(s):  
Matrix Method ◽  
Mineral Water ◽  
Nearest Neighbor ◽  
Cost Data ◽  
Nearest Neighbor Algorithm ◽  
Distribution Costs ◽  
Initial Cost ◽  
Distribution Process ◽  
The Cost ◽  
Distribution Cost

PT. XYZ is a business entity engaged in the production of mineral water. In the distribution process, the company still has an obstacle that is an unstructured shipping scheme that causes waste of transportation costs in some areas.  This problem is caused by limited vehicle facilities so that the distance traveled for delivery of goods is longer. This study uses Saving Matrix method and nearest neighbor algorithm calculation of the phenomenon, this research was conducted to analyze distribution costs to be more efficient. neighbor. The result of this study is the company's distribution cost data of Rp. 18,940,924/month after done the cost of distribution into and with saving matrix method and Nearest Neighbor algorithm so save 16% which is Rp. 16.302.392 / month from the initial cost proposed from the company.PT. XYZ meruapakan sebuah badan usaha yang bergerak di bidang produksi air mineral. Di dalam proses distribusinya, perusahaan ini masih memiliki sebuah kendala yaitu skema pengiriman yang tidak terstruktur yang menyebabkan pemborosan biaya transportasi di beberapa daerah.  Permasalahan ini di sebabkan oleh fasilitas kendaraan yang terbatas sehingga jarak yang ditempuh untuk pengiriman barang semakin panjang. Penelitian ini menggunakan metode Saving Matrix dan perhitungan algoritma Nearest Neighbor Dari fenomena tersebut, penelitian ini dilakukan untuk melakukan analisa biaya distribusi agar lebih efrisien. neighbor. Hasil dari penelitian ini adalah data biaya distribusi perusahaan sebesar Rp. 18.940.924/bulan setelah dilakukan biaya distribusinya menjadi serta dengan metode Saving Matrix dan algoritma Nearest Neighbor jadi lebih menghemat 16% yaitu sebesar Rp. 16.302.392 / bulan dari biaya awal yang diusulkan dari perusahaan.

scholarly journals Deteksi Batik Parang Menggunakan Fitur Co-Occurence Matrix Dan Geometric Moment Invariant Dengan Klasifikasi KNN

2016 ◽  
pp. 40
Author(s):  
Ni Luh Wiwik Sri Rahayu Ginantra
Keyword(s):  
Matrix Method ◽  
Nearest Neighbor ◽  
Texture Features ◽  
Sufficient Information ◽  
K Nearest Neighbor ◽  
Moment Invariant ◽  
The Public ◽  
Geometric Moment ◽  
Visual Identification ◽  
Occurrence Matrix

Batik motifs are the base or the blueprint of batik patterns which serve as the core of the batik image design, and therefore the meaning of a sign, symbol or logo in a batik work can be revealed through its motifs. Visual identification requires visual skills and knowledge in classifying patterns formed in a batik image. Lack of media providing information on batik motifs makes the public unable to have sufficient information about batik motifs. Looking at this phenomenon, this study is conducted in order to perform visual identification using a computer that can assist and facilitate in identifying the types of batik. The methods used for batik image recognition are the Co-occurrence Matrix method to provide extraction of batik texture features, and the Geometric Moment Invariant method, while K Nearest Neighbor is used to classify batik images. The results on the accuracy values obtained reveal that the of 80%, compared to the accuracy value result using the Co-occurrence Matrix method that is 70%.  

scholarly journals CONSTRUCTING THE CRITICAL CURVE FOR A SYMMETRIC TWO-LAYER ISING MODEL

2004 ◽  
Vol 03 (02) ◽  
pp. 217-224 ◽  
Author(s):  
M. GHAEMI ◽  
B. MIRZA ◽  
G. A. PARSAFAR
Keyword(s):  
Critical Temperature ◽  
Ising Model ◽  
Numerical Method ◽  
Critical Points ◽  
Transfer Matrix Method ◽  
Matrix Method ◽  
Nearest Neighbor ◽  
Neighbor Interaction ◽  
Ising Ferromagnet ◽  
Shift Exponent

A numerical method based on the transfer matrix method is developed to calculate the critical temperature of two-layer Ising ferromagnet with a weak inter-layer coupling. The reduced internal energy per site has been accurately calculated for symmetric ferromagnetic case, with the nearest neighbor coupling K1=K2=K (where K1 and K2 are the nearest neighbor interaction in the first and second layers, respectively) with inter-layer coupling J. The critical temperature as a function of the inter-layer coupling [Formula: see text], is obtained for very weak inter-layer interactions, ξ<0.1. Also a different function is given for the case of the strong inter-layer interactions (ξ>1). The importance of these relations is due to the fact that there is no well tabulated data for the critical points versus J/K. We find the value of the shift exponent ϕ=γ is 1.74 for the system with the same intra-layer interaction and 0.5 for the system with different intra-layer interactions.

scholarly journals Identification Material Distribution Process to Improve Material Handling Performance Using Risk Matrix Analysis (Case Study at Paper Manufacturing)

2021 ◽  
Vol 45 (5) ◽  
pp. 369-378
Author(s):  
Ery Sugito ◽  
Rika Ampuh Hadiguna ◽  
Rizki Prakasa Hasibuan
Keyword(s):  
Lean Manufacturing ◽  
Material Handling ◽  
Product Distribution ◽  
Matrix Analysis ◽  
Value Stream Mapping ◽  
Risk Matrix ◽  
Additional Material ◽  
Paper Manufacturing ◽  
Distribution Process ◽  
Production Area

Material handling activities within a company have a very important role, especially in warehousing activities ranging from the process of receiving goods, storing goods to product distribution. To reduce the waste that occurs in material handling, a lean manufacturing approach is used with the Value Stream Mapping (VSM) method for mapping the flow of material handling activities and the flow of information on material handling activities. Waste that occurs in the material handling work process in the printing sheets area includes waiting, excess processing, and transportation. With Root Cause Analysis and Risk Matrix, it is known that the most influential root causes of waste are inadequate human resources, material handling tools in preparing goods and process break quantity from standard pallets, and distribution of areas far from the printing sheets warehouse area. Recommendations for improvement proposals offered are, providing additional material handlers, material handling tools for activities within one department by considering distance and time, reducing break quantity requests and temporary locations for receiving printing sheets in the production area, as well as collaborating with suppliers to arrange the arrival schedule of printing sheets material by communicating and updating regularly with the forwarder if the frequency of delays is too frequent. So that if it is repaired and applied it will improve the performance of the material handling.

scholarly journals Proposed Customer-based Brand Equity (CBBE) Strategy for Railway Courier Service – Case Study: Rail Express of PT Kereta Api Indonesia

2021 ◽  
Vol 6 (1) ◽  
pp. 1-5
Author(s):  
Fahmi Aulia Rahman ◽  
Nita Garnida
Keyword(s):  
Brand Equity ◽  
Brand Image ◽  
Low Cost ◽  
Distribution Channel ◽  
Product Distribution ◽  
Brand Awareness ◽  
Target Market ◽  
Integrated Marketing ◽  
Railway Transportation ◽  
Courier Service

PT Kereta Api Indonesia (KAI) is a railway transportation service provider in Indonesia. In 2019, KAI launched railway courier service to support logistic sector, called Rail Express. Despite the advantages of railway courier service in providing low-cost fee and minimum risk of time delay and accident, low market penetration indicates brand awareness in the market is still very low. The main objective of this study is to develop customer-based brand equity strategy for railway courier service, by using Rail Express as the case to carry out the research. This study used a series of qualitative method research to fully comprehend the business situation and propose the solution to the business problem. First, in-depth interviews were conducted to the management and staff of KAI to assess external and internal environments of railway courier service. Second, focus group discussions were conducted to gain consumers’ insight related to brand awareness and brand image of Rail Express. The discussion was attended by 16 participants that represent Rail Express target market of e-commerce buyer and seller. Third, this study used TOWS matrix to generate business solution alternatives based on previous analysis findings. As the result, this study formulated three main strategies to build customer-based brand equity: first, integrated marketing communication to establish brand awareness by increasing brand recall and brand recognition; second, brand repositioning to establish brand image by developing brand associations related to positive image and technology; and third, improvement on existing marketing mix, i.e., product, distribution channel, and price strategies.

Sign in / Sign up

Export Citation Format

Share Document