Medan is the capital of North Sumatra and one of the major cities in Indonesia. In this city there are several tourist destinations that can be visited by the people. When visitors want to travel by visiting several destinations, it will be difficult for visitors to determine the shortest route that can be traversed. And to find out the shortest travel route, a system is required to find the shortest route that visitors can travel through. In this study developed a route search system for the nearest tourist trip to Medan. In this system there is a menu to find routes by providing several tourist destinations in Medan. And in support of the shortest route search process on this system used the Steep Ascent Hill-Climbing algorithm and the Best First Search algorithm. The comparison process will then be carried out between the two algorithms, both from running time and the distance weight generated by the algorithm used. After both algorithms are implemented into the system and tested both algorithms, then obtained the complexity of the Steepest Ascent Hill Climbing algorithm is θ (n5), and the running time value is 59.3856 ms. On the contrary, obtained the Best First θ (n3) algorithm, and the running time value is 54.6669 ms. And from the testing of both algorithms, it can be concluded that the search using the Best First Search algorithm produces a better running time value than the Steepest Ascent Hill Climbing algorithm.
展开▼
