Design and Implementation of the Shortest Path Navigation in Samosir District using Branch and Bound Algorithm

Design and Implementation of the Shortest Path Navigation in Samosir District using Branch and Bound Algorithm

branch and bound;map;samosir;shortest path;tourist

Samosir has a wide area and several tourist attractions, making it difficult for visitors to explore the island.Not knowing the route can make the journey less fun and waste time.In general, tourists seek to know the fastest path to a tourist location to save time and money while on vacation. As a result, we require an application that will offer directions to the shortest path. This research aims to develop a web-based application that may display a map of the shortest travel to a tourist site. This website will display a map that marks from the origin point to the destination point. The Branch and Bound algorithm is used to determine the shortest path. The Python libraries OSMnx, Folium, and NetworkX modify paths and show a route map with OpenStreetMap. The error value of the distance between the branch, bound algorithm, and Google Maps is used to get the RMSE accuracy value. The RMSE value is 3.02and MAPE value is 0.0023indicating that the application produced already has a good implementation prototype. Furthermore, there is no significant distinction between the appearance of maps implementing OpenStreetMap and Google Maps

Rudy Chandra1, Tegar Arifin Prasetyo2,Ricky Ananda Pardomuan Sitorus3,Pakhomios Havel Situmorang4,Yanti Sopia Ruth Hutasoit5,Trito Exaudi Manik

https://jurnal.iaii.or.id/index.php/RESTI/article/view/5585/922

Department of Information Technology, Faculty of Vocational Studies,Institut Teknologi Del, Sitoluama.Indonesia

21-04-2024

FAJAR BAGUS W

PDF

ENGLISH

TEXT