Article Sidebar

Submitted
Jun 8, 2023
Accepted
Dec 4, 2023
Published
Dec 31, 2023
Download
PDF
Statistic
Read Counter : 80 Download : 72

Downloads

Download data is not yet available.

Main Article Content

Abstract

Pilgrimages to the graves of Waliyullah and the spreaders of Islam have become spiritual or religious tourism for Muslims in Java and even almost all Muslims in Indonesia. This opens up opportunities for travel agents to help pilgrims on religious tourism trips. One travel agency that offers religious tour packages is PT Mitra Jaya Group which operates in the Banyuwangi area, East Java. Many travel agencies are trying to increase their competitiveness, to survive competition between travel agencies, especially in improving services and financial management. One way that can be done is to determine the shortest route for religious tourism so that the distance traveled is minimal, where previously the route chosen was not based on proper research. In this paper, the search for the shortest route is carried out by applying the Dijkstra algorithm. The application of the Dijkstra algorithm can provide benefits regarding the shortest distance to religious tourism routes from PT Mitra Jaya Group. From the analysis results, the total shortest distance obtained was 2768.8 kilometers. The resulting shortest route distance is smaller than the distance before using the Dijkstra algorithm, namely 3005.6 kilometers. The difference is 236.8 kilometers and there is a distance saving of 7.87

Keywords

Shortest Route Dijkstra's Algorithm Grave Pilgrimage

Article Details

Creative Commons License

This work is licensed under a Creative Commons Attribution 4.0 International License.

Copyright Notice

Authors who publish with this journal agree to the following terms:

Authors retain copyright and grant the Jurnal Ilmiah Pendidikan Matematika Al Qalasadi of first publication with the work simultaneously licensed under a Creative Commons Attribution License (CC BY 4.0) that allows others to share the work with an acknowledgment of the work's authorship and initial publication in this journal.
Authors are able to enter into separate, additional contractual arrangements for the non-exclusive distribution of the Jurnal Ilmiah Pendidikan Matematika Al Qalasadi published version of the work (e.g., post it to an institutional repository or publish it in a book), with an acknowledgment of its initial publication in this journal.
Authors are permitted and encouraged to post their work online (e.g., in institutional repositories or on their website) prior to and during the submission process, as it can lead to productive exchanges, as well as earlier and greater citation of published work (See The Effect of Open Access)

How to Cite
Santoso, K. A., Afifah, Z., & Halikin, I. (2023). Penerapan Algoritma Dijkstra dalam Pencarian Rute Terpendek Wisata Religi. Jurnal Ilmiah Pendidikan Matematika Al Qalasadi, 7(2), 162-170. https://doi.org/10.32505/qalasadi.v7i2.6227

References

  1. Bilangan, T. (2004). Teori Bilangan ( Number Theory ) Departemen Teknik Informatika Institut Teknologi Bandung.
  2. Chu, S. (2007). COMPUTATIONAL INTELLIGENCE BASED ON THE BEHAVIOR OF. 3(1), 163–173.
  3. Kiswara Agung Santoso, Reggy Valentinnes Septa Jeniusa, & Kusbudiono Kusbudiono. (2022). DESAIN JARINGAN INTERNET INDIHOME DI PERUMAHAN MANGGAR PERMAI AMBULU MENGGUNAKAN ALGORITMA K-MEANS DAN KRUSKAL. PROSIDING SENA-MAGESTIK, 1(1), 405–417. https://jurnal.unej.ac.id/index.php/prosiding/article/view/33530
  4. Komarullah, H., Halikin, I., & Santoso, K. A. (2022). On the Minimum Span of Cone, Tadpole, and Barbell Graphs. Advances in Computer Science Research. https://doi.org/10.2991/acsr.k.220202.009
  5. Lopes, I., & Oliveira, P. (2014). Understanding information security culture: A survey in small and medium sized enterprises. Advances in Intelligent Systems and Computing, 275 AISC(VOLUME 1), 277–286. https://doi.org/10.1007/978-3-319-05951-8_27/COVER
  6. Maulana, N. R., Wijaya, K., & Santoso, K. A. (2018). POLINOMIAL KROMATIK PADA GRAF KIPAS. Majalah Ilmiah Matematika Dan Statistika, 18(2), 55. https://doi.org/10.19184/mims.v18i2.17248
  7. Prihandini, R. M., Dafik, Agustin, I. H., Alfarisi, R., Adawiyah, R., & Santoso, K. A. (2019). On super (a; D) - P2 B H- antimagic total labeling of disjoint union of comb product graphs. Journal of Physics: Conference Series, 1211(1). https://doi.org/10.1088/1742-6596/1211/1/012012
  8. Santoso, K. A., Agustin, I. H., & Prihandini, R. M. (2020). The modification of caesar cryptosystem based on binary vertices colouring. Journal of Physics: Conference Series, 1538(1), 012006. https://doi.org/10.1088/1742-6596/1538/1/012006
  9. Santoso, K. A., Dafik, Agustin, I. H., Prihandini, R. M., & Alfarisi, R. (2019). Vertex colouring using the adjacency matrix. Journal of Physics: Conference Series, 1211(1). https://doi.org/10.1088/1742-6596/1211/1/012019
  10. Santoso, K. A., Setiawan, B. A., & Kusbudiono, K. (2022). Application of Genetic Algorithm on Inclusive Labeling of a Graph. InPrime: Indonesian Journal of Pure and Applied Mathematics, 4(1), 24–32. https://doi.org/10.15408/inprime.v4i1.24327
  11. Sumarno, D. B., Dafik, D., & Santoso, K. A. (2015). Super (a, d)-Edge Antimagic Total Labeling of Connected Ferris Wheel Graph. Jurnal ILMU DASAR, 15(2), 123. https://doi.org/10.19184/jid.v15i2.1051