OPTIMASI RUTE PANDUAN INFORMASI LOKASI WISATA MENGGUNAKAN ANT COLONY SYSTEM PADA KOTA BATAM
Abstract
The number of tourists visiting the city of Batam both domestic and foreign tourists to spend their vacation time because the cost of living and goods are cheaper than other areas because batam is an FTZ area (free tax Zone). So that the city of Batam has become a shopping paradise for the people around Batam or outside Batam. Batam itself has several shopping destinations and places to visit for tourists. With the abundance of tourist destinations in the city of Batam, both shopping and nature tourism, it is not uncommon for tourists to experience various problems in visiting the country, one of the simple problems experienced is the problem of time and cost efficiency in conducting tours to the city of Batam. The problem that we can solve in this research is to help tourists or tourists not experience difficulties when visiting tourist attractions in Batam by using the ant colony algorithm in efficient path selection. The Waterfall Model in SDLC is a process that will be used in this study to get the best results.
References
Angga Ginanjar Mabrur, L. R. (2012). Penerapan Data Mining Untuk Memprediksi Kriteria Nasabah Kredit. Jurnal Komputer Dan Informatika (KOMPUTA), 1(1), 53–57.
Chan, A. S., & Sari, I. U. (2017). Rancang Bangun Aplikasi Wisata Kuliner Halal Berbasis Android Pada Negara Singapura, 9(2), 1323–1334.
Chen, L., Xiao, C., Li, X., Wang, Z., & Huo, S. (2018). A seismic fault recognition method based on ant colony optimization. Journal of Applied Geophysics, 152, 1–8. https://doi.org/10.1016/j.jappgeo.2018.02.009
Jiao, Z., Ma, K., Rong, Y., Wang, P., Zhang, H., & Wang, S. (2018). A path planning method using adaptive polymorphic ant colony algorithm for smart wheelchairs. Journal of Computational Science, 25, 50–57. https://doi.org/10.1016/j.jocs.2018.02.004
Lorena, S., Zarman, W., & Hamidah, I. (2014). Analisis Dan Penerapan Algoritma C4.5 Dalam Data Mining Untuk Memprediksi Masa Studi Mahasiswa Berdasarkan Data Nilai Akademik. Prosiding Seminar Nasional Aplikasi Sains Dan Teknologi (SNAST), (November), 263–272. https://doi.org/10.5829/idosi.weasj.2015.6.2.22162
Maryati, I., & Wibowo, H. K. (2012). Optimasi penentuan rute kendaraan pada sistem distribusi barang dengan ant colony optimization. Seminar Nasional Teknlogi Infromasi & Komunikasi Terapan 2012, 2012(Semantik), 163–168.
Melo, L., Pereira, F., & Costa, E. (2014). Extended experiments with ant colony optimization with heterogeneous ants for large dynamic traveling salesperson problems. Proceedings - 14th International Conference on Computational Science and Its Applications, ICCSA 2014, 171–175. https://doi.org/10.1109/ICCSA.2014.39
Ning, J., Zhang, Q., Zhang, C., & Zhang, B. (2018). A best-path-updating information-guided ant colony optimization algorithm. Information Sciences, 433-434, 142–162. https://doi.org/10.1016/j.ins.2017.12.047
Primadany, S. R., & Mardiyono, R. (n.d.). ANALISIS STRATEGI PENGEMBANGAN PARIWISATA DAERAH (Studi pada Dinas Kebudayaan dan Pariwisata Daerah Kabupaten Nganjuk). Jurnal Administrasi Publik (JAP), 1(4), 135–143. Retrieved from https://media.neliti.com/media/publications/74232-ID-analisis-strategi-pengembangan-pariwisat.pdf
Singkil, K. A. B. A. (2015). Sistem Pendukung Keputusan Pengangkatan Karyawan Tetap Dengan Metode Analytic Hierarchy Process ( Ahp ) Pada Pt . Perkebunan Lembah Bhakti Propinsi Nad, (April), 96–106.
Sitanggang, Y. C., Dewi, C., Wihandika, R. C., Studi, P., Informatika, T., Komputer, F. I., & Brawijaya, U. (2018). Pemilihan Rute Optimal Penjemputan Penumpang Travel Menggunakan Ant Colony Optimization Pada Multiple Travelling Salesman Problem ( M-TSP ), 2(9), 3138–3145.
Zulkifli, A. (2016). Metode C45 Untuk Mengklarifikasi Pelanggan Perusahaan Telekomunikasi Seluler, 2(1), 65–76.
This is an open-access article distributed under the terms of the Creative Commons Attribution-ShareAlike 4.0 International License which permits unrestricted use, distribution, and reproduction in any medium. Users are allowed to read, download, copy, distribute, search, or link to full-text articles in this journal without asking by giving appropriate credit, provide a link to the license, and indicate if changes were made. All of the remix, transform, or build upon the material must distribute the contributions under the same license as the original.
