Open AccessImplementing the Shortest Time Route Search Algorithm in Semarang Using the Best First Search Method
Author(s) -
Nanang Lestio Wibowo,
Catur Edi Widodo,
Kusworo Adi
Publication year - 2020
Publication title -
iop conference series. materials science and engineering
Language(s) - English
Resource type - Journals
eISSN - 1757-899X
pISSN - 1757-8981
DOI - 10.1088/1757-899x/879/1/012165
Subject(s) - shortest path problem , computer science , search algorithm , best first search , path (computing) , point (geometry) , travel time , algorithm , dijkstra's algorithm , mathematical optimization , yen's algorithm , k shortest path routing , linear search , mathematics , beam search , transport engineering , theoretical computer science , engineering , computer network , graph , geometry
The purpose of this research was to find the shortest route so that the search for the destination is more effective and efficient to avoid traffic jams using the best first search method. the best first search method is a search method by selecting the best value from different data. The aim was to find the shortest time route between regions in Semarang using the Best First Search algorithm according to the distance of each region, road width, and traffic density of motorized vehicles to get better time efficiency. Using the best first search usually tries to estimate the distance at the end of the path with a solution. The shortest time search system in the city of Semarang on traffic density, road width to determine the desired time efficiency. Analysis of the Best First Search algorithm by using the output of the path used as input in the search for the shortest route, between the starting point to the destination point. Conducting trials with the software as a result of recording data according to the field. the impact of the system on searching for route research becomes solution for road users to reach their destination a short time.