RESEARCH ARTICLE | JULY 25 2023

Dijkstra algorithm to find shortest path of tourist destination

in the border area of Indonesia – Timor Leste 
Krisantus J. Tey Seran  ; Leonard Peter Gelu; Yoseph P. K. Kelen; Anastasia Kadek Dety Lestari;
Darsono Nababan; Risald; Hevi Herlina Ullu; Desman Henukh

AIP Conference Proceedings 2798, 020002 (2023)

https://doi.org/10.1063/5.0154461

CrossMark

 
View Export
Online Citation

02 August 2023 12:44:11

 Dijkstra Algorithm to Find Shortest Path of Tourist
Destination in the Border Area of Indonesia – Timor
Leste
Krisantus J. Tey Serana), Leonard Peter Gelub), Yoseph P K Kelenc), Anastasia
Kadek Dety Lestarid), Darsono Nababane), Risaldf), Hevi Herlina Ullug), Desman
Henukhh)

Department of Information and Technology, University of Timor, Kefamenanu, Indonesia

a)
Corresponding author: krisantusteyseran@unimor.ac.id
b)
petergelu@unimor.ac.id
c)
yosepkelen@unimor.ac.id
d)
anastasiakadek@unimor.ac.id
e)
darsono.nababan@unimor.ac.id
f)
rizal@unimor.ac.id

02 August 2023 12:44:11

g)
heviherlina@unimor.ac.id
h)
desmanhenukh7@gmail.com

Abstract. Tourist attractions are very popular with today's society, especially on weekends and holidays. This activity
aims to enjoy a new environment and take a break from the hectic world for a short time. Many tourist attractions can be
found on the island of Timor, particularly in the border areas of the Republic of Indonesia (RI) and Timor Leste (RDTL),
particularly in Belu Regency and North Central Timor. The issue is that there is still a lack of information about the
locations of tourist attractions in these two districts, as well as the distance to be traveled by tourists from their point of
origin to their destination. Seeing this issue, this study created a Geographic Information System (GIS) that can
accurately describe the geographical location of a tourist attraction. In this study, a GIS website was created using
Dijkstra's Algorithm, which can assist in determining the shortest distance between the starting point (origin) and the
endpoint (destination). As a result of using this algorithm, a tourist can find information about the location of tourist
attractions as well as the shortest distance between the starting point of the trip and the endpoint of the trip, namely the
destination tourist spot.

Keywords: Geographic Information System, Dijkstra's Algorithm. Tourist

INTRODUCTION

Belu Regency and North Central Timor are two regencies that are growing in the tourism industry. Belu Regency
and North Central Timor have numerous tourist attractions with natural, cultural, historical, and religious nuances.
Its geographical location, which is directly adjacent to the State of Timor Leste, is increasingly enticing tourists to
participate in tourism activities in these two districts. However, there are several impediments to tourism activities,
such as a lack of information about tourist attractions in Belu Regency and North Central Timor. This is due to a
lack of knowledge about the location, facilities, and infrastructure. Because of this limitation, not all tourists from
Belu Regency, North Central Timor, or other regencies are aware of the tourist attractions in these two regencies. As
a result, the community requires information at this time, one of which is geographic information regarding the
location of tourist attractions [1], [2]. GIS technology (Geographical Information System)/Geographic Information

International Conference of SNIKOM 2021

AIP Conf. Proc. 2798, 020002-1–020002-6; https://doi.org/10.1063/5.0154461
Published by AIP Publishing. 978-0-7354-4598-7/$30.00

020002-1
System (GIS) is a highly developed geography technology [3], [4]. GIS excels at data visualization. GIS technology
can be built on the web with the advancement of internet technology [5], [6]. Web GIS is a type of website that
describes geographic information about a specific area, such as Timor Tengah Utara and Belu Districts. Dijkstra's
Algorithm is one of the algorithms used in this study to find the shortest route . This algorithm is a graph search
algorithm that solves the single-source shortest path problem, in which Dijkstra examines and compares each path to
find the shortest path from one start vertex [7], [8]. Dijkstra, on either side, can be modified to find the shortest path
from each vertex [9]. Dijkstra can have a lower time complexity for a sparse graph, which is a graph with fewer
edges than V2 [10]. In this study, information about tourism objects in Belu Regency and TTU will be presented in a
more interesting format, namely data based on Geographic Information Systems (GIS). It is hoped that by presenting
data in this manner, more tourists will be interested in visiting these two districts. The information system developed
in this study can help publish and inform tourists about tourist attractions and locations both within and outside the
Belu and TTU Regencies by using the Dijkstra algorithm to show the shortest route from tourists' starting points to
tourist destinations.

METHODS

The Dijkstra algorithm was used in this study to search for tourist attraction locations in Belu and North
Central Timor using data from the creation of a web-based geographic information system mapping search.
The process of calculating and determining distance begins with the tourist's starting point, as well as the
tourist's starting point to a predetermined tourist destination. The system then searches for the nearest point and
calculates the distance between points until it reaches the destination point (the tourist location you are looking
for). A flowchart is used to depict the process flow.

Input Starting Point and Read route history based on position

Start
Destination displacement from starting point to destination

02 August 2023 12:44:11

calculate the distance between pair of points
Assign variable values to each Paint of Pairs Determine the Temporary Minimum Distance
Using Dijktra's Algorithm

Yes

Eliminating the Pair of Points with the Largest Finding the Next Point with the Nearest Distance Any Other
No End
Distance from the Destination Points?

.
FIGURE 1. Shortest Distance Determination Process Flowchart
Dijkstra's algorithm finds the smallest weight between two nodes. Dijkstra computes the trajectory based on the
shortest distance traveled by each city. A graph and adjacency matrix is one of the components of the Dijkstra
algorithm. G = G (V.E). A graph is defined geometrically as a set of vertices in a bidimensional (two-dimensional)
plane connected by a set of lines (sides). As a constituent of the adjacency matrix, there is a main component, which
is the trajectory.

e1 = (V0, V1), e2 = (V1, V2), …., en = (Vn-1, V1) (1)

2 5
3
1 2 3 4 5
1
4
3 1 0, 3, ∞, 8, ∞
8 7 2 3, 0, 5, ∞, 4
4 3 ∞, 5, 0, 4, 7
5 4
4 8, ∞, 4, 0, 2
2
5 ∞, 4, 7, 2, 0

FIGURE 2. Weighted graph

020002-2
 For that G = (V, E). V represents the vertex/node. E represents edges. V = {V1, V2, V3, …. Vn} also includes n
nodes. Neighborhood matrix for a directed graph. A = (aij) nxn is described in the equation:

∞,(𝑉𝑉𝑖𝑖 ,𝑉𝑉𝑗𝑗 )∉𝐸𝐸

𝑎𝑎𝑖𝑖𝑖𝑖 = � , 𝑖𝑖, 𝑗𝑗 = 1,2, … . , 𝑛𝑛 (2)
𝑊𝑊𝑖𝑖𝑖𝑖 ,�𝑉𝑉𝑖𝑖 ,𝑉𝑉𝑗𝑗 �∈𝐸𝐸

While states that there is no edge between Vi and Vj, Wij is the weight of the edges. L denotes the set of endpoints
that have found the shortest path from the starting point. (V-L) denotes the combination of nodes that were not
calculated during the process of determining the shortest route. To store network information, use the adjacency
matrix W. The weight of the line <Vi, Vj> is denoted by Wij. If it is discovered that Vi and Vj have no relationship,
it is changed to. The weight from the starting point to the Vi node is denoted by Di. Set the starting point to ds = 0
and Di = Csi. W(I,j) contains line weights from the starting point to the endpoint of a graph that is interconnected.
The initial point is I and the final point is j. V(G) – L = Va, Vb, Vc,..., Vn – = Va, Vb, Vc,..., Vn
To find out which node has been selected in the calculation process use (2). During Vn\notinL:
1. Choose the point Vk V-L with the smallest D(k) value
2. For every Vj V-L, do
(D(j), (D(k) + W(k,j))
If (D(j) > D(k) + W(k,j))
In the next iteration replace the seed value D(j) with (D(k) + W(k,j)

RESULTS AND DISCUSSION

The table below shows data from the Tourism Offices of Belu Regency and North Central Timor on the location
of tourist attractions in these two regencies. This table contains the name of the tourist location, its address, and the

02 August 2023 12:44:11

naming of the point on the map, for example, L1 states the location of the Kefamenanu City Park, which is used as
the starting point (zero points) to the tourist sites in these two districts.
TABLE 1. Tourist attraction
Point Name
Name Object Address On
Picture
Gua Bitauni Kefamenanu, Kelurahan Bitauni, Kecamatan Insana L2

Fulan Fehan Jl. Loro Lamaknen Manuaman, L3

Atambua Belu, Nusa Tenggara Timur
Benteng Tujuh Lapis Diru Lamaknen Kabupaten Belu, Nusa Tenggara Timur L4

Pantai Pasir Putih Jl. Nasional Trans Timor Belu, Nusa Tenggara Timur, Indonesia L5

Pantai Sukaerlaran Kenebibi, Kakuluk Mesak, Belu, Nusa Tenggara Timur L6

Pantai Berluli Berluli, Desa Dualaus, Kecamatan Kakuluk Mesak, Kab. Belu L7
Mangrove kolam Jl. Teluk Gurita Dualaus Kakuluk Mesak, Belu, NTT L8
Susuk
Pantai Wini Kel. Humusu C, Kec. Insana Utara, Kab. Timor Tengah Utara L9

Tanjung Bastian Kel. Humusu C, Kec. Insana Utara, Kab. Timor Tengah Utara L10
Bukit Tuamese Tuamese, Biboki anleu, Kab. Timor Tengah Utara. Nusa Tenggara L11
Timur
Patung Bunda Maria Jl. Teluk Gurita Dualaus Kakuluk Mesak, Belu, NTT L12
Gunung mutis Kefamenanu, Desa Noepesu, Kecamatan Miomafo Barat L13
Oeluan Nusa Tenggara Timur, Timor Tengah Utara, Noemuti L14

020002-3
 FIGURE 3. Tourist Destinations Map
A graph with the distance between the points can be created using the map above, as shown in the image below.

02 August 2023 12:44:11

FIGURE 4. Connecting graph
Following the creation of the graph, the calculation employs Dijkstra's Algorithm. The case study will compute the
distance from L1 (Taman Kota) to tourist attractions L12, namely the Statue of Our Lady at Jl. teluk Gurita Dualaus
Kakuluk Mesak, Belu Regency. This is how the calculation works:
TABLE 2. Distance Between Tourist Locations
Number of Cities 14
Start Location L1
Stop Location L12
From L1 to L14 Distance
L1 L2 30
L1 L13 80
L1 L14 23
L1 L9 46
L2 L3 86
L2 L7 75
L2 L8 74
L3 L4 1
L3 L5 53
L4 L5 54

020002-4
 Continues
L5 L6 2
L6 L7 11
L7 L8 5
L8 L11 33
L8 L12 4
L9 L10 7
L10 L11 27
TABLE 3. Calculation of Dijkstra's Algorithm

Location
L1 L2 L3 L4 L5 L6 L7 L8 L9 L10 L11 L12 L13 L14
(0,-)0 (∞,-)0 (∞,-)0 (∞,- (∞,- (∞,- (∞,-)0 (∞,-)0 (∞,- (∞,- (∞,-)0 (∞,-)0 (∞,- (∞,-
)0 )0 )0 )0 )0 )0 )0
L1 0,L1 30,L1 ∞ ∞ ∞ ∞ ∞ ∞ 46,L1 ∞ ∞ ∞ 80,L1 23,L1
L2 30,L1 ∞ ∞ ∞ ∞ ∞ ∞ ∞ ∞ ∞ ∞ ∞ ∞
L9 46,L1 ∞ ∞ ∞ ∞ ∞ ∞ ∞ ∞ ∞ ∞ ∞ ∞
L2 116,L2 ∞ ∞ ∞ 105,L2 104,L2 ∞ ∞ ∞ ∞ ∞ ∞
L9 ∞ ∞ ∞ ∞ ∞ ∞ 53,L9 ∞ ∞ ∞ ∞
L8 ∞ ∞ ∞ ∞ ∞ ∞ ∞ 108,L8 ∞ ∞
L10 ∞ ∞ ∞ ∞ ∞ 80,L10 ∞ ∞ ∞

02 August 2023 12:44:11

L11 113,L11 ∞ ∞ ∞ ∞ ∞ ∞
L12 ∞ ∞ ∞ 117,L8 ∞ ∞

The total distance obtained from the calculations in tables 2 and 3 is 108 kilometers. With the following
information: The starting point (L1) is Kefamenanu City Park (0 KM), followed by a 30 KM journey to Bitauni
Cave (L2). Then travel 74 kilometers to Octopus Bay. Then, walk 4 kilometers to the Statue of Our Lady (L12). So,
0 + 30 + 74 + 4 = 108 is the direct calculation.

CONCLUSION

Based on the study's findings, the following conclusions were reached:

1. Creating a web-based information system using the Dijkstra algorithm to search for the shortest route to tourist
objects in Belu Regency and North Central Timor is one of the right ways to make it easier for tourists to search
for tourist attraction information in Belu Regency and North Central Timor.
2. Tourists can calculate the shortest route from one tourist attraction to another by entering the initial and final
locations of the tourist attraction on the tourist location page of the tourist attraction information system in Belu
Regency and North Central Timor, which will be processed using the Dijkstra Algorithm.
3. Tourists can find the distance, description, and facilities in the map section of the tourist location map of Belu
Regency and North Central Timor's tourist attraction information system.

REFERENCES

1. Y. R. Kaesmetan and M. V. Overbeek, “Ant Colony Optimization for Traveling Tourism Problem on
Timor Island East Nusa Tenggara.” p. 2020.
2. A. A. G. PUTRA, T. OSAWA, and M. S. MAHENDRA, “OIL SPILL DETECTION USING MODIS
DATA ;CASE STUDY : OIL POLLUTION AT TIMOR SEA).” .
3. F. Zhang and N. Cao, “Application and Research Progress of Geographic Information System (GIS) in
Agriculture.” 2019.

020002-5
4. T. Setiadi, A. Pranolo, M. Aziz, S. Mardiyanto, and B. Hendrajaya, “A Model of Geographic Information
System using Graph Clustering Methods.” 2017.
5. Y. Jiamin, Z. Hua, L. Shuai, W. Zhonghao, and X. Wencheng, “Application of Open Source GIS
Technology in Seismic Analysis and Forecasting System.” 2017.
6. Y. Ariyanti, R. A. Yuana, and A. Budianto, “Web-Based Geographic Information System for School
Mapping and Disaster Mitigation.” 2018.
7. N. Makariye, “Towards Shortest Path Computation using Dijkstra Algorithm.” .
8. J. R. Giralt, A. Commike, P. Cullen, and R. Lethin, “Accelerating Dijkstra’s Algorithm Using
Multiresolution Priority Queues.” 2018.
9. Y. Zhang, J. Yang, J. Ponce, and H. Kong, “Dijkstra model for stereo-vision based road detection: A non-
parametric method.” 2018.
10. M. LUO, X. HOU, and A. J. YANG, “Surface Optimal Path Planning Using an Extended Dijkstra
Algorithm.” 2020.

02 August 2023 12:44:11

020002-6