%0 Generic
%A Roro Ayu Martines , Patricia Nuril Hikmah 
%C  UNIVERSITAS LAMPUNG 
%D 2023
%F eprints:73194
%I FAKULTAS MATEMATIKA DAN ILMU PENGETAHUAN ALAM
%T PERBANDINGAN ALGORITMA A STAR DAN ALGORITMA DIJKSTRA  UNTUK MENENTUKAN RUTE TERPENDEK KANTOR POS  DI PROVINSI LAMPUNG
%U http://digilib.unila.ac.id/73194/
%X 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.