Article Per Year (5 Year)
p-Index From 2021 - 2026
0.23
P-Index
This Author published in this journals
All Journal International Journal Software Engineering and Computer Science (IJSECS)
Fadillah Amanah
State University of Medan
Computer Science & IT

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

Found 1 Documents
Search

 1 
Dijkstra Algorithm-Based Shortest Path Optimization for Multi-Destination Tourism Routes in Samosir Regency: A Google Maps-Driven Case Study Yesy Simanjuntak; Fadillah Amanah; Suvriadi Panggabean
International Journal Software Engineering and Computer Science (IJSECS) Vol. 6 No. 2 (2026): AUGUST 2026
Publisher : Lembaga Komunitas Informasi Teknologi Aceh (KITA), Indonesia

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.35870/ijsecs.v6i2.7604

Abstract

Samosir Regency offers various natural and cultural tourism destinations distributed across several sub-districts. The distribution of these destinations and their road connections can make it difficult for visitors to determine efficient travel routes. This study aimed to determine the shortest route from Tano Ponggol to Hadabuan Nasogo Waterfall using a weighted graph approach and Dijkstra's algorithm based on distance data obtained from Google Maps. Nine tourist attractions were modeled as vertices and thirteen connecting routes as weighted edges representing travel distances for four-wheeled vehicles. Distance data were collected from Google Maps in April 2025 and processed using Dijkstra's algorithm. The results showed that the shortest route was A→B→D→E→H→I, with a total distance of 100.1 km and six of the nine attractions included in the route. Compared with the sequential baseline route that passes through all nine destinations (A→B→C→D→E→F→G→H→I), the shortest route reduced the travel distance by 31.6 km (24%) and the estimated travel time by 1 hour and 3 minutes (27%). However, the shorter route bypassed three attractions (C, F, and G), showing that a shortest-path approach does not ensure coverage of all tourism destinations. Dijkstra's algorithm is therefore suitable for determining the shortest route between a selected source and destination, while tourists who intend to visit multiple destinations may require a multi-stop optimization approach, such as the Traveling Salesman Problem. The findings provide a route recommendation for tourism travel in Samosir Regency and illustrate the need to select an optimization method according to the intended travel objective.
Co-Authors Suvriadi Panggabean Yesy Simanjuntak