Optimization of the Shortest Route to Tourist Attractions in Tangerang Regency Using Genetic Algorithm with the Traveling Salesman Problem Approach
DOI:
https://doi.org/10.55537/spk.v4i1.1125Keywords:
genetic algorithm, route efficiency, tourist travel, travelling salesman problemAbstract
Tangerang Regency has numerous tourist destinations spread across various locations. However, tourists often face difficulties in determining an efficient travel route due to traffic congestion and irregular distances between sites. This issue leads to suboptimal travel time and reduces the overall comfort of the tourism experience. This study aims to optimize tourism travel routes in Tangerang Regency using a genetic algorithm approach based on the Travelling Salesman Problem (TSP). Data were collected from 17 tourist attractions, including their geographical coordinates, and processed through several genetic algorithm stages: population initialization, selection, crossover, and mutation. The results show that the genetic algorithm successfully produced an optimal route with a total distance of 109.77 km and the best fitness value of 0.009110. Compared to the initial distance before optimization, which was 215.80 km, this result indicates a travel distance efficiency improvement of 49.15%. These findings suggest that the genetic algorithm approach provides an effective solution for tourism route planning. The results are expected to serve as a basis for developing tourism promotion strategies and improving infrastructure in Tangerang Regency.
Downloads
References
N. P. Jayanti, “Pengembangan objek wisata Pantai Gandoriah Kota Pariaman,” Jurnal Pariwisata, vol. 6, no. 2, Sep. 2019. [Online]. Available: http://ejournal.bsi.ac.id/ejurnal/index.php/jp
M. S. Ghanim and G. Abu-Lebdeh, “Characterization of heavy vehicle headways in oversaturated interrupted conditions: Towards development of passenger car equivalency factors,” International Journal of Transportation Science and Technology, vol. 11, no. 3, pp. 589–602, Sep. 2022, doi: 10.1016/j.ijtst.2021.07.002
Y. Li, W. Chen, B. Fu, Z. Wu, and L. Hao, “A global coverage path planning method for multi-UAV maritime surveillance in complex obstacle environments,” Drones, vol. 8, no. 12, Dec. 2024, doi: 10.3390/drones8120764
Q. Chen, G. Yao, L. Yang, T. Liu, J. Sun, and S. Cai, “Research on ship replenishment path planning based on the modified whale optimization algorithm,” Biomimetics, vol. 10, no. 3, Mar. 2025, doi: 10.3390/biomimetics10030179
Y. Su, Y. Ran, Z. Yan, Y. Zhang, and X. Yang, “Solving the traveling salesman problem using the IDINFO algorithm,” ISPRS International Journal of Geo-Information, vol. 14, no. 3, Mar. 2025, doi: 10.3390/ijgi14030111
T. Guo, L. Huang, and H. Han, “An effective path planning method based on VDWF-MOIA for multi-robot patrolling in expo parks,” Electronics, vol. 14, no. 6, pp. 1–27, Mar. 2025, doi: 10.3390/electronics14061222
A. Rahma Amin, M. Ikhsan, and L. Wibisono, “Traveling salesman problem.” [Online]. Available: http://www.tsp.gatech.edu/world/index.html
Zupemungkas, H., & Handayani, W. (2021). Optimalisasi Rute Distribusi Menggunakan Metode Traveling Salesman Problem (TSP) Untuk Meminimasi Biaya Distribusi. Jurnal E-Qien Ekonomi dan Bisnis, 8(2).
B. Zhang, Y. Liu, T. Gao, J. Yin, Z. Guan, D. Zhang, and L. Zeng, "Automatic Extraction and Compensation of P-Bit Device Variations in Large Array Utilizing Boltzmann Machine Training," Micromachines, vol. 16, no. 2, p. 133, 2025, doi: 10.3390/mi16020133
A. O. Titilayo et al., “Selected soft computing algorithms for solving travelling salesman problem,” International Journal of Progressive Sciences and Technologies (IJPSAT), vol. 28, no. 2, pp. 672–679, 2021, doi: 10.52155/IJPSAT.V28.2.3547
M. Muharrom, “Implementasi algoritma Dijkstra dalam penentuan jalur terpendek studi kasus jarak tempat kuliah terdekat,” Indonesian Journal of Business Intelligence (IJUBI), vol. 3, no. 1, p. 25, Jul. 2020, doi: 10.21927/ijubi.v3i1.1229
F. R. Khoir, A. A. Subandri, F. N. Alanshori, Z. M. H. Solihah, M. Munawir, and A. S. Perdana, “Perencanaan rute optimal kunjungan destinasi wisata Bandung dengan algoritma Dijkstra pada C++,” Jurnal Teknologi dan Sistem Informasi Bisnis, vol. 6, no. 2, pp. 275–281, Apr. 2024, doi: 10.47233/jteksis.v6i2.1167
D. E. Sihombing and F. Ahyaningsih, “Optimalisasi rute distribusi air minum dalam kemasan menggunakan algoritma genetika pada PT. Mual Natio Maju Bersama,” Jurnal Riset Rumpun Ilmu Pendidikan (JURRIPEN), vol. 2, no. 1, pp. 70–83, Apr. 2023, doi: 10.55606/jurripen.v2i1.815
T. Setiadi, F. Darnis, and S. D. Ilhami, “Optimasi perutean jalur kendaraan terdekat traveling salesman problem dengan artificial bee colony algorithm,” Jurnal KomtekInfo, vol. 11, no. 2, pp. 42–48, Jun. 2024, doi: 10.35134/komtekinfo.v11i2.502
F. Zulkarnain and S. Suseno, “Optimalisasi rute dan biaya distribusi menggunakan metode saving matrix dan metode traveling salesman problem (TSP) pada depot air minum Splazz,” Jurnal Ilmiah Sains Teknologi dan Informasi, vol. 2, no. 2, pp. 21–28, Apr. 2024, doi: 10.59024/jiti.v2i2.717
D. Ariadi, “Aplikasi algoritma genetika dalam mengoptimasi tuned mass damper untuk mereduksi getaran pada gedung akibat beban gempa,” Jurnal Kacapuri, vol. 4, no. 1, Jun. 2021, doi: 10.31602/jk.v4i1.5125
M. F. A. Tarigan, S. Sulystiani, and S. O. Sutra, “Analisis pengaruh kualitas produk terhadap keputusan pembelian sandal dan sepatu wanita dengan metode COPRAS,” Sistem Pendukung Keputusan dengan Aplikasi, vol. 4, no. 1, pp. 1–7, Mar. 2025, doi: 10.55537/spk.v4i1.895
C. Zhang et al., “An improved NSGA-II-based method for cutting trajectory planning of boom-type roadheader,” Applied Sciences, vol. 15, no. 4, Feb. 2025, doi: 10.3390/app15042126
S. Liu, D. Liu, and M. Le, “Multi-UAV delivery path optimization based on fuzzy C-means clustering algorithm based on annealing genetic algorithm and improved Hopfield neural network,” World Electric Vehicle Journal, vol. 16, no. 3, Mar. 2025, doi: 10.3390/wevj16030157
D. Yan, B. Ou, Q. Guan, Z. Zhu, and H. Cao, “Edge-driven multiple trajectory attention model for vehicle routing problems,” Applied Sciences, vol. 15, no. 5, pp. 1–18, Mar. 2025, doi: 10.3390/app15052679
A. P. Sari and S. Supiyandi, “Sistem pendukung keputusan perekrutan panitia pemilihan kecamatan menggunakan metode additive ratio assessment,” Sistem Pendukung Keputusan dengan Aplikasi, vol. 3, no. 2, pp. 88–99, Sep. 2024, doi: 10.55537/spk.v3i2.789
M. K. Sharma, “Modified genetic algorithm with novel crossover and mutation operator for travelling salesman problem,” Sigma Journal of Engineering and Natural Sciences – Sigma Mühendislik ve Fen Bilimleri Dergisi, 2023, doi: 10.14744/sigma.2023.00105
B. Ghimire, A. Mahmood, and K. Elleithy, “One-shot autoregressive generation of combinatorial optimization solutions based on the large language model architecture and learning algorithms,” AI, vol. 6, no. 4, p. 66, Mar. 2025, doi: 10.3390/ai6040066
Y. Min and C. P. Gomes, “On size and hardness generalization in unsupervised learning for the travelling salesman problem,” Mar. 2024. [Online]. Available: http://arxiv.org/abs/2403.20212
J. Feng, X. Liu, H. Ji, C. He, and L. Liu, “Research on 3D path optimization for an inspection micro-robot in oil-immersed transformers based on a hybrid algorithm,” Sensors, vol. 25, no. 9, p. 2666, Apr. 2025, doi: 10.3390/s25092666
Downloads
Published
How to Cite
Issue
Section
License
Copyright (c) 2025 Ramadhani Ramadhani, Ramadhanu Ramadhanu, Fahmi Fiddin
This work is licensed under a Creative Commons Attribution-ShareAlike 4.0 International License.
