Analisis Rute Terpendek Reseller Knalpot Untuk Efisiensi Biaya Transportasi Menggunakan Algoritma Dijkstra (Studi Kasus: Reseller Knalpot Di Kota Purbalingga)

Latif, Windar Al Rosyid (2021) Analisis Rute Terpendek Reseller Knalpot Untuk Efisiensi Biaya Transportasi Menggunakan Algoritma Dijkstra (Studi Kasus: Reseller Knalpot Di Kota Purbalingga). Undergraduate Thesis thesis, Institut Teknologi Telkom Purwokerto.

[img] Text
1. Cover.pdf

Download (695kB)
[img] Text
2 Abstract.pdf

Download (215kB)
[img] Text
3. Abstrak.pdf

Download (216kB)
[img] Text
4. BAB I.pdf

Download (313kB)
[img] Text
5. BAB II.pdf

Download (354kB)
[img] Text
6. BAB III.pdf

Download (237kB)
[img] Text
7. BAB IV.pdf
Restricted to Registered users only

Download (393kB) | Request a copy
[img] Text
8. BAB V.pdf

Download (292kB)
[img] Text
9. Daftar Pustaka.pdf

Download (356kB)

Abstract

Retailing is an activity of reselling goods from suppliers to consumers, retailers can run well on the condition that there are suppliers and consumers. The supplier here is the production workshop and the consumer is the production workshop. In the process of taking goods from home to several suppliers, resellers still do not have a minimum travel route to be followed in terms of cost efficiency of distribution transportation. The Traveling Salesman Problem (TSP) is the shortest distance, the fastest time with a method that can minimize distribution costs. The research was conducted by measuring the distance traveled. Determination of distance and coordinates using google maps. Data processing and analysis using the djiktra algorithm method. Research data obtained using interviews with exhaust resellers in Purbalingga Regency. The variable data used are reseller houses and exhaust workshops. This study aims to produce a minimum route of exhaust reseller travel in the process of picking up goods from subscription production workshops for cost efficiency. The results of the implementation of the dijkstra algorithm in this study resulted in a minimum distance of 52 KM at a cost of Rp. 37,397. The results show that the djiktra algorithm method can be applied in the application of calculating mileage and for calculating distribution costs estimates. Keyword: Reseller, Google Maps, Algoritma Djiktra, Travelling Salesman Problem (TSP), graph.

Item Type: Thesis (Undergraduate Thesis)
Subjects: T Technology > T Technology (General)
Divisions: Faculty of Informatics > Informatics Engineering
Depositing User: pustakawan ittp
Date Deposited: 21 Mar 2022 06:33
Last Modified: 21 Mar 2022 06:33
URI: http://repository.ittelkom-pwt.ac.id/id/eprint/7129

Actions (login required)

View Item View Item