PERBANDINGAN ALGORITMA A STAR DAN ALGORITMA DIJKSTRA UNTUK MENENTUKAN RUTE TERPENDEK KANTOR POS DI PROVINSI LAMPUNG

Roro Ayu Martines , Patricia Nuril Hikmah (2023) PERBANDINGAN ALGORITMA A STAR DAN ALGORITMA DIJKSTRA UNTUK MENENTUKAN RUTE TERPENDEK KANTOR POS DI PROVINSI LAMPUNG. FAKULTAS MATEMATIKA DAN ILMU PENGETAHUAN ALAM, UNIVERSITAS LAMPUNG .

[img]
Preview
Text
1. ABSTRAK - ABSTRACT.pdf

Download (7kB) | Preview
[img] Text
2. SKRIPSI FULL.pdf
Restricted to Repository staff only

Download (2MB) | Request a copy
[img]
Preview
Text
3. SKRIPSI TANPA PEMBAHASAN.pdf

Download (1MB) | Preview

Abstract

PT Pos Indonesia is a company engaged in mail and package delivery services. PT Pos Indonesia has problems with late delivery of goods, unsatisfactory post office services and complicated distribution routes. So an optimal route is needed for efficient delivery. The A Star algorithm and the Dijkstra algorithm work with different mechanisms. After conducting research, it was found that the performance of the A Star Algorithm was better than the Dijkstra Algorithm with an average time of 1.83 ms, while the Dijkstra algorithm had an average time of 2.66 ms with 30 experiments. A Star Algorithm and Dijkstra Algorithm provide the same result of optimal route for thirty routes from Kantor Pos Pahoman to 30 destinations. Keywords: Shorth Path Problem, A Star Algorithm, Djikstra Algorithm.

Item Type: Other
Subjects: ?? 500 ??
?? 510 ??
Divisions: Fakultas MIPA > Prodi Matematika
Depositing User: 2301951919 . Digilib
Date Deposited: 27 Jun 2023 07:08
Last Modified: 27 Jun 2023 07:08
URI: http://digilib.unila.ac.id/id/eprint/73194

Actions (login required)

View Item View Item