Hadiartha, Bagus Kurniawan Adhi (2021) FOOD EXPRESS BOJA MENGGUNAKAN METODE DJIKSTRA. Undergraduate thesis, Universitas Stikubank.
![[thumbnail of HLM JUDUL]](/style/images/fileicons/application_pdf.png) |
PDF (HLM JUDUL)
Download (594kB) |
|
PDF (ABSTRAK)
Download (32kB) |
|
PDF (BAB I)
Download (433kB) |
|
PDF (BAB II)
Restricted to Repository staff only Download (338kB) |
|
PDF (BAB III)
Restricted to Repository staff only Download (330kB) |
|
PDF (BAB IV)
Restricted to Repository staff only Download (394kB) |
|
PDF (BAB V)
Restricted to Repository staff only Download (23kB) |
|
PDF (BAB VI)
Restricted to Repository staff only Download (146kB) |
|
PDF (DAFTAR PUSTAKA)
Download (12kB) |
|
PDF (LAMPIRAN)
Restricted to Repository staff only Download (765kB) |
Abstract
Penelitian ini dilatar belakangi berdasarkan hasil pengamatan yang masih menggunakan pengetahuan pengantaran jalur panjang. Sehingga dalam pengantaran ini kurang efektif dan efesien. Akibatnya pengiriman membutuhkan waktu yang lama dan boros biaya.Untuk mengatasi masalah yang terjadi, maka dalam hal ini masalah yang dapat dirumuskan adalah bagaimana merancang sistem pengambilan keputusan jalur terpendek dalam pengiriman di kecamatan boja, kabupaten kendal, dan kota semarang dengan menggunakan metode Algoritma Dijkstra.Tujuan yang dicapai dalam penelitian ini menerapkan Metode Algoritma Dijkstra dalam sistem penentuan rute terpendek untuk mebantu memberikan informasi mengenai pemilihan jalur terpendek. Algoritma dijkstra sendiri merupakan algoritma untuk menentukan jarak terpendek Sehingga algoritma ini cocok untuk diimplementasikan ke dalam sistem pencarian rute untuk jasa pengiriman. Hasil dari algoritma dijkstra yaitu dapat membantu saat pengiriman dapat menjadi lebih efesien karena jarak yang ditempuh menjadi lebih pendek serta dapat menghemat waktu dan bahan bakar. This research is based on observations that have delivery services that still use introductory knowledge to determine delivery routes. So this delivery is less effective and efficient. As a result, shipping takes a long time and is wasteful of costs. To overcome the problems that occur above, in this case the problem that can be formulated is how to design an optimization system for the shortest shipping path in Boja sub-district, Kendal district, and Semarang city using the Dijkstra Algorithm method. The objectives achieved in this study apply the Dijkstra's Algorithm Method in the system of determining the shortest route in shipping to help provide information regarding the selection of the shortest path. This route search application uses the dijkstra algorithm as the shortest distance decision making. Dijkstra algorithm is an algorithm to determine the shortest distance. So this algorithm is suitable to be implemented in finding the shortest route for delivery. The result of the dijkstra algorithm is that it can help provide the shortest route from the destination nodes. So that when shipping can be more efficient because the distance traveled becomes shorter and can save time and fuel.
| Item Type: | Thesis (Undergraduate) |
|---|---|
| Additional Information: | SKR.I.05.01.2040 NIM 17.01.53.0018 |
| Uncontrolled Keywords: | Delivery, Dijkstra, rute optimal |
| Subjects: | Q Science > QA Mathematics > QA75 Electronic computers. Computer science |
| Faculty / Institution: | Fakultas Teknologi Informasi > Program Studi Teknik Informatika |
| Depositing User: | Teteh Hayati |
| Date Deposited: | 11 Nov 2021 01:43 |
| Last Modified: | 11 Nov 2021 01:43 |
| URI: | https://eprints.unisbank.ac.id/id/eprint/8045 |
Actions (login required)
 |
View Item |
