Article Per Year (5 Year)
p-Index From 2019 - 2024
2.517
P-Index
This Author published in this journals
All Journal International Journal of Electrical and Computer Engineering KLIK (Kumpulan jurnaL Ilmu Komputer) (e-Journal) JOIN (Jurnal Online Informatika) Jurnal RESTI (Rekayasa Sistem dan Teknologi Informasi) Jurnal CoreIT BAREKENG: Jurnal Ilmu Matematika dan Terapan International Journal of Computing Science and Applied Mathematics Jurnal Teknologi Informasi dan Pendidikan Indonesian Journal of Electrical Engineering and Computer Science NUCLEUS: Jurnal Sains dan Teknologi Jurnal ComunitA Servizio
Prasetyo, Tegar Arifin
Information Technology, Faculty Of Vocational Studies, Institut Teknologi Del
Humanities Chemistry Computer Science & IT Control & Systems Engineering Economics, Econometrics & Finance Education Electrical & Electronics Engineering Energy Engineering Library & Information Science Materials Science & Nanotechnology Mathematics Mechanical Engineering Nursing Physics Social Sciences Transportation

Published : 17 Documents Claim Missing Document
Claim Missing Document
Check
Articles

Found 1 Documents
Search
Journal : Jurnal RESTI (Rekayasa Sistem dan Teknologi Informasi)

 1 
Design and Implementation of the Shortest Path Navigation in Samosir District using Branch and Bound Algorithm Rudy Chandra; Tegar Arifin Prasetyo
Jurnal RESTI (Rekayasa Sistem dan Teknologi Informasi) Vol 8 No 2 (2024): April 2024
Publisher : Ikatan Ahli Informatika Indonesia (IAII)

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.29207/resti.v8i2.5585

Abstract

Samosir has a large area and several tourist attractions, making it difficult for visitors to explore the island. Unknowing the route can make the journey less fun and waste time. In general, tourists seek to know the fastest way 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 the route 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, the bound algorithm, and Google Maps is used to obtain the RMSE accuracy value. The RMSE value is 3.02 and the MAPE value is 0.0023 indicating that the application produced already has a good implementation prototype. Furthermore, there is no significant distinction between the appearance of maps that implement OpenStreetMap and Google Maps.
Co-Authors Andree Panjaitan Asido Saragih Christian Benedict Lumbantoruan Dame Sisri Haryati Katarina Rumapea Dewi Handayani Ester Saulina Hutabarat Evan Richardo Sianipar Fritz Marpaung Goklas Henry Agus Panjaitan Heni Ernita Lumbangaol Henny Flora Panjaitan Herbeth Augustinus Napitupulu Johan Immanuel Sianipar Joshua Pratama Silitonga Juan Carlos Munthe Juli Yanti Damanik Lawy Xenna Lilis Marito Pardosi Matthew Alfredo Mei Pane Muhammad Isnaini Hadiyul Umam Muhammad Luthfi Hamzah Muhammad Rizki Nathan Fernando Lumban Tobing Nazaruddin Nazaruddin Nico Felix Sipahutar Pasaribu, Monalisa Poibe Leny Naomi Risky Saputra Siahaan Roberd Saragih Romauli Sianipar Rudy Chandra Rudy Chandra Samuel Sibuea Sarbaini Sarbaini SIAGIAN, WESLY MAILANDER Tahan HJ Sihombing Tahan HJ Sihombing Tessalonika Siahaan Timothy Timothy Tiurma Lumban Gaol Togu Novriansyah Turnip Trito Exaudi Manik Veny Siahaan Victor Lambok Desrony Yohana Sihombing Yohanssen Pratama