The Determination of Availability Path Planning in Natural Tourist Attractions using Dijkstra's Algorithm and Ant Colony Optimization


  • Heri Gustami Almuslim University, Bireuen Aceh, Indonesia
  • Muhammad Rizal * Mail Almuslim University, Bireuen Aceh, Indonesia
  • Riyadhul Fajri Almuslim University, Bireuen Aceh, Indonesia
  • (*) Corresponding Author
Keywords: Path Planning; Shortest Path; Natural Tourist Attractions; Efficiency; Information Technology

Abstract

The research on determining Availability Path Planning for natural tourist attractions using Dijkstra and Ant Colony algorithms aims to identify the most efficient routes in terms of time, distance, and environmental conditions. This is achieved by combining the Dijkstra and Ant Colony Optimization algorithms, each with its respective advantages and disadvantages, to create a system for finding the shortest, fastest, and safest paths to natural tourist destinations in Bireuen Regency. The methodology employed in this study is the waterfall model, which encompasses stages from analysis to application development, integrating both Dijkstra and Ant Colony Optimization algorithms. The research findings reveal that the shortest route to the Ceuraceu Waterfall destination can be accessed via the Samagadeng Village road in Pandrah District, while the longest route can be accessed through the city center of Bireuen Regency. Furthermore, for the Krueng Simpo River Bathing Tourism, the shortest route is via the Gayo Bireuen road, while the longest route is through the KKA Aceh Utara road. Lastly, the shortest route to the Kuala Jangka Beach tourist attraction is via the Jangka road from the Matangglumpang Dua area, while the longest route can be accessed through the Kuala Bireuen road.

Downloads

Download data is not yet available.

References

Kementerian Sekretariat Negara RI, “Undang-undang Republik Indonesia Nomor 10. Tahun 2009. Tentang kepariwisataan,” Jakarta, 2009.

Riani NK., “Pariwisata adalah pisau bermata 2,” J Inov Penelit, vol. 2, no. 5, pp. 69–74, 2021.

S. C. Hidayatullah AS, Jati AN, “Realization of depth first search algorithm on line maze solver robot,” Int. Conf. Control. Electron. Renew. Energy Commun., pp. 247–51, 2022.

L. Wenzheng, L. Junjun, and Y. Shunli, “An improved Dijkstra’s algorithm for shortest path planning on 2D grid maps,” Int. Conf. Electron. Inf. Emerg. Commun., pp. 438–41, 2021.

Y. Sun, R. Gu, X. Chen, L. Xin, and L. Bai, “Efficient time-optimal path planning of AUV under the ocean currents based on graph and clustering strategy,” Ocean Eng, 2022.

C.-C. Sun, G. Jan, S.-W. Leu, K.-C. Yang, and Y.-C. Chen, “Near-Shortest Path Planning on a Quadratic Surface With O (nlog n) Time,” Sens J., vol. 11, no. 15, pp. 6079–80, 2022.

Harahap MK and Khairina N, “Pencarian Jalur Terpendek dengan Algoritma Dijkstra,” Sink J., vol. 2, no. 2, pp. 18–23, 2020.

A. kelik Nugroho and I. Permadi, “Implementasi Jalur Terpendek Menggunakan Ant Colony Optimization,” Din. Rekayasa, vol. 1, no. 16, 2020, doi: 10.20884/1.dr.2020.16.1.294.

N. A. M. Sabri, A. S. H. Basari, and K. A. F. A. Samah, “Dijkstra-Ant Colony Optimization Algorithm For Shortest And Safest Evacuation In High Rise Building,” J. Teknol., vol. 3, 2022, doi: 10.11113/jt.v79.5912.

Salim Y and Kurniati N, “Penerapan Metode Dijkstra Untuk Menentukan Lokasi Dan Jarak Tempuh Terpendek Kampus UMI Makassar,” Bul Sist Inf dan Teknol Islam, vol. 2, no. 3, pp. 197–207, 2021.

Inayah AM, Resti NC, and Ilmiyah NF, “Analisa Perbandingan Algoritma Floyd-Warshall Dan Algoritma Dijkstra Untuk Penentuan Rute Terdekat,” J Ilm Mat Realis, vol. 2, no. 4, pp. 146–55, 2023.

García M, López N, and Rodríguez I, “A full process algebraic representation of Ant Colony Optimization,” Inf Sci, 2024.

Karjono K, Moedjiono M, and Kurniawan D, “Ant colony optimization,” J Ticom, vol. 3, no. 4, 2023.

Nugroho AK, Permadi I, Kurniawan YI, Hanifa A, and Nofiyati N, “Decision tree using ant colony for classification of health data,” AIP Conf. Proc., 2023.

Fallo DY, “Pencarian Jalur Terpendek Menggunakan Algoritma Ant Colony Optimization,” J Pendidik Teknol Inf, vol. 1, no. 1, pp. 28–32, 2020.

S. Z. Liu S, Jiang H, Chen S, Ye J, He R, “Integrating Dijkstra’s algorithm into deep inverse reinforcement learning for food delivery route planning,” Transp Res Part E Logist Transp Rev, 2020.

Y. X. Qing, Zheng Z, “Path-planning of automated guided vehicle based on improved Dijkstra algorithm,” Chinese Control Decis. Conf., pp. 7138–43, 2020.

W. Y. Wang T, Wang L, Li D, Cai J, “Monte Carlo-based improved ant colony optimization for path planning of welding robot,” J King Saud Univ - Comput Inf Sci, vol. 7, no. 35, 2023.

Cui J, Wu L, Huang X, Xu D, Liu C, and Xiao W, “Multi-strategy adaptable ant colony optimization algorithm and its application in robot path planning,” Knowledge-Based Syst, 2024.

Pasandi L, Hooshmand M, and Rahbar M, “Modified Algorithm integrated with ant colony optimization for multi-objective route-finding; case study: Yazd,” Appl Soft Comput, 2021.

Xu D and Tian Y, “A comprehensive survey of clustering algorithms,” Ann data Sci, vol. 2, pp. 165–93, 2020.

Cevizci B, “Calculating the Shortest Path Using Dijkstra’s Algorithm,” J. Inq Based Act, vol. 2, no. 8, pp. 70–85, 2022.

Tyas YS and Prijodiprodjo W, “Aplikasi Pencarian Rute Terbaik dengan Metode Ant Colony Optimazation (ACO).,” Indones. J Comput Cybern Syst, vol. 1, pp. 55–64, 2023.

Maryani R, “Sistem Pendukung Keputusan Cerdas Menggunakan Metode Ant Colont Optimization (ACO) untuk Pencarian Jalur Optimum Rantai Pasok Bioenergi Berbasis Kelapa Sawit,” J Inf. Ekon Bisnis, 2022.

Karimi M, Kolahdouz-Rahimi S, and Troya J, “Ant-colony optimization for automating test model generation in model transformation testing,” J Syst Softw, 2024.

Peranginangin J, Purba R, and Halim A, “Analisis Perbandingan Algoritma ACO-TS dan ACO-SMARTER Dalam Menyelesaikan Traveling Salesman Problem,” J media Inf. budidarma, vol. 4, no. 5, pp. 1698–705, 2021.

L. F. Sang H, You Y, Sun X, Zhou Y, “The hybrid path planning algorithm based on improved and artificial potential field for unmanned surface vehicle formations,” Ocean Eng, 2021.

Kyriakakis NA, Marinaki M, and Marinakis Y, “A hybrid ant colony optimization-variable neighborhood descent approach for the cumulative capacitated vehicle routing problem,” Comput Oper Res, 2021.


Bila bermanfaat silahkan share artikel ini

Berikan Komentar Anda terhadap artikel The Determination of Availability Path Planning in Natural Tourist Attractions using Dijkstra's Algorithm and Ant Colony Optimization

Dimensions Badge
Article History
Submitted: 2024-11-23
Published: 2024-11-30
Abstract View: 47 times
PDF Download: 12 times
Section
Articles