Article Per Year (5 Year)
p-Index From 2021 - 2026
0.408
P-Index
This Author published in this journals
All Journal Jurnal Pariwisata Nusantara
Krissinta Bulan Wardhani
Universitas Mataram
Social Sciences

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

Found 2 Documents
Search

 1 
Comparative Analysis of Bellman-Ford and Dijkstra Algorithms to Determine the Shortest Tourist Path in Central Lombok Krissinta Bulan Wardhani; Gusti Yoga Nanda Karang; Septi Fajria; Muhammad Imam Al Paqih; Rida Akausar Hardi; M. Setyo Nugroho; Mamika ujianita Romdhini
Jurnal Pariwisata Nusantara (JUWITA) Vol. 4 No. 1 (2025): Jurnal Pariwisata Nusantara (JUWITA)
Publisher : PROGRAM STUDI PARIWISATA SYARAH, FAKULTAS EKONOMI DAN BISNIS ISLAM, UNIVERSITAS ISLAM NEGERI MATARAM

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.20414/juwita.v4i1.13155

Abstract

Purpose: Central Lombok Regency has many tourist attractions spread out, which often makes it difficult for tourists to determine the best travel route to visit several locations at once. Choosing the shortest route is an important factor because it can save time, energy, and fuel costs, especially in tourist trips with unstructured schedules. Therefore, an effective method is needed to determine the shortest route to improve the efficiency of tourist trips. This study analyzes the shortest route to tourist attractions in Central Lombok Regency using two popular graph algorithms, including Dijkstra Algorithm and Bellman-Ford Algorithms Method: In this study, the data used are 6 tourist attractions in Central Lombok Regency. Tourist attractions are represented by points on the graph. Then the edge represents the road connecting the tourist attractions and the weight represents the distance to each tourist attraction from a starting point. Then to determine the minimum shortest distance of each tourist attraction based on the graph, Dijkstra and Bellman-Ford algorithms are used. Result: The shortest path to tourist attractions in Central Lombok Regency is obtained based on the Dijkstra and Bellman-Ford Algorithms. Contribution: Through this analysis, the advantages and disadvantages of the two algorithms in the context of determining tourist routes in Central Lombok can be identified.
Optimizing Shuttle Bus Paths at Mandalika Circuit with Dijkstra Algorithm to Support MotoGP Sport Tourism Krissinta Bulan Wardhani; Rabbelia Tri Qudrani; Nafika Fatanaya; Ririn Maulidia; Sarwa Hita; M. Setyo Nugroho; Mamika Ujianita Romdhini
Jurnal Pariwisata Nusantara (JUWITA) Vol. 4 No. 3 (2025): Jurnal Pariwisata Nusantara
Publisher : PROGRAM STUDI PARIWISATA SYARAH, FAKULTAS EKONOMI DAN BISNIS ISLAM, UNIVERSITAS ISLAM NEGERI MATARAM

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.20414/juwita.v4i3.14699

Abstract

Purpose: MotoGP is one of the most popular motorcycle racing events in terms of sport and recreation around the world. To get to the MotoGP venue we have to go through several routes. This route problem can disrupt visitor mobility, make them uncomfortable, and even damage the reputation of the international event. This study aims to develop a system for determining the shortest route for shuttle buses at the Mandalika Circuit by utilizing the Dijkstra algorithm. Method: To determine the shortest route we use an algorithm, one of which is the Dijkstra algorithm. The Dijkstra algorithm is one of the most well-known algorithms for finding the shortest route on a graph network. It can efficiently find the path with the minimum weight from one vertex to another. Result: The results of this study using the manual method with the contribution of the Dijkstra algorithm both produced 5 shortest routes with 2 routes in the green zone, 2 routes in the blue zone and 1 route in the red zone. Contribution: Through this analysis, a solution can be formulated for the shuttle bus route at the Mandalika Circuit in order to support sustainable MotoGP motorcycle racing tourism.
Co-Authors Gusti Yoga Nanda Karang M. Setyo Nugroho Mamika Ujianita Romdhini Muhammad Imam Al Paqih Nafika Fatanaya Rabbelia Tri Qudrani Rida Akausar Hardi Ririn Maulidia Sarwa Hita Septi Fajria