PENERAPAN ALGORITMA A* (STAR) UNTUK MENCARI RUTE TERCEPAT DENGAN HAMBATAN

Widyatama Repository

PENERAPAN ALGORITMA A* (STAR) UNTUK MENCARI RUTE TERCEPAT DENGAN HAMBATAN

Show full item record

Title: PENERAPAN ALGORITMA A* (STAR) UNTUK MENCARI RUTE TERCEPAT DENGAN HAMBATAN
Author: Syukriyah, Yenie; Falahah; Solihin, Hermi
Abstract: Algorithm A* (Astar) is one of the algorithms included in the category of search methods that has an information (informed search method). This algorithm is very good as a pathfinding process (search path). These algorithms look for the fastest route distance to be taken an initial point (starting point) to object to the destination by comparing the values in this algorithm. The calculation of the heuristic function in these simulations using Manhattan distance heuristic function. To explore the behavior of A* algorithm, we build a simulation using Java programming language. The aim of this research is to establish a simulation application of A* Algorithm for finding the fastest route, and we try to implement it into the case of barriers traffic jam. The result shows that the calculation can prove that the route found in this simulation is the route with the best solution which have the smallest value.
URI: http://repository.widyatama.ac.id/xmlui/handle/123456789/7868
Date: 2016-05-28


Files in this item

Files Size Format View
COVER.pdf 57.98Kb PDF View/Open
KATA PENGANTAR.pdf 196.3Kb PDF View/Open
HALAMAN REDAKSI.pdf 58.09Kb PDF View/Open
KOMITE SELISIK 2016.pdf 61.42Kb PDF View/Open
DAFTAR ISI.pdf 223.3Kb PDF View/Open
PAPER YENNY.pdf 670.0Kb PDF View/Open

This item appears in the following Collection(s)

Show full item record